@Preamble{
"\ifx \undefined \bbb \def \bbb #1{\mathbb{#1}} \fi"
# "\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi"
# "\ifx \undefined \circled \def \circled #1{(#1)}\fi"
# "\ifx \undefined \cprime \def \cprime {$\mathsurround=0pt '$}\fi"
# "\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}}\fi"
# "\ifx \undefined \mathrm \def \mathrm #1{{\rm #1}}\fi"
# "\ifx \undefined \reg \def \reg {\circled{R}}\fi"
# "\ifx \undefined \textperiodcentered \def \textperiodcentered {$\cdot$} \fi"
# "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
# "\hyphenation{
Aba-di
Arch-ives
Ding-yi
for-ge-ry
Go-pa-la-krish-nan
Hi-de-ki
Kraw-czyk
Lands-verk
Law-rence
Leigh-ton
Mich-ael
Moell-er
North-ridge
para-digm
para-digms
Piep-rzyk
Piv-e-teau
Ram-kilde
Re-tro-fit-ting
Rich-ard
Sho-stak
Si-ro-mo-n-ey
Ste-ph-en
The-o-dore
Tho-m-as
Tzone-lih
venge-ance
Will-iam
Ye-sh-i-va
}"
}
@String{ack-bs = "Bruce Schneier,
Counterpane Systems,
101 East Minnehaha Parkway,
Minneapolis, MN 55419,
e-mail: \path|schneier@counterpane.com"}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|https://www.math.utah.edu/~beebe/|"}
@String{ack-pb = "Preston Briggs,
Tera Computer Company,
2815 Eastlake East,
Seattle, WA 98102,
USA,
Tel: +1 206 325-0800,
e-mail: \path|preston@tera.com|"}
@String{inst-COUNTERPANE-INTERNET-SECURITY = "Counterpane Internet Security"}
@String{inst-COUNTERPANE-INTERNET-SECURITY:adr = "3031 Tisch Way, Suite 100PE,
San Jose, CA 95128, USA"}
@String{inst-COUNTERPANE-SYSTEMS = "Counterpane Systems"}
@String{inst-COUNTERPANE-SYSTEMS:adr = "101 East Minnehaha Parkway, Minneapolis,
MN 55419"}
@String{inst-UTAH-MATH = "University of Utah, Department of Mathematics"}
@String{inst-UTAH-MATH:adr = "Salt Lake City, UT 84112-0090, USA"}
@String{j-ACM-COMM-COMP-ALGEBRA = "ACM Communications in Computer Algebra"}
@String{j-ACM-J-EXP-ALGORITHMICS = "ACM Journal of Experimental Algorithmics"}
@String{j-ADV-COMPUT-MATH = "Advances in Computational Mathematics"}
@String{j-AIP-CONF-PROC = "AIP Conference Proceedings"}
@String{j-ALGORITHMICA = "Algorithmica"}
@String{j-ALGORITHMS-BASEL = "Algorithms ({Basel})"}
@String{j-AMER-MATH-MONTHLY = "American Mathematical Monthly"}
@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-AUDITING = "Auditing: A Journal of Practice \& Theory"}
@String{j-BELL-LABS-TECH-J = "Bell Labs Technical Journal"}
@String{j-BELL-SYST-TECH-J = "The Bell System Technical Journal"}
@String{j-BRITISH-J-HIST-SCI = "British Journal for the History of Science"}
@String{j-BSHM-BULL = "BSHM Bulletin: Journal of the British Society
for the History of Mathematics"}
@String{j-BULL-AUSTRAL-MATH-SOC = "Bulletin of the Australian Mathematical
Society"}
@String{j-CACM = "Communications of the Association for
Computing Machinery"}
@String{j-CCPE = "Concurrency and Computation: Prac\-tice and
Experience"}
@String{j-CCCUJ = "C/C++ Users Journal"}
@String{j-CGF = "Com{\-}pu{\-}ter Graphics Forum"}
@String{j-CHAOS-SOLITONS-FRACTALS = "Chaos, solitons \& fractals"}
@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-COMBIN-PROBAB-COMPUT = "Combinatorics, Probability and Computing"}
@String{j-COMP-ARCH-NEWS = "ACM SIGARCH Computer Architecture News"}
@String{j-COMP-GRAPHICS = "Computer Graphics"}
@String{j-COMP-J = "The Computer Journal"}
@String{j-COMP-NET-AMSTERDAM = "Computer Networks (Amsterdam, Netherlands:
1999)"}
@String{j-COMP-PHYS-COMM = "Computer Physics Communications"}
@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-INTELL = "Computational Intelligence"}
@String{j-COMPUT-MATH-APPL = "Computers and Mathematics with Applications"}
@String{j-COMPUT-SECUR = "Computers \& Security"}
@String{j-COMPUT-SECUR-J = "Computer Security Journal"}
@String{j-COMPUTER = "Computer"}
@String{j-COMPUTERS-AND-GRAPHICS = "Computers and Graphics"}
@String{j-COMPUTING = "Computing"}
@String{j-DDJ = "Dr. Dobb's Journal of Software Tools"}
@String{j-DISCRETE-APPL-MATH = "Discrete Applied Mathematics"}
@String{j-EDUC-STUD-MATH = "Educational Studies in Mathematics"}
@String{j-ELECT-COMM-JAPAN-3-FUND-ELECT-SCI = "Electronics and communications
in Japan. Part 3, Fundamental electronic
science"}
@String{j-ELECTRONIK = "Elektronik"}
@String{j-EMBEDDED-LINUX-J = "Embedded Linux Journal"}
@String{j-EURASIP-J-APPL-SIG-PROC = "EURASIP Journal on Applied Signal Processing"}
@String{j-EURASIP-J-EMBED-SYS = "EURASIP Journal on Embedded Systems"}
@String{j-EXP-MATH = "Experimental Mathematics"}
@String{j-FORM-ASP-COMPUT = "Formal Aspects of Computing"}
@String{j-FOUND-PHYS-LETT = "Foundations of Physics Letters"}
@String{j-FUND-INFO = "Fundamenta Informaticae"}
@String{j-FUT-GEN-COMP-SYS = "Future Generation Computer Systems"}
@String{j-GLASG-MATH-J = "Glasgow Mathematical Journal"}
@String{j-HIGHER-ORDER-SYMB-COMPUT = "Higher-Order and Symbolic Computation"}
@String{j-IBM-JRD = "IBM Journal of Research and Development"}
@String{j-IBM-SYS-J = "IBM Systems Journal"}
@String{j-IEEE-ANN-HIST-COMPUT = "IEEE Annals of the History of Computing"}
@String{j-IEEE-CGA = "IEEE Computer Graphics and Applications"}
@String{j-IEEE-CONCURR = "IEEE Concurrency"}
@String{j-IEEE-DES-TEST-COMPUT = "IEEE Design \& Test of Computers"}
@String{j-IEEE-DISTRIB-SYST-ONLINE = "IEEE Distributed Systems Online"}
@String{j-IEEE-J-SOLID-STATE-CIRCUITS = "IEEE Journal of Solid-State Circuits"}
@String{j-IEEE-MICRO = "IEEE Micro"}
@String{j-IEEE-MULTIMEDIA = "IEEE MultiMedia"}
@String{j-IEEE-SEC-PRIV = "IEEE Security \& Privacy"}
@String{j-IEEE-SOFTWARE = "IEEE Software"}
@String{j-IEEE-SPECTRUM = "IEEE Spectrum"}
@String{j-IEEE-TRANS-CIRCUITS-SYST-1 = "IEEE Transactions on Circuits and
Systems I: Regular Papers"}
@String{j-IEEE-TRANS-CIRCUITS-SYST-I-FUNDAM-THEORY-APPL = "IEEE Transactions on
Circuits and Systems I: Fundamental
Theory and Application"}
@String{j-IEEE-TRANS-CIRCUITS-SYST-2 = "IEEE transactions on circuits and
systems. 2, Analog and digital signal
processing"}
@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-SOFTW-ENG = "IEEE Transactions on Software Engineering"}
@String{j-IEEE-TRANS-VIS-COMPUT-GRAPH = "IEEE Transactions on Visualization
and Computer Graphics"}
@String{j-IETE-TECH-REV = "IETE Technical Review"}
@String{j-IJCSS = "International Journal of Computer Science and
Security (IJCSS)"}
@String{j-IJHPCA = "The International Journal of High
Performance Computing Applications"}
@String{j-IMAGE-VIS-COMPUT = "Image and Vision Computing"}
@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-COMP-RESEARCH = "International Journal of Computer Research"}
@String{j-INT-J-COMPUT-MATH = "International Journal of Computer
Mathematics"}
@String{j-INT-J-COMPUT-APPL = "International Journal of Computer
Applications"}
@String{j-INT-J-COMPUT-SYST-SCI-ENG = "International Journal of Computer
Systems Science and Engineering"}
@String{j-INT-J-DIGIT-LIBR = "International Journal on Digital Libraries"}
@String{j-INT-J-ELECTRON = "International Journal of Electronics
Theoretical \& Experimental"}
@String{j-INT-J-FOUND-COMP-SCI = "International Journal of Foundations of
Computer Science (IJFCS)"}
@String{j-INT-J-IMAGE-GRAPHICS = "International Journal of Image and Graphics
(IJIG)"}
@String{j-INT-J-INFO-SEC = "International Journal of Information
Security"}
@String{j-INT-J-MOD-PHYS-C = "International Journal of Modern Physics C
[Physics and Computers]"}
@String{j-INT-J-NUMBER-THEORY = "International Journal of Number Theory (IJNT)"}
@String{j-INT-J-PARALLEL-PROG = "International Journal of Parallel
Programming"}
@String{j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER = "International Journal on
Software Tools for Technology Transfer: STTT"}
@String{j-INT-J-SYST-SCI = "International Journal of Systems Science"}
@String{j-INTEL-TECH-J = "Intel Technology Journal"}
@String{j-INTELL-NATL-SECUR = "Intelligence and National Security"}
@String{j-J-ACM = "Journal of the ACM"}
@String{j-J-ALG = "Journal of Algorithms"}
@String{j-J-AM-SOC-INF-SCI-TECHNOL = "Journal of the American Society for
Information Science and Technology: JASIST"}
@String{j-J-AUTOM-REASON = "Journal of Automated Reasoning"}
@String{j-J-COMP-SCI-TECH = "Journal of computer science and technology"}
@String{j-J-COMP-SYS-SCI = "Journal of Computer and System Sciences"}
@String{j-J-COMPUT-APPL-MATH = "Journal of Computational and Applied
Mathematics"}
@String{j-J-COMP-SECUR = "Journal of Computer Security"}
@String{j-J-GRID-COMP = "Journal of Grid Computing"}
@String{j-J-HIST-ASTRON = "Journal for the History of Astronomy"}
@String{j-J-INFO-SCI-ENG = "Journal of Information Science and
Engineering"}
@String{j-J-MATH-PHYS = "Journal of Mathematical Physics"}
@String{j-J-NETW-COMPUT-APPL = "Journal of Network and Computer
Applications"}
@String{j-J-NUMBER-THEORY = "Journal of Number Theory"}
@String{j-J-PAR-DIST-COMP = "Journal of Parallel and Distributed
Computing"}
@String{j-J-SOUND-VIB = "Journal of Sound and Vibration"}
@String{j-J-STAT-COMPUT-SIMUL = "Journal of Statistical Computation and
Simulation"}
@String{j-J-STAT-PLANN-INFERENCE = "Journal of Statistical Planning and
Inference"}
@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-J-VLSI-SIGNAL-PROC = "Journal of VLSI Signal Processing"}
@String{j-JDIQ = "Journal of Data and Information
Quality (JDIQ)"}
@String{j-JERIC = "ACM Journal on Educational Resources in
Computing (JERIC)"}
@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-LOS-ALAMOS-SCIENCE = "Los Alamos Science"}
@String{j-MATH-COMP-SIM = "Mathematics and Computers in Simulation"}
@String{j-MATH-COMPUT = "Mathematics of Computation"}
@String{j-MATHEMATIKA = "Mathematika"}
@String{j-NAMS = "Notices of the American Mathematical
Society"}
@String{j-NETWORK-SECURITY = "Network Security"}
@String{j-NEW-GEN-COMP = "New Generation Computing"}
@String{j-NORDIC-J-COMPUT = "Nordic Journal of Computing"}
@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-COMPUTING = "Parallel Computing"}
@String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"}
@String{j-PC-MAGAZINE = "PC Magazine"}
@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-PHYS-REV-LET = "Physical Review Letters"}
@String{j-PRAMANA = "Pramana: Journal of Physics"}
@String{j-PROBL-INF-TRANSM = "Problems of Information Transmission"}
@String{j-PROC-NATL-ACAD-SCI-USA = "Proceedings of the National Academy of
Sciences of the United States of America"}
@String{j-PROC-SPIE = "Proceedings of the SPIE --- The
International Society for Optical
Engineering"}
@String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"}
@String{j-QUEUE = "ACM Queue: Tomorrow's Computing Today"}
@String{j-REV-MOD-PHYS = "Reviews of Modern Physics"}
@String{j-REV-SCI-INSTRUM = "Review of Scientific Instruments"}
@String{j-RUTHERFORD-J = "Rutherford Journal"}
@String{j-SCI-AMER = "Scientific American"}
@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-REVIEW = "SIAM Review"}
@String{j-SIGACT = "ACM SIGACT News"}
@String{j-SIGADA-LETTERS = "ACM SIGADA Ada Letters"}
@String{j-SIGCSE = "SIGCSE Bulletin (ACM Special Interest Group
on Computer Science Education)"}
@String{j-SIGKDD = "ACM SIGKDD Explorations Newsletter"}
@String{j-SIGMETRICS = "ACM SIGMETRICS Performance Evaluation
Review"}
@String{j-SIGMOD = "SIGMOD Record (ACM Special Interest
Group on Management of Data)"}
@String{j-SIGPLAN = "ACM SIG{\-}PLAN Notices"}
@String{j-SIGSAM = "SIGSAM Bulletin (ACM Special Interest Group
on Symbolic and Algebraic Manipulation)"}
@String{j-SIGSOFT = "ACM SIGSOFT Software Engineering Notes"}
@String{j-SPE = "Soft\-ware\emdash Prac\-tice and Experience"}
@String{j-STUD-HIST-PHILOS-MOD-PHYS = "Studies in History and Philosophy of
Modern Physics"}
@String{j-SYNTHESE = "Synthese"}
@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-TAP = "ACM Transactions on Applied Perception"}
@String{j-TCBB = "IEEE/ACM Transactions on Computational
Biology and Bioinformatics"}
@String{j-TECH-CULTURE = "Technology and Culture"}
@String{j-TECS = "ACM Transactions on Embedded Computing
Systems"}
@String{j-THEOR-COMP-SCI = "Theoretical Computer Science"}
@String{j-TISSEC = "ACM Transactions on Information and System
Security"}
@String{j-TOCL = "ACM Transactions on Computational Logic"}
@String{j-TOCS = "ACM Transactions on Computer Systems"}
@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-TOMACS = "ACM Transactions on Modeling and Computer
Simulation"}
@String{j-TOMCCAP = "ACM Transactions on Multimedia Computing,
Communications, and Applications"}
@String{j-TOPLAS = "ACM Transactions on Programming
Languages and Systems"}
@String{j-TOS = "ACM Transactions on Storage"}
@String{j-TOSEM = "ACM Transactions on Software Engineering and
Methodology"}
@String{j-TOSN = "ACM Transactions on Sensor Networks"}
@String{j-TRANS-INFO-PROCESSING-SOC-JAPAN = "Transactions of the Information
Processing Society of Japan"}
@String{j-TRETS = "ACM Transactions on Reconfigurable Technology
and Systems (TRETS)"}
@String{j-VLDB-J = "VLDB Journal: Very Large Data Bases"}
@String{j-WIRED = "Wired"}
@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-AIP = "American Institute of Physics"}
@String{pub-AIP:adr = "Woodbury, NY, 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-BN = "Barnes and Noble"}
@String{pub-BN:adr = "New York, NY, USA"}
@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 = "Clarendon Press"}
@String{pub-CLARENDON: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-ECMA = "ECMA (European Association for
Standardizing Information and
Communication Systems)"}
@String{pub-ECMA:adr = "Geneva, Switzerland"}
@String{pub-ELSEVIER = "Elsevier"}
@String{pub-ELSEVIER:adr = "Amsterdam, The Netherlands"}
@String{pub-ELSEVIER-ACADEMIC = "Elsevier Academic Press"}
@String{pub-ELSEVIER-ACADEMIC:adr = "Amsterdam, The Netherlands"}
@String{pub-FABER-FABER = "Faber and Faber"}
@String{pub-FABER-FABER:adr = "London, UK"}
@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-INTEL = "Intel Corporation"}
@String{pub-INTEL:adr = "Santa Clara, CA, USA"}
@String{pub-ISO = "International Organization for
Standardization"}
@String{pub-ISO:adr = "Geneva, Switzerland"}
@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-MACMILLAN = "MacMillan Publishing Company"}
@String{pub-MACMILLAN:adr = "New York, NY, USA"}
@String{pub-MATH-ASSOC-AMER = "Mathematical Association of America"}
@String{pub-MATH-ASSOC-AMER:adr = "Washington, DC, USA"}
@String{pub-MCGRAW-HILL = "Mc{\-}Graw-Hill"}
@String{pub-MCGRAW-HILL:adr = "New York, NY, USA"}
@String{pub-MICROSOFT = "Microsoft Press"}
@String{pub-MICROSOFT:adr = "Redmond, WA, USA"}
@String{pub-MIT = "MIT Press"}
@String{pub-MIT:adr = "Cambridge, MA, USA"}
@String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}
@String{pub-MORGAN-KAUFMANN-SF = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN-SF:adr = "San Francisco, CA, USA"}
@String{pub-NEW-RIDERS = "New Riders Publishing"}
@String{pub-NEW-RIDERS:adr = "Carmel, IN, USA"}
@String{pub-NEWNES = "Newnes Press"}
@String{pub-NEWNES:adr = "Amsterdam, The Netherlands and Boston, MA,
USA"}
@String{pub-NIST = "National Institute for Standards and
Technology"}
@String{pub-NIST:adr = "Gaithersburg, MD 20899-8900, USA"}
@String{pub-NO-STARCH = "No Starch Press"}
@String{pub-NO-STARCH:adr = "San Francisco, CA, USA"}
@String{pub-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-SIMON-SCHUSTER = "Simon and Schuster"}
@String{pub-SIMON-SCHUSTER:adr = "New York, NY, 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-SUN-MICROSYSTEMS-PRESS = "Sun Microsystems Press"}
@String{pub-SUN-MICROSYSTEMS-PRESS:adr = "Palo Alto, CA, 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-WEIDENFELD-NICOLSON = "Weidenfeld and Nicolson"}
@String{pub-WEIDENFELD-NICOLSON:adr = "London, UK"}
@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-WROX = "Wrox Press"}
@String{pub-WROX:adr = "Chicago, IL, USA"}
@String{ser-LNAI = "Lecture Notes in Artificial Intelligence"}
@String{ser-LNCS = "Lecture Notes in Computer Science"}
@String{ser-LNMATH = "Lecture Notes in Mathematics"}
@String{ser-PROJECT-GUTENBERG = "Project Gutenberg"}
@String{ser-SIGPLAN = "ACM SIG{\-}PLAN Notices"}
@Book{Tippett:1927:RSN,
author = "L. H. C. (Leonard Henry Caleb) Tippett",
title = "Random sampling numbers",
volume = "15",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "viii + xxvi",
year = "1927",
LCCN = "QA47 .T7 no. 15",
bibdate = "Sat Aug 23 08:23:19 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Reprinted in 1952. Reprinted in 1959 with a foreword
by Karl Pearson.",
series = "Tracts for computers",
acknowledgement = ack-nhfb,
annote = "This may be the first known publication of tables of
random numbers. I found an unsubstantiated claim that
they were determined by taking the middle digits from
area measurements of English churches. See also
\cite{Rand:1955:MRD}.",
}
@Book{Kendall:1939:TRS,
author = "Maurice G. (Maurice George) Kendall and Bernard
{Babington Smith}",
title = "Tables of random sampling numbers",
volume = "XXIV",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "x + 60",
year = "1939",
LCCN = "QA47 .T7 no.24",
bibdate = "Sat Dec 24 08:04:43 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Tracts of computers \ldots{}",
acknowledgement = ack-nhfb,
remark = "On cover: Department of Statistics. University of
London, University College.",
subject = "Sampling (Statistics); Mathematics; Tables",
}
@Book{Rand:1955:MRD,
author = "{Rand Corporation}",
title = "A Million Random Digits With 100,000 Normal Deviates",
publisher = "Free Press",
address = "Glencoe, IL, USA",
pages = "xxv + 400 + 200",
year = "1955",
ISBN = "0-02-925790-5",
ISBN-13 = "978-0-02-925790-6",
LCCN = "QA276.5 .R3",
bibdate = "Sat Aug 23 07:58:03 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Reprinted in 1966 and 2001 \cite{Rand:2001:MRD}. See
also \cite{Tippett:1927:RSN}.",
acknowledgement = ack-nhfb,
}
@Book{Tuchman:1966:ZT,
author = "Barbara W. Tuchman",
title = "The {Zimmermann} telegram",
publisher = pub-MACMILLAN,
address = pub-MACMILLAN:adr,
pages = "xii + 244",
year = "1966",
LCCN = "D511 .T77 1966",
bibdate = "Wed Nov 25 13:57:39 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Reprint of original 1958 edition. Kahn
\cite{Kahn:1996:CSS} describes this book as
``recount[ing] the political effects of the most
important cryptogram solution in history''.",
acknowledgement = ack-nhfb,
}
@Book{Kahn:1967:CSSa,
author = "David Kahn",
title = "The Codebreakers: the Story of Secret Writing",
publisher = pub-MACMILLAN,
address = pub-MACMILLAN:adr,
pages = "xvi + 1164",
year = "1967",
LCCN = "Z103 .K28",
bibdate = "Tue Dec 01 08:31:37 1998",
bibsource = "http://www.cl.cam.ac.uk/~fapp2/steganography/bibliography;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-c.html#cryptography;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://www.cl.cam.ac.uk/~fapp2/steganography/bibliography/1000.html",
acknowledgement = ack-nhfb,
keywords = "information hiding; steganography",
}
@Book{Kahn:1967:CSSb,
author = "David Kahn",
title = "The Codebreakers: the Story of Secret Writing",
publisher = pub-WEIDENFELD-NICOLSON,
address = pub-WEIDENFELD-NICOLSON:adr,
pages = "xvi + 1164",
year = "1967",
LCCN = "Z103 .K28 1967",
bibdate = "Tue Dec 01 08:35:10 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
}
@Book{Kahn:1974:C,
author = "David Kahn",
title = "The Codebreakers",
publisher = pub-WEIDENFELD-NICOLSON,
address = pub-WEIDENFELD-NICOLSON:adr,
edition = "Abridged",
pages = "xvi + 576",
year = "1974",
ISBN = "0-297-76785-2",
ISBN-13 = "978-0-297-76785-5",
LCCN = "Z103 .K28 1974",
bibdate = "Thu Jul 23 17:02:35 1998",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
acknowledgement = ack-nhfb,
}
@Article{Blakley:1979:RSA,
author = "G. R. Blakley and I. Borosh",
title = "{Rivest--Shamir--Adleman} public key cryptosystems do
not always conceal messages",
journal = j-COMPUT-MATH-APPL,
volume = "5",
number = "3",
pages = "169--178",
year = "1979",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
MRclass = "94B99 (10A25 94A24)",
MRnumber = "81e:94026",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse.bib",
fjournal = "Computers \& Mathematics with Applications. An
International Journal",
remark = "This paper points out that the some keys in the RSA
may fail to encrypt: instead, they produce an output
ciphertext that is identical to the input plaintext.
See also \cite{Smith:1979:UFM,Bergmann:2009:DKR}",
}
@Article{Smith:1979:UFM,
author = "Donald R. Smith and James T. Palmer",
title = "Universal fixed messages and the
{Rivest--Shamir--Adleman} cryptosystem",
journal = j-MATHEMATIKA,
volume = "26",
number = "1",
pages = "44--52",
year = "1979",
CODEN = "MTKAAB",
ISSN = "0025-5793",
MRclass = "94B99",
MRnumber = "80m:94071",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse.bib",
fjournal = "Mathematika. A Journal of Pure and Applied
Mathematics",
remark = "This paper points out that the some keys in the RSA
may fail to encrypt: instead, they produce an output
ciphertext that is identical to the input plaintext.
See also \cite{Blakley:1979:RSA,Bergmann:2009:DKR}",
}
@Article{Lamont:1991:UFC,
author = "P. J. C. Lamont",
title = "Unique factorization in {Cayley} arithmetics and
cryptology",
journal = j-GLASG-MATH-J,
volume = "33",
number = "3",
pages = "267--273",
month = "????",
year = "1991",
CODEN = "????",
DOI = "https://doi.org/10.1017/S0017089500008326",
ISSN = "0017-0895 (print), 1469-509X (electronic)",
ISSN-L = "0017-0895",
bibdate = "Tue Sep 20 18:52:12 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Glasgow Mathematical Journal",
onlinedate = "18 May 2009",
}
@Book{Stinson:1995:CTP,
author = "Douglas R. (Douglas Robert) Stinson",
title = "Cryptography: theory and practice",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "434",
year = "1995",
ISBN = "0-8493-8521-0",
ISBN-13 = "978-0-8493-8521-6",
LCCN = "QA268 .S75 1995",
bibdate = "Fri Mar 23 11:28:53 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "The CRC Press series on discrete mathematics and its
applications",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography",
}
@Article{Wheeler:1995:TTE,
author = "D. J. Wheeler and R. M. Needham",
title = "{TEA}, a tiny encryption algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1008",
pages = "363--??",
year = "1995",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat May 11 13:45:32 MDT 1996",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs1996a.bib",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Kahn:1996:CSS,
author = "David Kahn",
title = "The Codebreakers: the Story of Secret Writing",
publisher = "Scribner",
address = "New York, NY, USA",
edition = "Revised",
pages = "xviii + 1181",
year = "1996",
ISBN = "0-684-83130-9",
ISBN-13 = "978-0-684-83130-5",
LCCN = "Z103 .K28 1996",
bibdate = "Thu Apr 29 18:02:15 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Tuchman:1966:ZT}.",
acknowledgement = ack-nhfb,
}
@Book{Diffie:1998:PLP,
author = "Whitfield Diffie and Susan Eva Landau",
title = "Privacy on the Line: the Politics of Wiretapping and
Encryption",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "ix + 342",
year = "1998",
ISBN = "0-262-04167-7 (hardcover)",
ISBN-13 = "978-0-262-04167-6 (hardcover)",
LCCN = "KF9670 .D54 1998",
bibdate = "Thu Mar 22 12:48:25 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Wiretapping; United States; Data encryption (Computer
science); Law and legislation; Privacy, Right of",
}
@Book{Grasser:1998:FC,
author = "R. Scott Grasser",
title = "{FINDsomeone.com}",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xvii + 137",
year = "1998",
ISBN = "0-7506-7020-7",
ISBN-13 = "978-0-7506-7020-3",
LCCN = "HV6762.U5 G73 1998",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
acknowledgement = ack-nhfb,
}
@Book{Hardy:1998:ITN,
author = "G. H. (Godfrey Harold) Hardy and Edward Maitland
Wright",
title = "An introduction to the theory of numbers",
publisher = pub-CLARENDON,
address = pub-CLARENDON:adr,
edition = "Fifth",
pages = "xvi + 426",
year = "1998",
ISBN = "0-19-853171-0 (paperback)",
ISBN-13 = "978-0-19-853171-5 (paperback)",
LCCN = "QA241 .H28 1998",
bibdate = "Fri Jun 24 12:34:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Oxford science publications",
acknowledgement = ack-nhfb,
author-dates = "1877--1947",
remark = "Reprint of 1979 and 1988 editions (with
corrections).",
subject = "Number theory",
}
@Article{Stone:1998:PCC,
author = "Jonathan Stone and Michael Greenwald and Craig
Partridge and James Hughes",
title = "Performance of checksums and {CRC}'s over real data",
journal = j-IEEE-TRANS-NETWORKING,
volume = "6",
number = "5",
pages = "529--543",
month = oct,
year = "1998",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.731187",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Jul 27 15:53:14 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/1998-6-5/p529-stone/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "algorithms; experimentation; measurement; performance;
theory; verification",
subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Reliability, availability, and
serviceability. {\bf C.2.1} Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Architecture and Design, Packet-switching networks.
{\bf C.2.1} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Asynchronous Transfer Mode (ATM). {\bf
C.2.2} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols,
TCP/IP.",
}
@Book{Bodycombe:1999:CC,
author = "David J. Bodycombe",
title = "Codes \& ciphers",
publisher = "Robinson",
address = "London, UK",
pages = "vi + 122",
year = "1999",
ISBN = "1-85487-897-2",
ISBN-13 = "978-1-85487-897-7",
LCCN = "????",
bibdate = "Sat Apr 20 11:56:00 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.nls.uk:7290/voyager",
acknowledgement = ack-nhfb,
subject = "Ciphers; Puzzles",
}
@Book{Goldreich:1999:MCP,
author = "Oded Goldreich",
title = "Modern cryptography, probabilistic proofs, and
pseudorandomness",
volume = "17",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 182",
year = "1999",
ISBN = "3-540-64766-X",
ISBN-13 = "978-3-540-64766-9",
LCCN = "QA76.9.A25 G64 1999",
bibdate = "Fri Mar 23 11:33:40 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Algorithms and combinatorics, 0937-5511",
URL = "http://www.loc.gov/catdir/enhancements/fy0815/98050548-d.html;
http://www.loc.gov/catdir/enhancements/fy0815/98050548-t.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
}
@Book{Shparlinski:1999:NTM,
author = "Igor E. Shparlinski",
title = "Number theoretic methods in cryptography: complexity
lower bounds",
volume = "17",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "viii + 180",
year = "1999",
ISBN = "3-7643-5888-2 (Basel), 0-8176-5888-2 (Boston)",
ISBN-13 = "978-3-7643-5888-4 (Basel), 978-0-8176-5888-5
(Boston)",
LCCN = "QA267.7 .S57 1999",
bibdate = "Mon Oct 16 09:48:58 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Progress in computer science and applied logic",
acknowledgement = ack-nhfb,
keywords = "computational complexity; cryptography; number
theory",
remark = "See updated edition \cite{Shparlinski:2003:CAA}.",
}
@Book{Singh:1999:CBE,
author = "Simon Singh",
title = "The code book: the evolution of secrecy from {Mary,
Queen of Scots}, to quantum cryptography",
publisher = pub-DOUBLEDAY,
address = pub-DOUBLEDAY:adr,
pages = "xiii + 402",
year = "1999",
ISBN = "0-385-49531-5",
ISBN-13 = "978-0-385-49531-8",
LCCN = "Z103 .S56 1999",
bibdate = "Mon Dec 06 16:25:40 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See also \cite{Almgren:2000:HWC}.",
price = "US\$24.95",
acknowledgement = ack-nhfb,
}
@Article{Zhang:1999:AFV,
author = "Yuqing Zhang and Jihong Li and Guozhen Xiao",
title = "An approach to the formal verification of the
two-party cryptographic protocols",
journal = j-OPER-SYS-REV,
volume = "33",
number = "4",
pages = "48--51",
month = oct,
year = "1999",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See comments \cite{Ji:2001:CAF}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
}
@Book{Aalberts:2000:DSB,
author = "Babette Aalberts and Simone van der Hof",
title = "Digital signature blindness: analysis of legislative
approaches toward electronic authentication",
number = "32",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "77",
year = "2000",
ISBN = "90-268-3656-2",
ISBN-13 = "978-90-268-3656-5",
LCCN = "K564.C6 A73 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "In English with summary in Dutch.",
series = "ITeR, Nationaal programma informatietechnologie en
recht",
acknowledgement = ack-nhfb,
keywords = "data protection --- law and legislation; digital
signatures; electronic commerce --- law and
legislation; signature (law) --- data processing",
}
@InProceedings{Abadi:2000:TA,
author = "Mart{\'\i}n Abadi",
title = "Taming the Adversary",
crossref = "Bellare:2000:ACC",
pages = "353--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800353.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800353.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Abdalla:2000:KMR,
author = "Michel Abdalla and Yuval Shavitt and Avishai Wool",
title = "Key management for restricted multicast using
broadcast encryption",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "4",
pages = "443--454",
year = "2000",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.865073",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 8 17:21:08 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-4/p443-abdalla/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
subject = "Data --- Data Encryption (E.3); Information Systems
--- Information Systems Applications --- Communications
Applications (H.4.3): {\bf Internet}; Computing Milieux
--- Computers and Society --- Public Policy Issues
(K.4.1): {\bf Intellectual property rights}; Computing
Milieux --- Computers and Society --- Electronic
Commerce (K.4.4)",
}
@Article{Abdalla:2000:NFS,
author = "Michel Abdalla and Leonid Reyzin",
title = "A New Forward-Secure Digital Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "116--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760116.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760116.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Abe:2000:PSP,
author = "Masayuki Abe and Tatsuaki Okamoto",
title = "Provably Secure Partially Blind Signatures",
crossref = "Bellare:2000:ACC",
pages = "271--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800271.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800271.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Aharonov:2000:QBE,
author = "Dorit Aharonov and Amnon Ta-Shma and Umesh V. Vazirani
and Andrew C. Yao",
title = "Quantum bit escrow",
crossref = "ACM:2000:PTS",
pages = "705--714",
year = "2000",
bibdate = "Wed Feb 20 18:35:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/335305/p705-aharonov/p705-aharonov.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/335305/p705-aharonov/",
acknowledgement = ack-nhfb,
}
@TechReport{Almgren:2000:HWC,
author = "Fredrik Almgren and Gunnar Andersson and Torbj{\"o}rn
Granlund and Lars Ivansson and Staffan Ulfberg",
title = "How We Cracked the {Code Book} Ciphers",
type = "Technical report",
institution = "????",
address = "????",
pages = "40",
day = "11",
month = oct,
year = "2000",
bibdate = "Thu Jan 17 10:51:00 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Singh:1999:CBE}.",
URL = "http://frode.home.cern.ch/frode/crypto/codebook_solution.pdf;
http://www.simonsingh.com/cipher.htm",
acknowledgement = ack-nhfb,
}
@Article{Alvarez:2000:CCE,
author = "G. Alvarez and F. Montoya and M. Romera and G.
Pastor",
title = "Cryptanalysis of a chaotic encryption system",
journal = j-PHYS-LET-A,
volume = "276",
number = "1-4",
pages = "191--196",
year = "2000",
CODEN = "PYLAAG",
ISSN = "0375-9601 (print), 1873-2429 (electronic)",
ISSN-L = "0375-9601",
MRclass = "94A60",
MRnumber = "1 803 876",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Physics Letters. A",
journal-URL = "http://www.sciencedirect.com/science/journal/03759601",
}
@Book{Alvarez:2000:SMC,
author = "David J. Alvarez",
title = "Secret messages: codebreaking and {American}
diplomacy, 1930--1945",
publisher = "University Press of Kansas",
address = "Lawrence, KS, USA",
pages = "xi + 292",
year = "2000",
ISBN = "0-7006-1013-8",
ISBN-13 = "978-0-7006-1013-6",
LCCN = "D810.C88 A48 2000",
bibdate = "Thu Dec 28 09:13:51 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Modern war studies",
URL = "http://www.h-net.org/review/hrev-a0b6k4-aa",
abstract = "In \booktitle{Secret Messages}, David Alvarez provides
the first comprehensive analysis of the impact of
decoded radio messages (signals intelligence) upon
American foreign policy and strategy from 1930 to 1945.
He presents the most complete account to date of the
U.S. Army's top-secret Signal Intelligence Service
(SIS): its creation, struggles, and rapid wartime
growth, and its contributions to the war effort.",
acknowledgement = ack-nhfb,
subject = "World War, 1939-1945; Cryptography; United States;
History; 20th century; Diplomatic history; Foreign
relations; 1933-1945",
tableofcontents = "Antecedents \\
Launching a Service \\
Toward Pearl Harbor \\
Marching to War \\
Photo Section \\
Targets \\
The Russian Problem \\
A Usually Reliable Source",
}
@Article{Amadio:2000:RPC,
author = "Roberto M. Amadio and Denis Lugiez",
title = "On the Reachability Problem in Cryptographic
Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1877",
pages = "380--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:54 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1877.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1877/18770380.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1877/18770380.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Anderson:2000:CS,
author = "Ross Anderson and Eli Biham and Lars Knudsen",
title = "The Case for {Serpent}",
crossref = "NIST:2000:TAE",
pages = "349--353",
year = "2000",
bibdate = "Thu Feb 22 18:33:42 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cl.cam.ac.uk/ftp/users/rja14/serpentcase.pdf;
http://www.cl.cam.ac.uk/ftp/users/rja14/slides-bw.pdf;
http://www.cl.cam.ac.uk/ftp/users/rja14/slides.pdf;
http://www.cl.cam.ac.uk/~rja14/serpent.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Anonymous:2000:AIah,
author = "Anonymous",
title = "Author Index",
crossref = "Bellare:2000:ACC",
pages = "545--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/papers/1880/1880auth.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Anonymous:2000:AIH,
author = "Anonymous",
title = "{AES IP} hardware encryptor introduced",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "9",
pages = "6--7",
day = "1",
month = sep,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)09019-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580009019X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Anonymous:2000:CLI,
author = "Anonymous",
title = "Cryptography and liberty 2000: an international survey
of encryption policy",
publisher = "Electronic Privacy Information Center",
address = "Washington, DC, USA",
pages = "iv + 139",
year = "2000",
ISBN = "1-893044-07-6",
ISBN-13 = "978-1-893044-07-4",
LCCN = "????",
bibdate = "Wed Sep 28 07:55:48 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2000:CRR,
author = "Anonymous",
title = "{China} relaxes rules on encryption products",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "4",
pages = "4--5",
day = "1",
month = apr,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)04011-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:53 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800040113",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:EES,
author = "Anonymous",
title = "{European} encryption still safer than {US} versions",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "3",
pages = "3--3",
day = "1",
month = mar,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)03005-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:52 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800030051",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:GBE,
author = "Anonymous",
title = "Governments back down on encryption regulations",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "5",
pages = "3--4",
day = "1",
month = may,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)05008-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580005008X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:PESa,
author = "Anonymous",
title = "{PGP} encryption software granted global export
license",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "1",
pages = "1--1",
month = jan,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)90024-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:49 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800900242",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:PTD,
author = "Anonymous",
title = "Privacy threatened by digital signatures",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "5",
pages = "4--4",
day = "1",
month = may,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)05009-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800050091",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:SES,
author = "Anonymous",
title = "Signing and encryption software system launched",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "5",
pages = "6--6",
day = "1",
month = may,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)05017-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800050170",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:UAS,
author = "Anonymous",
title = "User authentication via smart card",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "9",
pages = "7--7",
day = "1",
month = sep,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)09020-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800090206",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2000:VAS,
author = "Anonymous",
title = "Voice authentication smart card",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "10",
pages = "5--5",
day = "1",
month = oct,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)10014-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:03 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800100145",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Aoki:2000:FIA,
author = "Kazumaro Aoki and Helger Lipmaa",
title = "Fast Implementations of {AES} Candidates",
crossref = "NIST:2000:TAE",
pages = "106--122",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ateniese:2000:PPS,
author = "Giuseppe Ateniese and Jan Camenisch and Marc Joye and
Gene Tsudik",
title = "A Practical and Provably Secure Coalition-Resistant
Group Signature Scheme",
crossref = "Bellare:2000:ACC",
pages = "255--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800255.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800255.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Austin:2000:ASF,
author = "Todd Austin and Jerome Burke and John McDonald",
title = "Architectural Support for Fast Symmetric-Key
Cryptography",
journal = j-SIGPLAN,
volume = "35",
number = "11",
pages = "178--189",
month = nov,
year = "2000",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Nov 7 16:57:37 MST 2000",
bibsource = "http://foothill.lcs.mit.edu/asplos2k/program.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Baran:2000:NVB,
author = "Nicholas Baran",
title = "News and Views: 108-bit Elliptic Curve Cryptographic
Key Found; New Algorithm Cracks the Stock Market; First
Complete {Babbage} Printer Unveiled; {XrML} View to Be
Digital Rights Standard; {PKWare} Founder [Phil Katz]
Dies Unexpectedly",
journal = j-DDJ,
volume = "25",
number = "7",
pages = "18--18",
month = jul,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:16 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Baran:2000:NVM,
author = "Nicholas Baran",
title = "News and Views: More on Tiny Transistors; {Open
Source} Repository Launched; Design Contest Promotes
New Software Tools; And Then There's a Decryption
Contest; {Fred Brooks} Wins {ACM Turing Award}",
journal = j-DDJ,
volume = "25",
number = "3",
pages = "18--18",
month = mar,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:14 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://sourceforge.net/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Baran:2000:NVR,
author = "Nicholas Baran",
title = "News and Views: {RSA} Algorithm in the Public Domain;
{Woz} Joins the {Inventors Hall of Fame}; Entangled
Photons Mean Faster, Smaller {ICs}; {BEHEMOTH}
Mothballed; {Advanced Encryption Standard} Selected;
{SGI} Releases {SDK} as Open Source; {WSDL} Spec
Released",
journal = j-DDJ,
volume = "25",
number = "12",
pages = "18--18",
month = dec,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Nov 8 15:09:25 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Advanced Encryption Standard (AES); Big Electronic
Human-Energized Machine (BEHEMOTH) [computerized
bicycle]; Rivest-Shamir-Adleman (RSA); Steve Wozniak;
Web Services Description Language (WSDL)",
}
@InProceedings{Bassham:2000:ETA,
author = "Lawrence E. Bassham III",
title = "Efficiency Testing of {ANSI C} Implementations of
Round 2 Candidate Algorithms for the {Advanced
Encryption Standard}",
crossref = "NIST:2000:TAE",
pages = "136--148",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Baudron:2000:ENS,
author = "Olivier Baudron and David Pointcheval and Jacques
Stern",
booktitle = "Automata, languages and programming (Geneva, 2000)",
title = "Extended Notions of Security for Multicast Public Key
Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1853",
pages = "499--511",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62 (94A60)",
MRnumber = "2001h:94027",
bibdate = "Tue Sep 10 19:08:44 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1853.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1853/18530499.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1853/18530499.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Bauer:2000:DSM,
author = "Friedrich Ludwig Bauer",
title = "Decrypted secrets: methods and maxims of cryptology",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xii + 470",
year = "2000",
ISBN = "3-540-66871-3",
ISBN-13 = "978-3-540-66871-8",
LCCN = "QA76.9.A25 B38513 2000",
bibdate = "Mon Oct 16 09:48:58 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography",
}
@InProceedings{Beck:2000:FSD,
author = "Robert Beck and Steve Holstead",
title = "{FOKSTRAUT} and {Samba} --- Dealing with
Authentication and Performance Issues on a Large-scale
{Samba} Service",
crossref = "USENIX:2000:PFSa",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/lisa2000/beck.html",
acknowledgement = ack-nhfb,
}
@Article{Beimel:2000:CFS,
author = "Amos Beimel and Mike Burmester and Yvo Desmedt and
Eyal Kushilevitz",
title = "Computing Functions of a Shared Secret",
journal = j-SIAM-J-DISCR-MATH,
volume = "13",
number = "3",
pages = "324--345",
year = "2000",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480195288819",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Fri Oct 27 07:10:38 MDT 2000",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/13/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/28881",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@InProceedings{Beimel:2000:RSC,
author = "Amos Beimel and Yuval Ishai and Tal Malkin",
title = "Reducing the Servers Computation in Private
Information Retrieval: {PIR} with Preprocessing",
crossref = "Bellare:2000:ACC",
pages = "55--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800055.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800055.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InCollection{Bellare:2000:AER,
author = "Mihir Bellare and Chanathip Namprempre",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Authenticated Encryption: Relations among Notions and
Analysis of the Generic Composition Paradigm",
volume = "1976",
publisher = pub-SV,
address = pub-SV:adr,
pages = "531--545",
year = "2000",
MRclass = "94A62 (94A60)",
MRnumber = "1 864 350",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760531.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760531.pdf",
}
@Article{Bellare:2000:AKE,
author = "Mihir Bellare and David Pointcheval and Phillip
Rogaway",
title = "Authenticated Key Exchange Secure against Dictionary
Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "139--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070139.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070139.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Bellare:2000:ETE,
author = "Mihir Bellare and Phillip Rogaway",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Encode-Then-Encipher Encryption: How to Exploit Nonces
or Redundancy in Plaintexts for Efficient
Cryptography",
volume = "1976",
publisher = pub-SV,
address = pub-SV:adr,
pages = "317--330",
year = "2000",
MRclass = "94A60",
MRnumber = "2002h:94044",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760317.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760317.pdf",
}
@Article{Bellare:2000:PKE,
author = "Mihir Bellare and Alexandra Boldyreva and Silvio
Micali",
title = "Public-Key Encryption in a Multi-user Setting:
Security Proofs and Improvements",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "259--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070259.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070259.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bellare:2000:SCB,
author = "Mihir Bellare and Joe Kilian and Phillip Rogaway",
title = "The Security of the Cipher Block Chaining Message
Authentication Code",
journal = j-J-COMP-SYS-SCI,
volume = "61",
number = "3",
pages = "362--399",
month = dec,
year = "2000",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1006/jcss.1999.1694",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:26:42 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002200009991694X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Benedens:2000:AIW,
author = "Oliver Benedens",
title = "Affine Invariant Watermarks for {$3$D} Polygonal and
{NURBS} Based Models",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "15--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Sep 12 08:19:41 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750015.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750015.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Benedens:2000:TBD,
author = "Oliver Benedens and Christoph Busch",
title = "Towards Blind Detection of Robust Watermarks in
Polygonal Models",
journal = j-CGF,
volume = "19",
number = "3",
pages = "??--??",
month = aug,
year = "2000",
CODEN = "CGFODY",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Oct 11 06:13:38 MDT 2000",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "aid=412&
http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0167-7055&
iid=3& src=ard& vid=19",
acknowledgement = ack-nhfb,
author-1-adr = "Department of Security Technology for Graphic and
Communication Systems, Fraunhofer Institute for
Computer Graphics, Darmstadt, Germany",
author-2-adr = "Department of Security Technology for Graphic and
Communication Systems, Fraunhofer Institute for
Computer Graphics, Darmstadt, Germany",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Berson:2000:CE,
author = "Thomas A. Berson",
title = "Cryptography Everywhere",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "72--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760072.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760072.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Betarte:2000:SSC,
author = "Gustavo Betarte and Cristina Cornes and Nora Szasz and
Alvaro Tasistro",
title = "Specification of a Smart Card Operating System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1956",
pages = "77--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:56 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1956.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1956/19560077.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1956/19560077.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Bialaski:2000:SLN,
author = "Tom Bialaski and Michael Haines",
title = "{Solaris} and {LDAP Naming Services}: Deploying {LDAP}
in the Enterprise",
publisher = pub-SUN-MICROSYSTEMS-PRESS,
address = pub-SUN-MICROSYSTEMS-PRESS:adr,
pages = "xxvii + 372",
year = "2000",
ISBN = "0-13-030678-9",
ISBN-13 = "978-0-13-030678-4",
LCCN = "QA76.76.O63B518 2001",
bibdate = "Fri Apr 11 12:03:24 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib;
http://www.sun.com/blueprints/",
note = "Part No. 806-2893-10 October 2000.",
series = "Sun BluePrints Program",
URL = "books/ldap.pdf;
http://www.sun.com/books/catalog/haines/",
abstract = "Solaris and LDAP Naming Services is a practical guide
to implementing Solaris 8 native LDAP on clients and
servers. Basic LDAP concepts are covered, as well as
naming and authentication architectural details. This
BluePrint outlines strategies for consolidating legacy
directory services using LDAP technology.",
acknowledgement = ack-nhfb,
}
@InProceedings{Biehl:2000:DFA,
author = "Ingrid Biehl and Bernd Meyer and Volker M{\"u}ller",
title = "Differential Fault Attacks on Elliptic Curve
Cryptosystems",
crossref = "Bellare:2000:ACC",
pages = "131--??",
year = "2000",
MRclass = "94B27 (14G50)",
MRnumber = "2002h:94104",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800131.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800131.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Bierbrauer:2000:AIW,
author = "J{\"u}rgen Bierbrauer and Holger Schellwat",
title = "Almost Independent and Weakly Biased Arrays: Efficient
Constructions and Cryptologic Applications",
crossref = "Bellare:2000:ACC",
pages = "533--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800533.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800533.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Biham:2000:CAG,
author = "Eli Biham and Orr Dunkelman",
booktitle = "Progress in cryptology---INDOCRYPT 2000 (Calcutta)",
title = "Cryptanalysis of the {A5/1 GSM} stream cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "43--51",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A55 (94A60)",
MRnumber = "2002h:94038",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biham:2000:CPR,
author = "Eli Biham",
title = "Cryptanalysis of {Patarin}'s $2$-Round Public Key
System with {S} Boxes ({$2$R})",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "408--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070408.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070408.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Biham:2000:IDR,
author = "Eli Biham and Vladimir Furman",
title = "Impossible Differential on 8-Round {MARS}' Core",
crossref = "NIST:2000:TAE",
pages = "186--194",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Biham:2000:IID,
author = "Eli Biham and Vladimir Furman",
title = "Improved Impossible Differentials on {Twofish}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "80--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770080.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770080.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biryukov:2000:CTM,
author = "Alex Biryukov and Adi Shamir",
title = "Cryptanalytic Time\slash Memory\slash Data Tradeoffs
for Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "1--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Sep 12 08:29:38 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Black:2000:CMA,
author = "John Black and Phillip Rogaway",
title = "{CBC MACs} for Arbitrary-Length Messages:The Three-Key
Constructions",
crossref = "Bellare:2000:ACC",
pages = "197--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800197.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800197.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@MastersThesis{Black:2000:TDE,
author = "Michael Andrew Black",
title = "A treatise on data encryption and an example of the
Black algorithm",
type = "Thesis ({M.A.})",
school = "University of California, Santa Barbara",
address = "Santa Barbara, CA, USA",
year = "2000",
LCCN = "QA13.5.C2 S25 BLAM 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "dissertations, academic --- UCSB --- pure
mathematics",
}
@Article{Blundo:2000:VCG,
author = "Carlo Blundo and Alfredo {De Santis} and Moni Naor",
title = "Visual cryptography for grey level images",
journal = j-INFO-PROC-LETT,
volume = "75",
number = "6",
pages = "255--259",
day = "30",
month = nov,
year = "2000",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Apr 18 07:11:19 MDT 2001",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/23/20/64/31/27/abstract.html;
http://www.elsevier.nl/gej-ng/10/23/20/64/31/27/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Bobineau:2000:PSD,
author = "Christophe Bobineau and Luc Bouganim and Philippe
Pucheral and Patrick Valduriez",
title = "{PicoDMBS}: Scaling Down Database Techniques for the
{Smartcard}",
crossref = "ElAbbadi:2000:VPI",
pages = "11--20",
year = "2000",
bibdate = "Fri Jan 12 07:50:24 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb2000.html",
URL = "http://www.vldb.org/dblp/db/conf/vldb/ChristopheBPV00.html",
acknowledgement = ack-nhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/b/Bobineau:Christophe.html;
http://www.vldb.org/dblp/db/indices/a-tree/b/Bouganim:Luc.html;
http://www.vldb.org/dblp/db/indices/a-tree/p/Pucheral:Philippe.html;
http://www.vldb.org/dblp/db/indices/a-tree/v/Valduriez:Patrick.html",
}
@Article{Bolosky:2000:FSD,
author = "William J. Bolosky and John R. Douceur and David Ely
and Marvin Theimer",
title = "Feasibility of a serverless distributed file system
deployed on an existing set of desktop {PCs}",
journal = j-SIGMETRICS,
volume = "28",
number = "1",
pages = "34--43",
month = jun,
year = "2000",
CODEN = "????",
DOI = "https://doi.org/10.1145/339331.339345",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Thu Jun 26 11:31:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We consider an architecture for a serverless
distributed file system that does not assume mutual
trust among the client computers. The system provides
security, availability, and reliability by distributing
multiple encrypted replicas of each file among the
client machines. To assess the feasibility of deploying
this system on an existing desktop infrastructure, we
measure and analyze a large set of client machines in a
commercial environment. In particular, we measure and
report results on disk usage and content; file
activity; and machine uptimes, lifetimes, and loads. We
conclude that the measured desktop infrastructure would
passably support our proposed system, providing
availability on the order of one unfilled file request
per user per thousand days.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
keywords = "analytical modeling; availability; feasibility
analysis; personal computer usage data; reliability;
security; serverless distributed file system
architecture; trust; workload characterization",
}
@Book{Bondi:2000:CVB,
author = "Richard Bondi",
title = "Cryptography for {Visual Basic}: a programmer's guide
to the {Microsoft CryptoAPI}",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xx + 459",
year = "2000",
ISBN = "0-471-38189-6 (paperback)",
ISBN-13 = "978-0-471-38189-1 (paperback)",
LCCN = "QA76.73.B3 B665 2000",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptography; Microsoft CryptoAPI; Microsoft Visual
Basic",
}
@Article{Boneh:2000:CRP,
author = "Dan Boneh and Glenn Durfee",
title = "Cryptanalysis of {RSA} with private key {$d$} less
than {$ N^{0.292} $}",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "46",
number = "4",
pages = "1339--1349",
month = apr,
year = "2000",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.850673",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A60 (11Y05 68Q25)",
MRnumber = "2002g:94034",
MRreviewer = "Marc M. Gysin",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Institute of Electrical and Electronics Engineers.
Transactions on Information Theory",
}
@Article{Boneh:2000:GRK,
author = "Dan Boneh and Nagendra Modadugu and Michael Kim",
title = "Generating {RSA} Keys on a Handheld Using an Untrusted
Server",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "271--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770271.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770271.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Boneh:2000:TC,
author = "Dan Boneh and Moni Naor",
title = "Timed Commitments",
crossref = "Bellare:2000:ACC",
pages = "236--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800236.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800236.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InCollection{Boneh:2000:WTE,
author = "Dan Boneh and Antoine Joux and Phong Q. Nguyen",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Why textbook {ElGamal} and {RSA} encryption are
insecure (extended abstract)",
volume = "1976",
publisher = pub-SV,
address = pub-SV:adr,
pages = "30--43",
year = "2000",
MRclass = "94A60 (94A62)",
MRnumber = "1 864 320",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760030.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760030.pdf",
}
@Book{Boni:2000:NGT,
author = "William Boni and Gerald L. Kovacich",
title = "Netspionage: the global threat to information",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xx + 260",
year = "2000",
ISBN = "0-7506-7257-9",
ISBN-13 = "978-0-7506-7257-3",
LCCN = "HV6773 .B665 2000",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$34.95",
acknowledgement = ack-nhfb,
}
@Article{Borras:2000:TRT,
author = "Kevin Borras",
title = "A transport revolution: {Turkey} gets the smart card
bug",
journal = "Tolltrans",
pages = "36--38",
month = sep,
year = "2000",
LCCN = "HE336.T64 A1 2000:8",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "smart cards --- Turkey --- Izmir",
}
@Book{Bouwmeester:2000:PQI,
author = "Dirk Bouwmeester and Artur K. Ekert and Anton
Zeilinger",
title = "The physics of quantum information: quantum
cryptography, quantum teleportation, quantum
computation",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 314",
year = "2000",
ISBN = "3-540-66778-4",
ISBN-13 = "978-3-540-66778-0",
LCCN = "QA76.889 .P47 2000",
bibdate = "Mon Oct 16 09:48:58 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
annote = "Contents: The physics of quantum information: basic
concepts --- Quantum cryptography --- Quantum dense
coding and quantum teleportation --- Concepts of
quantum computation --- Experiments leading towards
quantum computation --- Quantum networks and
multi-particle entanglement --- Decoherence and quantum
error correction --- Entanglement purification.",
keywords = "quantum computers",
}
@Article{Boyko:2000:PSP,
author = "Victor Boyko and Philip MacKenzie and Sarvar Patel",
title = "Provably Secure Password-Authenticated Key Exchange
Using {Diffie--Hellman}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "156--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070156.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070156.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Brassard:2000:SAP,
author = "Gilles Brassard and Norbert L{\"u}tkenhaus and Tal Mor
and Barry C. Sanders",
title = "Security Aspects of Practical Quantum Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "289--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070289.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070289.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Brisbane:2000:RBW,
author = "Gareth Brisbane and Rei Safavi-Naini and Philip
Ogunbona",
title = "Region-Based Watermarking by Distribution Adjustment",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "54--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750054.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750054.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Brown:2000:PCW,
author = "Michael Brown and Donny Cheung and Darrel Hankerson
and Julio Lopez Hernandez and Michael Kirkup and Alfred
Menezes",
title = "{PGP} in Constrained Wireless Devices",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/brown.html",
acknowledgement = ack-nhfb,
}
@Article{Buchmann:2000:ECC,
author = "Johannes Buchmann and Harald Baier",
title = "Efficient Construction of Cryptographically Strong
Elliptic Curves",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "191--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770191.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770191.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Buchmann:2000:IC,
author = "Johannes Buchmann",
title = "Introduction to Cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 281",
year = "2000",
ISBN = "0-387-95034-6",
ISBN-13 = "978-0-387-95034-1",
LCCN = "QA268.B83 2001",
bibdate = "Wed Jan 16 09:13:38 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 29.50",
series = "Undergraduate texts in mathematics",
acknowledgement = ack-nhfb,
keywords = "coding theory; computer science textbooks;
cryptography",
}
@Book{Budiansky:2000:BWC,
author = "Stephen Budiansky",
title = "Battle of Wits: The Complete Story of Codebreaking in
{World War II}",
publisher = pub-FREE,
address = pub-FREE:adr,
pages = "436",
year = "2000",
ISBN = "0-684-85932-7",
ISBN-13 = "978-0-684-85932-3",
LCCN = "D810.C88 B83 2000",
bibdate = "Wed Nov 15 14:05:36 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$27.50, UK\pounds 20",
acknowledgement = ack-nhfb,
annote = "See review by Simon Singh (author of The Code Book and
the television series, The Science of Secrecy) in
Nature, Vol. 408, 2 November 2000, pp. 23--24.",
xxISBN = "0-670-88492-8",
}
@Article{Budiansky:2000:DBU,
author = "Stephen Budiansky",
title = "The Difficult Beginnings of {US--British} Codebreaking
Co-operation",
journal = j-INTELL-NATL-SECUR,
volume = "15",
number = "2",
pages = "49--??",
year = "2000",
ISSN = "0268-4527 (print), 1743-9019 (electronic)",
ISSN-L = "0268-4527",
bibdate = "Wed Jan 16 10:21:32 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Intelligence and National Security",
journal-URL = "http://www.tandfonline.com/loi/fint20",
}
@Article{Burke:2000:ASFa,
author = "Jerome Burke and John McDonald and Todd Austin",
title = "Architectural support for fast symmetric-key
cryptography",
journal = j-COMP-ARCH-NEWS,
volume = "28",
number = "5",
pages = "178--189",
month = dec,
year = "2000",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:41:22 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Burke:2000:ASFb,
author = "Jerome Burke and John McDonald and Todd Austin",
title = "Architectural support for fast symmetric-key
cryptography",
journal = j-OPER-SYS-REV,
volume = "34",
number = "5",
pages = "178--189",
month = dec,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:56 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
}
@Article{Burke:2000:ASFc,
author = "Jerome Burke and John McDonald and Todd Austin",
title = "Architectural support for fast symmetric-key
cryptography",
journal = j-SIGPLAN,
volume = "35",
number = "11",
pages = "178--189",
month = nov,
year = "2000",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sun Dec 14 09:18:19 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Article{Burmansson:2000:TCY,
author = "Frank Burmansson",
title = "Travel cards in the year 2000: the {Helsinki} region
ushers in the smart card era",
journal = "Urban public transportation systems",
pages = "229--238",
month = "Engineers",
year = "2000",
LCCN = "HE305 .U684 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "local transit --- rates --- Finland --- Helsinki;
smart cards",
}
@InProceedings{Burnett:2000:EMG,
author = "L. Burnett and G. Carter and E. Dawson and W. Millan",
title = "Efficient Methods for Generating {MARS}-like {S}-boxes
(abstract only)",
crossref = "NIST:2000:TAE",
pages = "10--10",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "One of the five AES finalists, MARS, makes use of a
9x32 s-box with very specific combinatorial,
differential and linear correlation properties. The
s-box used in the cipher was selected as the best from
a large sample of pseudo randomly generated tables, in
a process that took IBM about a week to compute. This
paper provides a faster and more effective alternative
generation method using heuristic techniques to produce
9x32 s-boxes with cryptographic properties that are
clearly superior to those of the MARS s-box, and
typically take less than two hours to produce on a
single PC.",
acknowledgement = ack-nhfb,
}
@Article{Butler:2000:NSA,
author = "Randy Butler and Von Welch and Douglas Engert and Ian
Foster and Steven Tuecke and John Volmer and Carl
Kesselman",
title = "A National-Scale Authentication Infrastructure",
journal = j-COMPUTER,
volume = "33",
number = "12",
pages = "60--66",
month = dec,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed Dec 6 18:12:09 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/rz060.pdf;
http://www.computer.org/computer/co2000/rz060abs.htm",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Cachin:2000:OFS,
author = "Christian Cachin and Jan Camenisch",
title = "Optimistic Fair Secure Computation",
crossref = "Bellare:2000:ACC",
pages = "93--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800093.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800093.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Manual{CADOJ:2000:DSE,
author = "{California.Dept.of Justice}",
title = "Digital signature, election petitions, public and
private transactions: initiative statute",
publisher = "Office of the Secretary of State",
address = "Elections Division",
pages = "15",
day = "13",
month = oct,
year = "2000",
LCCN = "A7878 no.905",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Title and summary prepared by the California Attorney
General. Initiative \#905.",
acknowledgement = ack-nhfb,
keywords = "computer security --- California; signature (law) ---
California",
}
@Manual{CALACIT:2000:SID,
author = "{California Legislature.Assembly Committee on
Information Technology}",
title = "Securing the {Internet}: digital signatures and
electronic transactions in {California}",
publisher = "The Committee",
address = "Sacramento, CA",
pages = "various",
day = "4",
month = aug,
year = "2000",
LCCN = "HF5548.32 .C34 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "computer networks --- security measures ---
California; computers --- access control --- California
passwords; cryptograms --- data processing; data
encryption (computer science) --- California; database
security --- California; electronic commerce ---
California",
}
@Article{Caloyannides:2000:EWE,
author = "M. A. Caloyannides",
title = "Encryption wars: early battles",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "4",
pages = "37--43",
month = apr,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.833026",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computerized monitoring; computers; Cryptography;
cryptography; Decoding; electronic document delivery;
electronic message interception; electronic messaging;
encryption techniques; information economy; Internet;
legal campaigns; Military computing; Postal services;
Privacy; private documents; Protection; public key
cryptography; public-key encryption; Security;
symmetric encryption; Telecommunication computing;
telecommunications; US export laws",
}
@Article{Caloyannides:2000:EWS,
author = "M. A. Caloyannides",
title = "Encryption wars: shifting tactics",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "5",
pages = "46--51",
month = may,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.842134",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "anonymity preservation; anonymizers; Books;
Communication system control; computer data creation;
computer data storage; computer data transmission;
criminals; cryptography; Cryptography; data
encapsulation; data hiding; electronic communications;
encryption; Government; Law enforcement; law
enforcement agencies; laws; Military computing;
personal privacy protection; Privacy; Protection;
regulations; steganography; Terrorism; terrorists;
Weapons",
}
@Article{Camenisch:2000:CSS,
author = "Jan Camenisch and Markus Michels",
title = "Confirmer Signature Schemes Secure against Adaptive
Adversaries (Extended Abstract)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "243--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070243.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070243.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Camenisch:2000:VEG,
author = "Jan Camenisch and Ivan Damg{\aa}rd",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Verifiable Encryption, Group Encryption, and Their
Applications to Separable Group Signatures and
Signature Sharing Schemes (extended abstract)",
volume = "1976",
publisher = pub-SV,
address = pub-SV:adr,
pages = "331--345",
year = "2000",
MRclass = "94A60",
MRnumber = "1 864 341",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760331.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760331.pdf",
}
@TechReport{CAMTC:2000:TSC,
author = "{California.Metropolitan Transportation Commission}",
title = "{TransLink} smart card: universal transit card for the
{San Francisco Bay Area}",
institution = "Metropolitan Transportation Commission",
address = "Oakland, CA",
pages = "4",
year = "2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "automatic fare collection; automation; local transit
--- fares --- California --- San Francisco Bay Area --;
smart cards --- California --- San Francisco Bay Area;
transfers; translink (program: California)",
}
@Article{Carpenter:2000:CB,
author = "Mary Carpenter and Betty Paul Dowse",
title = "The Code Breakers of 1942",
journal = "Wellesley",
volume = "??",
number = "??",
pages = "26--30",
month = "Winter",
year = "2000",
bibdate = "Fri Dec 29 09:05:14 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Carriere:2000:PSC,
author = "Bruno Carriere",
title = "Le passe sans contact: autopsie d'une puce",
journal = "La vie du rail et des transports",
pages = "43--48",
month = nov,
year = "2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "automatic fare collection; passes (transportation) ---
France; smart cards --- France; subways --- France ---
fares --- automation",
}
@Article{Catalano:2000:CIS,
author = "Dario Catalano and Rosario Gennaro and Shai Halevi",
title = "Computing Inverses over a Shared Secret Modulus",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "190--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070190.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070190.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cavallar:2000:FBR,
author = "Stefania Cavallar and Bruce Dodson and Arjen K.
Lenstra and Walter Lioen and Peter L. Montgomery and
Brian Murphy and Herman te Riele and Karen Aardal and
Jeff Gilchrist and G{\'e}rard Guillerm and Paul Leyland
and Jo{\"e}l Marchand and Fran{\c{c}}ois Morain and
Alec Muffett and Chris Putnam and Craig Putnam and Paul
Zimmermann",
title = "Factorization of a $ 512 $-Bit {RSA} Modulus",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "1--18",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chang:2000:ELD,
author = "Yuh-Shihng Chang and Tzong-Chen Wu and Shih-Chan
Huang",
title = "{ElGamal}-like digital signature and multisignature
schemes using self-certified public keys",
journal = j-J-SYST-SOFTW,
volume = "50",
number = "2",
pages = "99--105",
day = "15",
month = feb,
year = "2000",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Thu Sep 9 07:30:18 MDT 2010",
bibsource = "http://www.elsevier.com/locate/issn/01641212;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.elsevier.nl/gej-ng/10/29/11/49/27/26/article.pdf;
http://www.elsevier.nl/gej-ng/10/29/11/49/27/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chao:2000:CHC,
author = "Jinhui Chao and Kazuto Matsuo and Hiroto Kawashiro and
Shigeo Tsujii",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Construction of hyperelliptic curves with {CM} and its
application to cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "259--273",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (14G50)",
MRnumber = "2002i:94037",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2000:IBD,
author = "J. J.-R. Chen and Y. Liu",
title = "An {ID}-based digital multisignatures scheme with time
stamp technique",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "15",
number = "2",
pages = "105--??",
month = mar,
year = "2000",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Wed Feb 20 12:04:38 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
OCLC Contents1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Book{Chen:2000:JCT,
author = "Zhiqun Chen",
title = "{Java Card} technology for {Smart Cards}: architecture
and programmer's guide",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxii + 368",
year = "2000",
ISBN = "0-201-70329-7",
ISBN-13 = "978-0-201-70329-0",
LCCN = "QA76.73.J38 C478 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Java series",
acknowledgement = ack-nhfb,
keywords = "Java (computer program language); smart cards",
}
@Article{Cheon:2000:NBC,
author = "Dong Hyeon Cheon and Sang Jin Lee and Jong In Lim and
Sung Jae Lee",
title = "New Block Cipher {DONUT} Using Pairwise Perfect
Decorrelation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "262--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770262.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770262.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cherry:2000:SLD,
author = "S. Cherry",
title = "Secrets and lies: digital security in a networked
world [Books]",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "10",
pages = "15--16",
month = oct,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2000.873914",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Authentication; Books; Computer network management;
Computer networks; Computer security; Cryptography;
Digital systems; Environmental management; Information
security; Intelligent networks",
}
@Article{Clark:2000:LNC,
author = "Julie Clark",
title = "Looking for new contactless points: {Hong Kong}'s
{Octopus} smart card could get a lot smarter, but it
will have to pick its way carefully through regulations
and competition from other quarters first",
journal = "ITS international",
volume = "6",
number = "2",
pages = "77--78",
month = mar # "/" # apr,
year = "2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "smart cards --- China --- Hong Kong",
}
@Article{Clark:2000:TNE,
author = "David Clark",
title = "Technology News: Encryption Advances to Meet
{Internet} Challenges",
journal = j-COMPUTER,
volume = "33",
number = "8",
pages = "20--24",
month = aug,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 30 17:20:20 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/r8020.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "Advanced Encryption Standard (AES); Cipherunicorn-A;
GNU Privacy Guard; SmartTrust",
}
@Article{Clarke:2000:VSP,
author = "E. M. Clarke and S. Jha and W. Marrero",
title = "Verifying security protocols with {Brutus}",
journal = j-TOSEM,
volume = "9",
number = "4",
pages = "443--487",
month = oct,
year = "2000",
CODEN = "ATSMER",
ISSN = "1049-331X (print), 1557-7392 (electronic)",
ISSN-L = "1049-331X",
bibdate = "Fri Apr 20 08:21:35 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tosem.bib",
URL = "http://www.acm.org/pubs/articles/journals/tosem/2000-9-4/p443-clarke/p443-clarke.pdf;
http://www.acm.org/pubs/citations/journals/tosem/2000-9-4/p443-clarke/",
abstract = "Due to the rapid growth of the ``Internet'' and the
``World Wide Web'' security has become a very important
concern in the design and implementation of software
systems. Since security has become an important issue,
the number of protocols in this domain has become very
large. These protocols are very diverse in nature. If a
software architect wants to deploy some of these
protocols in a system, they have to be sure that the
protocol has the right properties as dictated by the
requirements of the system. In this article we present
BRUTUS, a tool for verifying properties of security
protocols. This tool can be viewed as a special-purpose
model checker for security protocols. We also present
reduction techniques that make the tool efficient.
Experimental results are provided to demonstrate the
efficiency of BRUTUS.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Software Engineering and
Methodology",
generalterms = "Security; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J790",
keywords = "authentication and secure payment protocols; formal
methods; model-checking",
subject = "Software --- Software Engineering --- Software/Program
Verification (D.2.4): {\bf Model checking}; Software
--- Operating Systems --- Security and Protection
(D.4.6): {\bf Verification**}",
}
@Article{Constantinou:2000:CSC,
author = "Toulla Constantinou",
title = "{Chicago} smart: {Chicago Transit Authority (CTS)}
joins ``smart card'' revolution",
journal = "Mass transit",
volume = "26",
number = "7",
pages = "52--53",
month = dec,
year = "2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "automatic fare collection; local transit --- Illinois
--- Chicago metropolitan area --- fares; smart cards",
}
@Article{Coppersmith:2000:C,
author = "D. Coppersmith",
title = "Cryptography",
journal = j-IBM-JRD,
volume = "44",
number = "1/2",
pages = "246--250",
month = jan # "\slash " # mar,
year = "2000",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Wed Feb 07 19:33:48 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Special issue: reprints on Evolution of information
technology 1957--1999.",
URL = "http://www.research.ibm.com/journal/rd/441/coppersmith.pdf",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@InProceedings{Coppersmith:2000:ICT,
author = "Don Coppersmith and Rosario Gennaro and Shai Halevi
and Charanjit Jutla and Stephen M. {Matyas, Jr.} and
Mohammad Peyravian and David Safford and Nevenko
Zunic",
title = "{IBM} Comments: {Third AES Conference April 13,
2000}",
crossref = "NIST:2000:TAE",
pages = "333--336",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Coppersmith:2000:KRF,
author = "Don Coppersmith and Lars R. Knudsen and Chris J.
Mitchell",
title = "Key Recovery and Forgery Attacks on the {MacDES MAC}
Algorithm",
crossref = "Bellare:2000:ACC",
pages = "184--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800184.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800184.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Corella:2000:FIT,
author = "Francisco Corella",
title = "A Fast Implementation of {DES} and {Triple-DES} on
{PA-RISC 2.0}",
crossref = "USENIX:2000:PFW",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/osdi2000/wiess2000/corella.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Coron:2000:ESF,
author = "Jean-S{\'e}bastien Coron",
title = "On the Exact Security of Full Domain Hash",
crossref = "Bellare:2000:ACC",
pages = "229--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800229.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800229.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Coron:2000:FLA,
author = "Jean-S{\'e}bastien Coron and Fran{\c{c}}ois Koeune and
David Naccache",
title = "From Fixed-Length to Arbitrary-Length {RSA} Padding
Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "90--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760090.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760090.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Coron:2000:NAP,
author = "Jean-S{\'e}bastien Coron and Marc Joye and David
Naccache and Pascal Paillier",
title = "New Attacks on {PKCS\#1} v1.5 Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "369--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070369.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070369.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Cosgrave:2000:NTC,
author = "John Cosgrave",
booktitle = "Coding theory and cryptography (Annapolis, MD, 1998)",
title = "Number theory and cryptography (using {Maple})",
publisher = pub-SV,
address = pub-SV:adr,
pages = "124--143",
year = "2000",
MRclass = "94A60 (11T71)",
MRnumber = "MR1749521",
bibdate = "Sat Apr 16 17:32:09 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
}
@InProceedings{Cramer:2000:CVS,
author = "Ronald Cramer and Ivan Damg{\aa}rd and Stefan
Dziembowski",
title = "On the complexity of verifiable secret sharing and
multiparty computation",
crossref = "ACM:2000:PTS",
pages = "325--334",
year = "2000",
bibdate = "Wed Feb 20 18:35:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/335305/p325-cramer/p325-cramer.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/335305/p325-cramer/",
acknowledgement = ack-nhfb,
}
@Article{Cramer:2000:GSM,
author = "Ronald Cramer and Ivan Damg{\aa}rd and Ueli Maurer",
title = "General Secure Multi-party Computation from any Linear
Secret-Sharing Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "316--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070316.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070316.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cramer:2000:SSB,
author = "Ronald Cramer and Victor Shoup",
title = "Signature Schemes Based on the Strong {RSA}
Assumption",
journal = j-TISSEC,
volume = "3",
number = "3",
pages = "161--185",
month = aug,
year = "2000",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 25 16:47:22 MST 2002",
bibsource = "http://www.acm.org/tissec/v3no3.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Crenshaw:2000:SPK,
author = "Scott Crenshaw",
title = "Speedy public key cryptography system",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "3",
pages = "6--6",
day = "1",
month = mar,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)03013-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:52 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800030130",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Misc{CRI:2000:DPA,
author = "{Cryptography Research, Inc.}",
title = "Differential Power Analysis",
howpublished = "Web page.",
year = "2000",
bibdate = "Mon Oct 16 08:24:41 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cryptography.com/dpa/index.html",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Article{Crotch-Harvey:2000:OPR,
author = "Trevor Crotch-Harvey",
title = "Operators are poised to reap smart card benefits",
journal = "International railway journal and rapid transit
review: IRJ",
volume = "40",
number = "2",
pages = "31--32",
month = feb,
year = "2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "automatic fare collection; local transit --- fares ---
equipment and supplies; smart cards",
}
@InProceedings{Daemen:2000:BCR,
author = "Joan Daemen and Vincent Rijmen",
title = "The Block Cipher {Rijndael}",
crossref = "Quisquater:2000:SCR",
pages = "288--296",
year = "2000",
bibdate = "Fri Aug 13 06:57:40 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Daemen:2000:NPN,
author = "Joan Daemen and Micha{\"e}l Peeters and Gilles {Van
Assche} and Vincent Rijmen",
title = "{Nessie} Proposal: {NOEKEON}",
type = "Report",
institution = "Proton World International and ESAT Cosic KULeuven",
address = "Belgium",
pages = "30",
day = "27",
month = oct,
year = "2000",
bibdate = "Fri Sep 23 06:01:32 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://gro.noekeon.org/Noekeon-spec.pdf",
acknowledgement = ack-nhfb,
remark = "From section 2: ``NOEKEON is a block cipher with a
block and key length of 128 bits. It is an iterated
cipher consisting of the repeated application of a
simple round transformation, followed by an output
transformation. The round transformation includes
XORing a Working Key to the intermediate result.''",
}
@InProceedings{Daemen:2000:RA,
author = "Joan Daemen and Vincent Rijmen",
title = "{Rijndael} for {AES}",
crossref = "NIST:2000:TAE",
pages = "343--347",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Dalkilic:2000:ICA,
author = "Mehmet E. Dalkilic and Cengiz Gungor",
title = "An Interactive Cryptanalysis Algorithm for the
{Vigen{\`e}re} Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1909",
pages = "341--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:05 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1909.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1909/19090341.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1909/19090341.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Damgaard:2000:ECZ,
author = "Ivan Damg{\aa}rd",
editor = "????",
booktitle = "Advances in cryptology---EUROCRYPT 2000 (Bruges)",
title = "Efficient concurrent zero-knowledge in the auxiliary
string model",
publisher = pub-SV,
address = pub-SV:adr,
pages = "418--430",
year = "2000",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:47:21 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 22]{Schneier:2015:SWC}.",
}
@InProceedings{Damgaard:2000:INC,
author = "Ivan Damg{\aa}rd and Jesper Buus Nielsen",
title = "Improved Non-committing Encryption Schemes Based on a
General Complexity Assumption",
crossref = "Bellare:2000:ACC",
pages = "432--??",
year = "2000",
MRclass = "94A60",
MRnumber = "2002h:94049",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800432.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800432.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Misc{DDJ:2000:DDE,
author = "{Dr.Dobb's Journal}",
title = "{Dr. Dobb's} Essential Books on Cryptography and
Security",
howpublished = "CD-ROM containing PDF files.",
year = "2000",
bibdate = "Wed Apr 05 06:48:33 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Includes twelve books on cryptography.",
URL = "http://www.ddj.com/cdrom/;
http://www.digitalriver.com/dr/v2/ec_MAIN.Entry10?SP=10023&PN=1&V1=163454&xid=2823",
acknowledgement = ack-nhfb,
annote = "Contents: \\
* Foreword - Bruce Schneier \\
* Applied Cryptography: Protocols, Algorithms, and
Source Code in C, Second Edition \\
* Cryptography: A New Dimension in Computer Data
Security \\
* Contemporary Cryptology: The Science of Information
\\
* Cryptography and Data Security \\
* Applied Cryptography, Cryptographic Protocols, and
Computer Security \\
* Cryptography: Theory and Practice \\
* Handbook of Applied Cryptography \\
* Military Cryptanalysis, Volume I-IV \\
* RSA Laboratories FAQ on Cryptography, RSA
Laboratories \\
* Technical Reports, RSA Laboratories Security
Bulletins, and \\
* CryptoBytes Newsletter",
}
@Article{DeBonis:2000:RVC,
author = "Annalisa {De Bonis} and Alfredo {De Santis}",
title = "Randomness in Visual Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1770",
pages = "626--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1770.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1770/17700626.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1770/17700626.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@PhdThesis{deLeeuw:2000:CSD,
author = "Karl de Leeuw",
title = "Cryptology and statecraft in the {Dutch Republic}
[{Cryptologie} en buitenlands beleid in de {Republiek
der Verenigde Nederlanden}]",
type = "{Ph.D.} thesis",
school = "Universiteit van Amsterdam",
address = "Amsterdam, The Netherlands",
pages = "viii + 190",
year = "2000",
ISBN = "90-5776-039-8",
ISBN-13 = "978-90-5776-039-6",
LCCN = "????",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "The work in this thesis has been carried out under the
auspices of the research school IPA (Institute for
Programming research and Algorithmics). In Dutch and
English.",
series = "IPA dissertation series",
acknowledgement = ack-nhfb,
keywords = "cryptography; cryptography --- history; cryptography
--- Netherlands --- history --- 18th century",
}
@PhdThesis{Desai:2000:ESS,
author = "Anand Desai",
title = "Encryption schemes: security notions, designs and
analyses",
type = "Vita Thesis ({Ph.D.})",
school = "University of California, San Diego",
address = "San Diego, CA, USA",
year = "2000",
LCCN = "QA 3.8 .D473 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "dissertations, academic --- UCSD --- Computer Science;
dissertations, academic --- UCSD --- Computer Science
and Engineering",
}
@InProceedings{Desai:2000:NPC,
author = "Anand Desai",
title = "New Paradigms for Constructing Symmetric Encryption
Schemes Secure against Chosen-Ciphertext Attack",
crossref = "Bellare:2000:ACC",
pages = "394--??",
year = "2000",
MRclass = "94A62",
MRnumber = "2002h:94077",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800394.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800394.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Desai:2000:SAN,
author = "Anand Desai",
title = "The Security of All-or-Nothing Encryption: Protecting
against Exhaustive Key Search",
crossref = "Bellare:2000:ACC",
pages = "359--??",
year = "2000",
MRclass = "94A60",
MRnumber = "2002h:94050",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800359.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800359.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{DeSantis:2000:SSS,
author = "Alfredo {De Santis} and Barbara Masucci",
title = "On secret set schemes",
journal = j-INFO-PROC-LETT,
volume = "74",
number = "5--6",
pages = "243--251",
day = "30",
month = jun,
year = "2000",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Oct 12 06:44:31 MDT 2000",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/23/20/63/28/34/abstract.html;
http://www.elsevier.nl/gej-ng/10/23/20/63/28/34/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Devanbu:2000:CVT,
author = "P. T. Devanbu and S. G. Stubblebine",
title = "Cryptographic verification of test coverage claims",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "26",
number = "2",
pages = "178--192",
month = feb,
year = "2000",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/32.841116",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 11:00:42 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=841116",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@InProceedings{Dhamija:2000:DVU,
author = "Rachna Dhamija and Adrian Perrig",
title = "{D{\'e}j{\`a} Vu} --- {A} User Study: Using Images for
Authentication",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/dhamija.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Dhem:2000:PIT,
author = "Jean-Fran{\c{c}}ois Dhem and Fran{\c{c}}ois Koeune and
Philippe-Alexandre Leroux and Patrick Mestr and
Jean-Jacques Quisquater and Jean-Louis Willems",
editor = "????",
booktitle = "Smart Card Research and Applications",
title = "A practical implementation of the timing attack",
volume = "1820",
publisher = pub-SV,
address = pub-SV:adr,
pages = "167--182",
year = "2000",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:50:48 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 26]{Schneier:2015:SWC}.",
}
@Article{Dierickx:2000:EGD,
author = "J{\"u}rgen Dierickx",
title = "{European} guidelines for digital signatures",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "3",
pages = "3--4",
day = "1",
month = mar,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)03006-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:52 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800030063",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Ding:2000:SSC,
author = "Cunsheng Ding and David R. Kohel and San Ling",
title = "Secret-sharing with a class of ternary codes",
journal = j-THEOR-COMP-SCI,
volume = "246",
number = "1--2",
pages = "285--298",
day = "6",
month = sep,
year = "2000",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Oct 31 11:38:44 MST 2000",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/180/21/34/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/180/21/34/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Dodis:2000:CSG,
author = "Yevgeniy Dodis and Shai Halevi and Tal Rabin",
title = "A Cryptographic Solution to a Game Theoretic Problem",
crossref = "Bellare:2000:ACC",
pages = "112--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800112.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800112.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Dodis:2000:PRI,
author = "Yevgeniy Dodis and Silvio Micali",
title = "Parallel Reducibility for Information-Theoretically
Secure Computation",
crossref = "Bellare:2000:ACC",
pages = "74--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800074.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800074.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Dolev:2000:NC,
author = "Danny Dolev and Cynthia Dwork and Moni Naor",
title = "Nonmalleable Cryptography",
journal = j-SIAM-J-COMPUT,
volume = "30",
number = "2",
pages = "391--437",
month = apr,
year = "2000",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539795291562",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Fri Oct 27 06:28:40 MDT 2000",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/30/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/29156",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Dray:2000:NPA,
author = "Jim Dray",
title = "{NIST} Performance Analysis of the Final Round {Java
AES} Candidates",
crossref = "NIST:2000:TAE",
pages = "149--160",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Misc{Dreyfus:2000:PUC,
author = "Suelette Dreyfus",
title = "The Practical Use of Cryptography in Human Rights
Groups",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk at Ninth USENIX Security
Symposium.",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/invitedtalks.html",
acknowledgement = ack-nhfb,
}
@Article{Dumais:2000:PCQ,
author = "Paul Dumais and Dominic Mayers and Louis Salvail",
title = "Perfectly Concealing Quantum Bit Commitment from any
Quantum One-Way Permutation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "300--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070300.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070300.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Durante:2000:CAC,
author = "Antonio Durante and Riccardo Focardi and Roberto
Gorrieri",
title = "A compiler for analyzing cryptographic protocols using
noninterference",
journal = j-TOSEM,
volume = "9",
number = "4",
pages = "488--528",
month = oct,
year = "2000",
CODEN = "ATSMER",
ISSN = "1049-331X (print), 1557-7392 (electronic)",
ISSN-L = "1049-331X",
bibdate = "Fri Apr 20 08:21:35 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/journals/tosem/2000-9-4/p488-durante/p488-durante.pdf;
http://www.acm.org/pubs/citations/journals/tosem/2000-9-4/p488-durante/",
abstract = "The Security Process Algebra (SPA) is a CCS-like
specification language where actions belong to two
different levels of confidentiality. It has been used
to define several noninterference-like security
properties whose verification has been automated by the
tool CoSeC. In recent years, a method for analyzing
security protocols using SPA and CoSeC has been
developed. Even if it has been useful in analyzing
small security protocols, this method has shown to be
error-prone, as it requires the protocol description
and its environment to be written by hand. This problem
has been solved by defining a protocol specification
language more abstract than SPA, called VSP, and a
compiler CVS that automatically generates the SPA
specification for a given protocol described in VSP.
The VSP/CVS technology is very powerful, and its
usefulness is shown with some case studies: the Woo-Lam
one-way authentication protocol, for which a new attack
to authentication is found, and the Wide Mouthed Frog
protocol, where different kinds of attack are detected
and analyzed.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Software Engineering and
Methodology",
generalterms = "Security; Verification",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J790",
keywords = "automatic verification; cryptographic protocols;
noninterference; process algebra; verification tool",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0):
{\bf Security and protection (e.g., firewalls)};
Computer Systems Organization ---
Computer-Communication Networks --- Network Protocols
(C.2.2): {\bf Protocol verification}; Software ---
Software Engineering --- Software/Program Verification
(D.2.4): {\bf Formal methods}; Software --- Software
Engineering --- Software/Program Verification (D.2.4):
{\bf Model checking}; Software --- Software Engineering
--- Software/Program Verification (D.2.4): {\bf
Validation}; Theory of Computation --- Logics and
Meanings of Programs --- Semantics of Programming
Languages (F.3.2): {\bf Operational semantics}; Theory
of Computation --- Logics and Meanings of Programs ---
Semantics of Programming Languages (F.3.2): {\bf
Process models}",
}
@Article{Durfee:2000:CRS,
author = "Glenn Durfee and Phong Q. Nguyen",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Cryptanalysis of the {RSA} Schemes with Short Secret
Exponent from {Asiacrypt '99}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "14--29",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (94A62)",
MRnumber = "2002h:94052",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760014.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760014.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ebringer:2000:PAP,
author = "Tim Ebringer and Peter Thorne and Yuliang Zheng",
title = "Parasitic Authentication To Protect Your {E}-Wallet",
journal = j-COMPUTER,
volume = "33",
number = "10",
pages = "54--60",
month = oct,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 30 17:20:21 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/rx054.pdf;
http://www.computer.org/computer/co2000/rx054abs.htm",
abstract = "Preventing unauthorized use of an e-wallet has proven
quite difficult to achieve. The authors describe their
use of existing protocols to address some crucial
usability and security issues related to using these
portable devices.",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{ECMA:2000:EPIa,
author = "{ECMA}",
title = "{ECMA-305}: {Private Integrated Services Network}
({PISN}) --- Specification, Functional Model and
Information Flows --- {Wireless Terminal
Authentication} Supplementary Services ({WTMAU-SD})",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = jun,
year = "2000",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-305.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-305",
}
@Book{ECMA:2000:EPIb,
author = "{ECMA}",
title = "{ECMA-306}: {Private Integrated Services Network}
({PISN}) --- {Inter-Exchange Signalling Protocol ---
Wireless Terminal Authentication} Supplementary
Services ({QSIG-WTMAU})",
publisher = pub-ECMA,
address = pub-ECMA:adr,
month = jun,
year = "2000",
bibdate = "Thu Feb 22 08:43:46 MST 2001",
bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ecma.ch/ecma1/STAND/ECMA-306.HTM",
acknowledgement = ack-nhfb,
ECMAnumber = "ECMA-306",
}
@Book{Eghlidos:2000:SLB,
author = "Taraneh Eghlidos",
title = "On the security of {DES} and {DES}-like block ciphers
against differential cryptanalysis",
publisher = "Shaker Verlag",
address = "Aachen, Germany",
pages = "xvi + 178",
year = "2000",
ISBN = "3-8265-7951-8",
ISBN-13 = "978-3-8265-7951-6",
LCCN = "????",
bibdate = "Fri May 13 06:01:17 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Elbirt:2000:FIP,
author = "A. J. Elbirt and W. Yip and B. Chetwynd and C. Paar",
title = "An {FPGA} Implementation and Performance Evaluation of
the {AES} Block Cipher Candidate Algorithm Finalists",
crossref = "NIST:2000:TAE",
pages = "13--27",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ellison:2000:IRRa,
author = "Carl Ellison and Bruce Schneier",
title = "Inside risks: risks of {PKI}: Secure Email",
journal = j-CACM,
volume = "43",
number = "1",
pages = "160--160",
month = jan,
year = "2000",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Sep 25 15:22:32 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/2000-43/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/journals/cacm/2000-43-1/p160-ellison/p160-ellison.pdf;
http://www.acm.org/pubs/citations/journals/cacm/2000-43-1/p160-ellison/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
subject = "Information Systems --- Information Systems
Applications --- Communications Applications (H.4.3):
{\bf Electronic mail}; Computer Systems Organization
--- Computer-Communication Networks --- General
(C.2.0): {\bf Security and protection (e.g.,
firewalls)}; Data --- Data Encryption (E.3)",
}
@Article{Ellison:2000:PSK,
author = "Carl Ellison and Chris Hall and Randy Milbert and
Bruce Schneier",
title = "Protecting Secret Keys with Personal Entropy",
journal = j-FUT-GEN-COMP-SYS,
volume = "16",
number = "4",
pages = "311--318",
month = feb,
year = "2000",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Feb 27 12:41:19 MST 2002",
bibsource = "ftp://ftp.ira.uka.de/bibliography/Misc/security.2.bib;
ftp://ftp.ira.uka.de/bibliography/Theory/cryptography.bib;
ftp://ftp.ira.uka.de/bibliography/Theory/CRYPTOGRAPHY/cryptography.bib;
http://www.elsevier.com/locate/issn/0167739X;
https://www.math.utah.edu/pub/tex/bib/cryptography.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib",
URL = "http://www.counterpane.com/personal-entropy.pdf;
http://www.elsevier.com/gej-ng/10/19/19/41/27/26/abstract.html",
abstract-1 = "Conventional encryption technology often requires
users to protect a secret key by selecting a password
or passphrase. While a good passphrase will only be
known to the user, it also has the flaw that it must be
remembered exactly in order to recover the secret key.
As time passes, the ability to remember the passphrase
fades and the user may eventually lose access to the
secret key. We propose a scheme whereby a user can
protect a secret key using the ``personal entropy'' in
his own life, by encrypting the passphrase using the
answers to several personal questions. We designed the
scheme so the user can forget answers to a subset of
the questions and still recover the secret key, while
an attacker must learn the answer to a large subset of
the questions in order to recover the secret key.",
abstract-2 = "Split a secret using standard (not with cheater
detection!) (n,t) threshold secret-sharing and encrypt
them with multiple passwords. Main (only?) advantage
over a system using a passphrase of length t
(threshold) is that the system inhibits some
fault-tolerance against forgetting (at most n-t)
password. To make the set of password manageable they
use a set of hints (e.g., general questions). [However
they didn't explore how much this constrains the
dictionaries or how independent passwords will be]. The
system was proposed in 1996 and has been implemented.
See also \cite{BleNgu2000} for some attacks.",
acknowledgement = ack-nhfb,
added-at = "Wed Oct 6 12:24:48 1999",
added-by = "sti",
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Ellison:2000:TRP,
author = "C. Ellison and B. Schneier",
title = "Ten Risks of {PKI}: What You're Not Being Told About
Public-Key Infrastructure",
journal = j-COMPUT-SECUR-J,
volume = "16",
number = "1",
pages = "1--7",
month = "????",
year = "2000",
CODEN = "CSJLDR",
ISSN = "0277-0865",
bibdate = "Mon Jan 17 09:36:08 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Security Journal",
}
@Article{English:2000:MNDb,
author = "Marie English",
title = "Micro News: Digital-Signature Legislation",
journal = j-IEEE-MICRO,
volume = "20",
number = "4",
pages = "4--4",
month = jul # "\slash " # aug,
year = "2000",
CODEN = "IEMIDZ",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Dec 14 06:08:58 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Science Citation Index database (1980--2000)",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@TechReport{Ferguson:2000:CEI,
author = "N. Ferguson and B. Schneier",
title = "A Cryptographic Evaluation of {IPsec}",
type = "Technical Report",
institution = inst-COUNTERPANE-INTERNET-SECURITY,
address = inst-COUNTERPANE-INTERNET-SECURITY:adr,
year = "2000",
bibdate = "Mon Jan 17 10:18:33 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.counterpane.com/ipsec.html;
http://www.counterpane.com/ipsec.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Ferguson:2000:ICR,
author = "Niels Ferguson and John Kelsey and Bruce Schneier and
Mike Stay and David Wagner and Doug Whiting",
title = "Improved Cryptanalysis of {Rijndael} (abstract only)",
crossref = "NIST:2000:TAE",
pages = "9--9",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We improve the best attack on 6-round Rijndael from
complexity 272 to 242. We also present the first known
attacks on 7- and 8-round Rijndael. Finally, we discuss
the key schedule of Rijndael and describe a related-key
technique that can break 9-round Rijndael with 256-bit
keys.",
acknowledgement = ack-nhfb,
}
@InProceedings{Ferguson:2000:SEK,
author = "N. Ferguson",
editor = "????",
booktitle = "Third AES Candidate Conference",
title = "Semi-Equivalent Keys in {MARS}",
publisher = "????",
address = "????",
pages = "??--??",
month = apr,
year = "2000",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Oct 16 08:29:43 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@TechReport{Ferguson:2000:TRR,
author = "N. Ferguson and J. Kelsey and B. Schneier and D.
Wagner",
title = "A {Twofish} Retreat: Related-Key Attacks Against
Reduced-Round {Twofish}",
type = "{Twofish} technical report",
number = "6",
institution = inst-COUNTERPANE-SYSTEMS,
address = inst-COUNTERPANE-SYSTEMS:adr,
pages = "????",
day = "14",
month = feb,
year = "2000",
bibdate = "Mon Oct 16 08:32:43 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Article{Filiol:2000:DAS,
author = "Eric Filiol",
title = "Decimation Attack of Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "31--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770031.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770031.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Manual{FIPS:2000:DSS,
author = "{FIPS}",
title = "{Digital Signature Standard (DSS)}",
volume = "186-2",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "ii + 74",
day = "27",
month = jan,
year = "2000",
bibdate = "Thu Aug 18 07:16:02 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "FIPS PUB",
URL = "http://csrc.nist.gov/publications/fips/fips186-2/fips186-2-change1.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Digital Signature
Algorithm (DSA); Elliptic Curve Digital Signature
Algorithm (ECDSA); Rivest-Shamir-Adelman (RSA)",
remark = "From the Web site: ``October 20, 2006: An attack has
been found on some implementations of RSA digital
signatures using the padding scheme for
RSASSA-PKCS1-v1\_5 as specified in Public Key
Cryptography Standards (PKCS) #1 v2.1: RSA Cryptography
Standard-2002. A statement discussing the attack is
available. A similar attack could also be applied to
implementations of digital signatures as specified in
American National Standard (ANS) X9.31. Note that this
attack is not on the RSA algorithm itself, but on
improper implementations of the signature verification
process.''",
}
@InProceedings{Fischlin:2000:ENM,
author = "Marc Fischlin and Roger Fischlin",
title = "Efficient Non-malleable Commitment Schemes",
crossref = "Bellare:2000:ACC",
pages = "413--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800413.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800413.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Focardi:2000:ITN,
author = "Riccardo Focardi and Roberto Gorrieri and Fabio
Martinelli",
title = "Invited Talk: Non Interference for the Analysis of
Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1853",
pages = "354--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:44 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1853.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1853/18530354.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1853/18530354.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Focardi:2000:MAT,
author = "Riccardo Focardi and Roberto Gorrieri and Fabio
Martinelli",
title = "Message Authentication through Non Interference",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1816",
pages = "258--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:32 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1816.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1816/18160258.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1816/18160258.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fox:2000:NTFb,
author = "Robert Fox",
title = "News Track: Flying the rails; Logging online hours at
work; Top prize: embedded encryption; {Digital Nose}
knows; Walking again via chip implant; Cell-phone-free
class; Another node in the crowd",
journal = j-CACM,
volume = "43",
number = "5",
pages = "9--9",
month = may,
year = "2000",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Sep 25 15:22:32 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/2000-43/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2000-43-5/p9-fox/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Freking:2000:MMR,
author = "W. L. Freking and K. K. Parhi",
booktitle = "Conference Record of the Thirty-Fourth Asilomar
Conference on Signals, Systems and Computers, 2000",
title = "Modular multiplication in the residue number system
with application to massively-parallel public-key
cryptography systems",
volume = "2",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1339--1343",
year = "2000",
CODEN = "????",
DOI = "https://doi.org/10.1109/ACSSC.2000.911210",
ISSN = "????",
bibdate = "Fri Nov 9 11:38:59 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "residue arithmetic; residue number system",
summary = "Modular multiplication is a fundamental operation in
many public-key cryptography systems including RSA.
Residue number system (RNS) implementation of modular
multiplication has been of recent interest due to
inherent RNS properties of \ldots{}",
}
@TechReport{Frykholm:2000:CAB,
author = "Niklas Frykholm",
title = "Countermeasures against Buffer Overflow Attacks",
type = "Technical report",
institution = pub-RSA,
address = pub-RSA:adr,
day = "30",
month = nov,
year = "2000",
bibdate = "Wed Jun 06 06:07:12 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/technotes/buffer/buffer_overflow.html",
acknowledgement = ack-nhfb,
}
@Article{Furnell:2000:ASS,
author = "S. M. Furnell and P. S. Dowland and H. M. Illingworth
and P. L. Reynolds",
title = "Authentication and Supervision: a Survey of User
Attitudes",
journal = j-COMPUT-SECUR,
volume = "19",
number = "6",
pages = "529--539",
day = "1",
month = oct,
year = "2000",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:41 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404800060272",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Gaj:2000:CHP,
author = "Kris Gaj and Pawel Chodowiec",
title = "Comparison of the hardware performance of the {AES}
candidates using reconfigurable hardware",
crossref = "NIST:2000:TAE",
pages = "40--56",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Garay:2000:LLB,
author = "Juan A. Garay and Jessica Staddon and Avishai Wool",
title = "Long-Lived Broadcast Encryption",
crossref = "Bellare:2000:ACC",
pages = "333--??",
year = "2000",
MRclass = "94A60",
MRnumber = "2002h:94054",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800333.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800333.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Gengler:2000:UPC,
author = "Barbara Gengler",
title = "{US President Clinton} signs {Digital Signature
Bill}",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "9",
pages = "7--8",
day = "1",
month = sep,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)09023-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800090231",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Gennaro:2000:IPR,
author = "Rosario Gennaro",
title = "An Improved Pseudo-random Generator Based on Discrete
Log",
crossref = "Bellare:2000:ACC",
pages = "469--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800469.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800469.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Gennaro:2000:LBE,
author = "R. Gennaro and L. Trevisan",
title = "Lower bounds on the efficiency of generic
cryptographic constructions",
crossref = "IEEE:2000:ASF",
pages = "305--313",
year = "2000",
bibdate = "Thu Apr 5 06:14:11 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Geppert:2000:T,
author = "L. Geppert and W. Sweet",
title = "Technology 2000",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "1",
pages = "26--31",
month = jan,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2000.815435",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib;
https://www.math.utah.edu/pub/tex/bib/java2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Hardware; Home appliances; Internet;
Java; NIST; Open source software; Operating systems;
Protection",
}
@Article{Geppert:2000:TMS,
author = "L. Geppert and Tekla S. Perry",
title = "{Transmeta}'s magic show [microprocessor chips]",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "5",
pages = "26--33",
month = may,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.842131",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib;
https://www.math.utah.edu/pub/tex/bib/java2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Chip scale packaging; Computer architecture;
Contracts; Crusoe chips; Crusoe microprocessors;
Hardware; IBM PC-compatible personal computers;
low-power chips; Marketing and sales; microprocessor
chips; Microprocessors; Microsoft Windows; Personal
communication networks; Reduced instruction set
computing; Remuneration; software applications;
Transmeta Corporation; Unix; VLIW",
}
@InProceedings{Gertner:2000:RBP,
author = "Y. Gertner and S. Kannan and T. Malkin and O. Reingold
and M. Viswanathan",
title = "The relationship between public key encryption and
oblivious transfer",
crossref = "IEEE:2000:ASF",
pages = "325--335",
year = "2000",
bibdate = "Thu Apr 5 06:14:11 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gilbert:2000:CAR,
author = "Henri Gilbert and Marine Minier",
title = "A collision attack on 7 rounds of {Rijndael}",
crossref = "NIST:2000:TAE",
pages = "230--241",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gilbert:2000:SAR,
author = "Henri Gilbert and Helena Handschuh and Antoine Joux
and Serge Vaudenay",
title = "A Statistical Attack on {RC6} (abstract only)",
crossref = "NIST:2000:TAE",
pages = "10--10",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This paper details the attack on RC6 which was
announced in a report published in the proceedings of
the second AES candidate conference (March 1999). Based
on an observation on the RC6 statistics, we show how to
distinguish RC6 from a random permutation and to
recover the secret extended key for a fair number of
rounds.",
acknowledgement = ack-nhfb,
}
@Article{Girault:2000:CCP,
author = "Marc Girault and Jean-Fran{\c{c}}ois Misarsky",
title = "Cryptanalysis of Countermeasures Proposed for
Repairing {ISO 9796-1}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "81--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070081.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070081.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gisin:2000:LCQ,
author = "Nicolas Gisin and Stefan Wolf",
title = "Linking Classical and Quantum Key Agreement: Is There
``{Bound Information}''?",
crossref = "Bellare:2000:ACC",
pages = "482--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800482.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800482.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Giuliano:2000:ISC,
author = "Genevieve Giuliano and James E. {Moore II} and
Jacqueline Golob",
title = "Integrated smart-card fare system: results from field
operational test",
journal = "Transportation research record",
pages = "138--146",
month = "No",
year = "2000",
LCCN = "TA1001.5 .T7 no. 1735",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "bus lines --- California --- Ventura County --- fares;
local transit passes --- California --- Ventura County;
smart cards --- California --- Ventura County ---
evaluation",
}
@Article{Gonzales:2000:LBC,
author = "Octavio A. Gonzales and Gunhee Han and Jos{\'e} Pineda
de Gyvez and Edgar S{\'a}nchez-Sinencio",
title = "{Lorenz}-based chaotic cryptosystem: a monolithic
implementation",
journal = "IEEE Trans. Circuits Systems I Fund. Theory Appl.",
volume = "47",
number = "8",
pages = "1243--1247",
year = "2000",
CODEN = "ITCAEX",
ISSN = "1057-7122 (print), 1558-1268 (electronic)",
MRclass = "94A60",
MRnumber = "1 792 708",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "IEEE Transactions on Circuits and Systems. I.
Fundamental Theory and Applications",
}
@Article{Good:2000:TAE,
author = "I. J. Good",
title = "{Turing}'s anticipation of empirical {Bayes} in
connection with the cryptanalysis of the naval
{Enigma}",
journal = j-J-STAT-COMPUT-SIMUL,
volume = "66",
number = "2",
pages = "101--111",
year = "2000",
CODEN = "JSCSAT",
ISSN = "0094-9655 (print), 1563-5163 (electronic)",
ISSN-L = "0094-9655",
MRclass = "62C12 (01A60 62L10 68P25)",
MRnumber = "2001k:62008",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "50th Anniversary of the Department of Statistics,
Virginia Tech, Part II (Blacksburg, VA, 1999)",
fjournal = "Journal of Statistical Computation and Simulation",
journal-URL = "http://www.tandfonline.com/loi/gscs20",
}
@Article{Goubault-Larrecq:2000:MAC,
author = "Jean Goubault-Larrecq",
title = "A Method for Automatic Cryptographic Protocol
Verification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1800",
pages = "977--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:18 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1800.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1800/18000977.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1800/18000977.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Goubin:2000:CTC,
author = "Louis Goubin and Nicolas T. Courtois",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Cryptanalysis of the {TTM} cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "44--57",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "2002j:94037",
bibdate = "Sat Oct 26 10:52:02 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gutmann:2000:OSC,
author = "Peter Gutmann",
title = "An Open-Source Cryptographic Coprocessor",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/gutmann.html",
acknowledgement = ack-nhfb,
}
@Article{Haddad:2000:AUA,
author = "Ibrahim F. Haddad",
title = "{Apache} User Authentication",
journal = j-LINUX-J,
volume = "78",
pages = "??--??",
month = oct,
year = "2000",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Sep 21 07:44:14 MDT 2000",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue78/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
abstract = "A guide to setting up user authentication for the
Apache web server running on Linux, using the plaintext
file method.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Hamdy:2000:SCB,
author = "Safuat Hamdy and Bodo M{\"o}ller",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Security of cryptosystems based on class groups of
imaginary quadratic orders",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "234--247",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (11T71)",
MRnumber = "2002j:94040",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hanaoka:2000:USD,
author = "Goichiro Hanaoka and Junji Shikata and Yuliang Zheng
and Hideki Imai",
title = "Unconditionally Secure Digital Signature Schemes
Admitting Transferability",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "130--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760130.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760130.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hancock:2000:EWP,
author = "Bill Hancock",
title = "Not Everyone Wants {PKI} --- {NSF} Opts for Digital
Signature Alternative",
journal = j-COMPUT-SECUR,
volume = "19",
number = "4",
pages = "301--302",
day = "1",
month = apr,
year = "2000",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404800040098",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Hankerson:2000:CTC,
author = "Darrel R. Hankerson and Gary Hoffman and D. A. Leonard
and Charles C. Lindner and K. T. Phelps and C. A.
Rodger and J. R. Wall",
title = "Coding theory and cryptography: the essentials",
volume = "234",
publisher = pub-DEKKER,
address = pub-DEKKER:adr,
edition = "Second",
pages = "x + 350",
year = "2000",
ISBN = "0-8247-0465-7",
ISBN-13 = "978-0-8247-0465-0",
LCCN = "QA268 .C675 2000",
bibdate = "Mon Oct 16 09:48:58 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Monographs and textbooks in pure and applied
mathematics",
URL = "http://lccn.loc.gov/00060106",
acknowledgement = ack-nhfb,
keywords = "coding theory; cryptography",
}
@InProceedings{Harvey:2000:EMA,
author = "Ian Harvey",
title = "The Effects of Multiple Algorithms in the {Advanced
Encryption Standard}",
crossref = "NIST:2000:TAE",
pages = "269--278",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Hasan:2000:LTB,
author = "M. Anwarul Hasan",
title = "Look-up table-based large finite field multiplication
in memory constrained cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "49",
number = "7",
pages = "749--758",
year = "2000",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.863045",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
MRclass = "94A60",
MRnumber = "1 783 604",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Institute of Electrical and Electronics Engineers.
Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hassler:2000:OFA,
author = "Vesna Hassler and Oliver Fodor",
title = "{OpenCard Framework} Application Development",
journal = j-DDJ,
volume = "25",
number = "2",
pages = "70, 72, 74--76",
month = feb,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:13 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2000/2000_02/ocfjava.txt;
http://www.ddj.com/ftp/2000/2000_02/ocfjava.zip",
abstract = "The Personal Computer/Smart Card Interface (PC/SC) and
OpenCard Framework emphasize the interoperability of
smartcards and card terminals, and the integration of
those card terminals into Microsoft Windows. Additional
resources include ocfjava.txt (listings) and
ocfjava.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Hawkes:2000:EMC,
author = "Philip Hawkes and Gregory G. Rose",
title = "Exploiting Multiples of the Connection Polynomial in
Word-Oriented Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "303--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760303.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760303.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Hill:2000:KII,
author = "Paul B. Hill",
title = "{Kerberos} Interoperability Issues",
crossref = "USENIX:2000:PLI",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 07:19:34 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://db.usenix.org/publications/library/proceedings/lisa-nt2000/hill.html",
acknowledgement = ack-nhfb,
}
@InCollection{Hirt:2000:ERF,
author = "Martin Hirt and Kazue Sako",
booktitle = "Advances in cryptology---EUROCRYPT 2000 (Bruges)",
title = "Efficient Receipt-Free Voting Based on Homomorphic
Encryption",
volume = "1807",
publisher = pub-SV,
address = pub-SV:adr,
pages = "539--556",
year = "2000",
MRclass = "94A60 (91B12)",
MRnumber = "1 772 033",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070539.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070539.pdf",
}
@Article{Hofmeister:2000:COS,
author = "Thomas Hofmeister and Matthias Krause and Hans U.
Simon",
title = "Contrast-optimal $k$ out of $n$ secret sharing schemes
in visual cryptography",
journal = j-THEOR-COMP-SCI,
volume = "240",
number = "2",
pages = "471--485",
day = "17",
month = jun,
year = "2000",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Oct 31 11:38:27 MST 2000",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/174/23/31/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/174/23/31/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Horn:2000:APF,
author = "G{\"u}nther Horn and Bart Preneel",
title = "Authentication and payment in future mobile systems",
journal = j-J-COMP-SECUR,
volume = "8",
number = "2--3",
pages = "183--207",
month = "????",
year = "2000",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2000-82-306",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:21:31 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Huhnlein:2000:EIC,
author = "Detlef H{\"u}hnlein",
booktitle = "Selected areas in cryptography (Kingston, ON, 1999)",
title = "Efficient implementation of cryptosystems based on
non-maximal imaginary quadratic orders",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1758",
pages = "147--162",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 767 730",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hwang:2000:CBV,
author = "Min-Shiang Hwang and Iuon-Chung Lin and Kuo-Feng
Hwang",
title = "Cryptanalysis of the batch verifying multiple {RSA}
digital signatures",
journal = "Informatica (Vilnius)",
volume = "11",
number = "1",
pages = "15--18",
year = "2000",
ISSN = "0868-4952",
MRclass = "94A60",
MRnumber = "1 754 435",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lithuanian Academy of Sciences. Informatica
(Vilnius)",
}
@Article{Hwang:2000:CYK,
author = "Min-Shiang Hwang",
title = "Cryptanalysis of {YCN} key assignment scheme in a
hierarchy",
journal = j-INFO-PROC-LETT,
volume = "73",
number = "3-4",
pages = "97--101",
year = "2000",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A60 (68P25)",
MRnumber = "2000k:94032",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@TechReport{IBM-MARS-Team:2000:MAS,
author = "{IBM MARS Team}",
title = "{MARS} and the {AES} Selection Criteria",
type = "Technical report",
institution = pub-IBM,
address = pub-IBM:adr,
day = "15",
month = may,
year = "2000",
bibdate = "Fri Feb 16 08:13:57 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.research.ibm.com/security/final-comments.doc;
http://www.research.ibm.com/security/final-comments.pdf;
http://www.research.ibm.com/security/final-comments.ps",
acknowledgement = ack-nhfb,
}
@InProceedings{Ichikawa:2000:HEA,
author = "Tetsuya Ichikawa and Tomomi Kasuya and Mitsuru
Matsui",
title = "Hardware Evaluation of the {AES} Finalists",
crossref = "NIST:2000:TAE",
pages = "279--285",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Misc{IEEE:2000:IPH,
author = "{IEEE}",
title = "The {IEEE P1363} Home Page: Standard Specifications
For Public-Key Cryptography",
howpublished = "World-Wide Web site.",
year = "2000",
bibdate = "Mon Dec 08 08:02:36 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://grouper.ieee.org/groups/1363/index.html",
acknowledgement = ack-nhfb,
}
@Book{Ifrah:2000:UHN,
author = "Georges Ifrah",
title = "The Universal History of Numbers from Prehistory to
the Invention of the Computer",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxii + 633",
year = "2000",
ISBN = "0-471-37568-3",
ISBN-13 = "978-0-471-37568-5",
LCCN = "QA141.I3713 2000",
bibdate = "Mon Dec 06 16:02:33 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Translated from the French edition, {\em Histoire
universelle des chiffres}, by David Bellos, E. F.
Harding, Sophie Wood, and Ian Monk.",
price = "US\$39.95",
acknowledgement = ack-nhfb,
annote = "Contains a dozen or so pages on the use of numbers in
historical cryptography and numerology.",
}
@Article{Imai:2000:CPC,
author = "Hideki Imai and Atsuhiro Yamagishi",
title = "{CRYPTREC Project} --- Cryptographic Evaluation
Project for the {Japanese} Electronic Government",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "399--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760399.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760399.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Intel:2000:IIP,
author = "{Intel Corporation}",
title = "{Intel Itanium} Processor: High Performance On
Security Algorithms ({RSA} Decryption Kernel)",
institution = pub-INTEL,
address = pub-INTEL:adr,
pages = "8",
year = "2000",
bibdate = "Fri Jan 05 09:27:38 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
URL = "http://developer.intel.com/design/ia-64/downloads/itaniumssl_seg_103.htm",
acknowledgement = ack-nhfb,
}
@InProceedings{Itoi:2000:SCI,
author = "Naomaru Itoi",
title = "Secure Coprocessor Integration with {Kerberos V5}",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/itoi.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Iwata:2000:PAF,
author = "Tetsu Iwata and Kaoru Kurosawa",
title = "On the Pseudorandomness of {AES} Finalists --- {RC6},
{Serpent}, {MARS} and {Twofish} (abstract only)",
crossref = "NIST:2000:TAE",
pages = "9--9",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The aim of this paper is to compare the security of
AES finalists in an idealized model like Luby and
Rackoff. We mainly prove that a five round idealized
RC6 and a three round idealized Serpent are
super-pseudorandom permutations. We then show a
comparison about this kind of pseudorandomness for four
AES finalists, RC6, Serpent, MARS and Twofish.",
acknowledgement = ack-nhfb,
}
@Article{Jackson:2000:SCQ,
author = "Chris Jackson",
title = "Smart card questions move from technology to
applications",
journal = "Railway gazette international",
volume = "156",
number = "3",
pages = "167--168",
month = mar,
year = "2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "automatic fare collection; local transit --- fares ---
equipment and supplies; smart cards",
}
@Article{Jakobsson:2000:MMS,
author = "Markus Jakobsson and Ari Juels",
title = "Mix and Match: Secure Function Evaluation via
Ciphertexts",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "162--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760162.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760162.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jambunathan:2000:CCP,
author = "K. Jambunathan",
title = "On Choice of Connection-Polynomials for {LFSR}-Based
Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "9--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770009.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770009.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Janczewski:2000:IIS,
author = "Lech Janczewski",
title = "{Internet} and intranet security management: risks and
solutions",
publisher = "Idea Group Pub.",
address = "Hershey, PA, USA",
pages = "302",
year = "2000",
ISBN = "1-878289-71-3",
ISBN-13 = "978-1-878289-71-1",
LCCN = "TK5105.875.I57 I684 2000",
bibdate = "Mon Apr 29 11:50:37 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Contents: Pt. I. State of the Art. Ch. 1. Security
Risk Assessment and Electronic Commerce: A
Cross-Industry Analysis / Jonathan W. Palmer, Jamie
Kliewer and Mark Sweat. Ch. 2. Securing the Internet in
New Zealand: Threats and Solutions / Jairo A. Gutierrez
--- Pt. II. Managing Intranet and Internet Security.
Ch. 3. Developing Trust for Electronic Commerce /
Dieter Fink. Ch. 4. Managing Security Functions Using
Security Standards / Lech Janczewski. Ch. 5. Managing
Security in the World Wide Web: Architecture, Services
and Techniques / Fredj Dridi and Gustaf Neumann --- Pt.
III. Cryptography and Technical Security Standards. Ch.
6. Cryptography: Protecting Confidentiality, Integrity
and Availability of Data / Henry B. Wolfe. Ch. 7.
Foundations for Cryptography / Dieter Gollmann. Ch. 8.
Developments in Security Mechanism Standards / Chris
Mitchell --- Pt. IV. Security and the Law. Ch. 9.
Electronic Mail, Employee Privacy and the Workplace /
Charles Prysby and Nicole Prysby. Ch. 10. Protecting
Personal Privacy in Cyberspace: The Limitations of
Third Generation Data Protection Laws Such as the New
Zealand Privacy Act 1993 / Gehan Gunasekara",
acknowledgement = ack-nhfb,
annote = "Contents: Pt. I. State of the Art. Ch. 1. Security
Risk Assessment and Electronic Commerce: A
Cross-Industry Analysis / Jonathan W. Palmer, Jamie
Kliewer and Mark Sweat. Ch. 2. Securing the Internet in
New Zealand: Threats and Solutions / Jairo A. Gutierrez
--- Pt. II. Managing Intranet and Internet Security.
Ch. 3. Developing Trust for Electronic Commerce /
Dieter Fink. Ch. 4. Managing Security Functions Using
Security Standards / Lech Janczewski. Ch. 5. Managing
Security in the World Wide Web: Architecture, Services
and Techniques / Fredj Dridi and Gustaf Neumann --- Pt.
III. Cryptography and Technical Security Standards. Ch.
6. Cryptography: Protecting Confidentiality, Integrity
and Availability of Data / Henry B. Wolfe. Ch. 7.
Foundations for Cryptography / Dieter Gollmann. Ch. 8.
Developments in Security Mechanism Standards / Chris
Mitchell --- Pt. IV. Security and the Law. Ch. 9.
Electronic Mail, Employee Privacy and the Workplace /
Charles Prysby and Nicole Prysby. Ch. 10. Protecting
Personal Privacy in Cyberspace: The Limitations of
Third Generation Data Protection Laws Such as the New
Zealand Privacy Act 1993 / Gehan Gunasekara.",
keywords = "computers --- access control; cryptography; Internet
--- security measures; intranets (computer networks)
--- security measures",
}
@Article{Jarecki:2000:AST,
author = "Stanis{\l}aw Jarecki and Anna Lysyanskaya",
title = "Adaptively Secure Threshold Cryptography: Introducing
Concurrency, Removing Erasures (Extended Abstract)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "221--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070221.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070221.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Jaulmes:2000:CCA,
author = "{\'E}liane Jaulmes and Antoine Joux",
title = "A Chosen-Ciphertext Attack against {NTRU}",
crossref = "Bellare:2000:ACC",
pages = "20--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800020.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800020.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Jaulmes:2000:NC,
author = "{\'E}liane Jaulmes and Antoine Joux",
title = "A {NICE} Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "382--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070382.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070382.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jennewein:2000:FCQ,
author = "Thomas Jennewein and Ulrich Achleitner and Gregor
Weihs and Harald Weinfurter and Anton Zeilinger",
title = "A fast and compact quantum random number generator",
journal = j-REV-SCI-INSTRUM,
volume = "71",
number = "4",
pages = "1675--1680",
year = "2000",
CODEN = "RSINAK",
DOI = "https://doi.org/10.1063/1.1150518",
ISSN = "1089-7623, 0034-6748",
ISSN-L = "0034-6748",
bibdate = "Mon Jan 16 15:57:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://link.aip.org/link/?RSI/71/1675/1",
acknowledgement = ack-nhfb,
fjournal = "Review of scientific instruments",
journal-URL = "http://rsi.aip.org/",
keywords = "binary sequences; optical beam splitters; optical
polarisers; quantum cryptography; quantum optics;
random number generation; true random numbers from
physical sources",
}
@InProceedings{Johansson:2000:FCA,
author = "Thomas Johansson and Fredrik J{\"o}nsson",
title = "Fast Correlation Attacks through Reconstruction of
Linear Polynomials",
crossref = "Bellare:2000:ACC",
pages = "300--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800300.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800300.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Johnson:2000:AFR,
author = "Don Johnson",
title = "{AES} and Future Resiliency: More Thoughts And
Questions",
crossref = "NIST:2000:TAE",
pages = "257--268",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Katz:2000:CCA,
author = "Jonathan Katz and Bruce Schneier",
title = "A Chosen Ciphertext Attack Against Several {E}-Mail
Encryption Protocols",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/katz.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Katz:2000:CCS,
author = "Jonathan Katz and Moti Yung",
title = "Complete characterization of security notions for
probabilistic private-key encryption",
crossref = "ACM:2000:PTS",
pages = "245--254",
year = "2000",
bibdate = "Wed Feb 20 18:35:45 MST 2002",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/series/stoc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/proceedings/stoc/335305/p245-katz/p245-katz.pdf;
http://www.acm.org/pubs/citations/proceedings/stoc/335305/p245-katz/",
acknowledgement = ack-nhfb,
}
@Book{Katzenbeisser:2000:IHT,
editor = "Stefan Katzenbeisser and Fabien A. P. Petitcolas",
title = "Information hiding techniques for steganography and
digital watermarking",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "xviii + 220",
year = "2000",
ISBN = "1-58053-035-4",
ISBN-13 = "978-1-58053-035-4",
LCCN = "QA76.9.A25 I54144 2000",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Artech House computer security series",
abstract = "Steganography, a means by which two or more parties
may communicate using ``invisible'' or ``subliminal''
communication, and watermarking, a means of hiding
copyright data in images, are becoming necessary
components of commercial multimedia applications that
are subject to illegal use.\par
Inside, you get a thorough review of steganography, the
history of this previously neglected element of
cryptography, a description of possible applications,
and a survey of methods you can use to hide information
in modern media. Included is an overview of
``steganalysis,'' methods that can be used to break
steganographic communication.",
acknowledgement = ack-nhfb,
keywords = "computer security; data protection; water-marks",
subject = "Computer security; Data protection; Digital
watermarking; Watermarks; tatouage; empreinte digitale;
st{\'e}ganographie; cryptographie; Cryptographie.;
Filigranes (papeterie); Techniques num{\'e}riques.;
Protection de l'information (informatique); Computer
security.; Data protection.; Digital watermarking.",
tableofcontents = "1: Introduction to information hiding \\
I: Secret writing and steganography \\
2: Principles of steganography \\
3: A survey of steganographic techniques \\
4: Steganalysis \\
II: Watermarking and copyright protection \\
5: Introduction to watermarking techniques\\
6: A survey of current watermarking techniques\\
7: Robustness of copyright marking systems\\
8: Fingerprinting\\
9: Copyright on the Internet and watermarking",
}
@InProceedings{Kelsey:2000:ABA,
author = "John Kelsey and Tadayoshi Kohno and Bruce Schneier",
title = "Amplified Boomerang Attacks Against Reduced-Round
{MARS} and {Serpent} (abstract only)",
crossref = "NIST:2000:TAE",
pages = "10--10",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We introduce a new kind of attack based on Wagner's
boomerang and inside-out attacks. We first describe the
new attack in terms of the original boomerang attack,
and then demonstrate its use on reduced-round variants
of the MARS core and of Serpent. Our attack breaks
eleven rounds of the Mars core with 265 chosen
plaintexts, 269 memory, and 2229 partial decryptions.
Our attack breaks eight rounds of Serpent with 2114
chosen plaintexts, 2119 memory, and 2179 partial
decryptions.",
acknowledgement = ack-nhfb,
}
@InProceedings{Kelsey:2000:CPL,
author = "J. Kelsey and N. Ferguson and B. Schneier and M.
Stay",
editor = "????",
booktitle = "Third AES Candidate Conference",
title = "Cryptanalytic Progress: Lessons for {AES}",
publisher = "????",
address = "????",
pages = "??--??",
month = apr,
year = "2000",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Oct 16 08:37:43 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@TechReport{Kelsey:2000:KST,
author = "J. Kelsey",
title = "Key Separation in {Twofish}",
type = "{Twofish} technical report",
number = "7",
institution = inst-COUNTERPANE-SYSTEMS,
address = inst-COUNTERPANE-SYSTEMS:adr,
pages = "????",
day = "7",
month = apr,
year = "2000",
bibdate = "Mon Oct 16 08:36:24 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.counterpane.com/twofish-tr7.html",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@InProceedings{Kelsey:2000:MAP,
author = "John Kelsey and Bruce Schneier",
title = "{MARS} Attacks! Preliminary Cryptanalysis of
Reduced-Round {MARS} Variants",
crossref = "NIST:2000:TAE",
pages = "169--185",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Kelsey:2000:SCC,
author = "John Kelsey and Bruce Schneier and David Wagner and
Chris Hall",
title = "Side channel cryptanalysis of product ciphers",
journal = j-J-COMP-SECUR,
volume = "8",
number = "2--3",
pages = "141--158",
month = "????",
year = "2000",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2000-82-304",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:21:31 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Kelsey:2000:YND,
author = "John Kelsey and Bruce Schneier and Niels Ferguson",
title = "{Yarrow-160}: Notes on the design and analysis of the
{Yarrow} cryptographic pseudorandom number generator",
crossref = "Heys:2000:SAC",
pages = "13--33",
year = "2000",
bibdate = "Mon Aug 30 17:37:07 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.counterpane.com/yarrow-notes.html;
http://www.schneier.com/paper-yarrow.html",
abstract = "We describe the design of Yarrow, a family of
cryptographic pseudo-random number generators (PRNG).
We describe the concept of a PRNG as a separate
cryptographic primitive, and the design principles used
to develop Yarrow. We then discuss the ways that PRNGs
can fail in practice, which motivates our discussion of
the components of Yarrow and how they make Yarrow
secure. Next, we define a specific instance of a PRNG
in the Yarrow family that makes use of available
technology today.",
acknowledgement = ack-nhfb,
pagecount = "14",
xxtitle = "Notes on the Design and Analysis of the {Yarrow}
Cryptographic Pseudorandom Number Generator",
}
@Article{Kidwell:2000:SNC,
author = "Peggy A. Kidwell",
title = "The {Swiss Nema} cipher machine [Reviews]",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "22",
number = "2",
pages = "80--80",
month = apr # "--" # jun,
year = "2000",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2000.841146",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Wed Mar 14 10:17:48 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Kim:2000:RMW,
author = "Tae-hoon Kim and Jehee Lee and Sung Yong Shin",
title = "Robust Motion Watermarking based on Multiresolution
Analysis",
journal = j-CGF,
volume = "19",
number = "3",
pages = "??--??",
month = aug,
year = "2000",
CODEN = "CGFODY",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Wed Oct 11 06:13:38 MDT 2000",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "aid=411&
http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0167-7055&
iid=3& src=ard& vid=19",
acknowledgement = ack-nhfb,
author-1-adr = "Department of Computer Science, Korea Advanced
Institute of Science and Technology, 373-1 Kusung-dong
Yusung-gu, Taejon, Republic of Korea",
author-2-adr = "Department of Computer Science, Korea Advanced
Institute of Science and Technology, 373-1 Kusung-dong
Yusung-gu, Taejon, Republic of Korea",
author-3-adr = "Department of Computer Science, Korea Advanced
Institute of Science and Technology, 373-1 Kusung-dong
Yusung-gu, Taejon, Republic of Korea",
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{King:2000:IMP,
author = "Brian King",
title = "Improved Methods to Perform Threshold {RSA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "359--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760359.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760359.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Knudsen:2000:CRA,
author = "Lars Knudsen and Willi Meier",
title = "Correlations in {RC6} (abstract only)",
crossref = "NIST:2000:TAE",
pages = "9--9",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this paper the block cipher RC6 is analysed. RC6 is
submitted as a candidate for the Advanced Encryption
Standard, and is one of five finalists. It has 128-bit
blocks and supports keys of 128, 192 and 256 bits, and
is an iterated 20-round block cipher. Here it is shown
that versions of RC6 with 128-bit blocks can be
distinguished from a random permutation with up to 15
rounds; for some weak keys up to 17 rounds. Moreover,
with an increased effort key-recovery attacks can be
mounted on RC6 with up to 15 rounds faster than an
exhaustive search for the key.",
acknowledgement = ack-nhfb,
}
@TechReport{Knudsen:2000:TT,
author = "L. Knudsen",
title = "Trawling {Twofish}",
type = "Reports in Informatics",
institution = "University of Bergen",
address = "Bergen, Norway",
pages = "????",
month = apr,
year = "2000",
bibdate = "Mon Oct 16 08:43:59 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@InProceedings{Knudsen:2000:TTR,
author = "L. Knudsen",
editor = "????",
booktitle = "Third AES Candidate Conference",
title = "Trawling {Twofish} --- Revisited",
publisher = "????",
address = "????",
pages = "??--??",
month = apr,
year = "2000",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Oct 16 08:44:47 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@InProceedings{Ko:2000:NPK,
author = "Ki Hyoung Ko and Sang Jin Lee and Jung Hee Cheon and
Jae Woo Han and Ju-sung Kang and Choonsik Park",
title = "New Public-Key Cryptosystem Using Braid Groups",
crossref = "Bellare:2000:ACC",
pages = "166--??",
year = "2000",
MRclass = "94A62 (20F36)",
MRnumber = "2002i:94057",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800166.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800166.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Book{Koblitz:2000:TQC,
author = "Neal Koblitz",
title = "Towards a quarter-century of public key cryptography",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "179",
year = "2000",
ISBN = "0-7923-7802-4",
ISBN-13 = "978-0-7923-7802-0",
LCCN = "QA76.9.A25 T69 2000",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "A special issue of Designs, codes, and cryptography,
an international journal, volume 19, no. 2/3 (2000).",
acknowledgement = ack-nhfb,
keywords = "computer security; public key cryptography ---
history",
}
@InProceedings{Kohno:2000:PCR,
author = "Tadayoshi Kohno and John Kelsey and Bruce Schneier",
title = "Preliminary Cryptanalysis of Reduced-Round {Serpent}",
crossref = "NIST:2000:TAE",
pages = "195--214",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Koshiba:2000:SEP,
author = "Takeshi Koshiba and Osamu Watanabe",
title = "Strong encryption of public key cryptosystems based on
weak randomness hypotheses",
journal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
volume = "1148",
number = "1148",
pages = "118--123",
year = "2000",
MRclass = "94A62",
MRnumber = "1 799 823",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
note = "Theoretical foundations of computer science: toward a
paradigm for computing in the 21st century (Japanese)
(Kyoto, 2000)",
fjournal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
}
@Book{Kovacich:2000:HTC,
author = "Gerald L. Kovacich and William C. Boni",
title = "High-technology-crime investigator's handbook: working
in the global information environment",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xix + 298",
year = "2000",
ISBN = "0-7506-7086-X",
ISBN-13 = "978-0-7506-7086-9",
LCCN = "HV8079.C65 K68 2000",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
acknowledgement = ack-nhfb,
}
@InProceedings{Kuhn:2000:PCL,
author = "Markus G. Kuhn",
title = "Probabilistic Counting of Large Digital Signature
Collections",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/kuhn.html",
acknowledgement = ack-nhfb,
}
@Article{Kun:2000:SMA,
author = "Yang Kun and Guo Xin and Liu Dayou",
title = "Security in mobile agent system: problems and
approaches",
journal = j-OPER-SYS-REV,
volume = "34",
number = "1",
pages = "21--28",
month = jan,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Kuribayashi:2000:WSB,
author = "Minoru Kuribayashi and Hatsukazu Tanaka",
title = "A Watermarking Scheme Based on the Characteristic of
Addition among {DCT} Coefficients",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "1--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kushilevitz:2000:OWT,
author = "Eyal Kushilevitz and Rafail Ostrovsky",
title = "One-Way Trapdoor Permutations Are Sufficient for
Non-trivial Single-Server Private Information
Retrieval",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "104--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070104.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070104.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Lafe:2000:CAT,
author = "Olu Lafe",
title = "Cellular automata transforms: theory and applications
in multimedia compression, encryption and modeling",
volume = "MMSA16",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xii + 177",
year = "2000",
ISBN = "0-7923-7857-1",
ISBN-13 = "978-0-7923-7857-0",
LCCN = "QA267.5.C45 L34 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Multimedia systems and applications series",
acknowledgement = ack-nhfb,
keywords = "cellular automata",
}
@Article{Landau:2000:CST,
author = "Susan Landau",
title = "Communications Security for the {Twenty-first
Century}: {The Advanced Encryption Standard}",
journal = j-NAMS,
volume = "47",
number = "4",
pages = "450--459",
month = apr,
year = "2000",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Fri Oct 25 12:55:40 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/notices/200004/fea-landau.pdf",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Article{Landau:2000:STT,
author = "Susan Landau",
title = "Standing the Test of Time: {The Data Encryption
Standard}",
journal = j-NAMS,
volume = "47",
number = "3",
pages = "341--349",
month = mar,
year = "2000",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
MRclass = "94A60 (01A60)",
MRnumber = "1740390",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/nams2000.bib",
URL = "http://www.ams.org/notices/200003/fea-landau.pdf",
acknowledgement = ack-nhfb,
ajournal = "Notices Amer. Math. Soc.",
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Article{Landau:2000:TOD,
author = "Susan Landau",
title = "Technical opinion: designing cryptography for the new
century",
journal = j-CACM,
volume = "43",
number = "5",
pages = "115--115",
month = may,
year = "2000",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Sep 25 15:22:32 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/2000-43/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2000-43-5/p115-landau/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
subject = "Data --- Data Encryption (E.3)",
}
@Article{Lanet:2000:ITS,
author = "Jean-Louis Lanet",
title = "Invited talk: Are Smart Cards the Ideal Domain for
Applying Formal Methods?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1878",
pages = "363--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1878.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1878/18780363.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1878/18780363.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Laufer:2000:SSC,
author = "Konstantin L{\"a}ufer and Gerald Baumgartner and
Vincent F. Russo",
title = "Safe Structural Conformance for {Java}",
journal = j-COMP-J,
volume = "43",
number = "6",
pages = "469--481",
month = "????",
year = "2000",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 6 08:20:58 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_06/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_06/430469.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_06/pdf/430469.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Lee:2000:UBN,
author = "J. A. N. Lee and C. Burke and D. Anderson",
title = "The {US Bombes}, {NCR}, {Joseph Desch}, and 600
{WAVES}: the first reunion of the {US Naval Computing
Machine Laboratory}",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "22",
number = "3",
pages = "27--41",
month = jul # "\slash " # sep,
year = "2000",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/85.859524",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Thu Jul 12 08:14:46 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeeannhistcomput.bib",
URL = "http://ieeexplore.ieee.org/iel5/85/18655/00859524.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@InProceedings{Lenstra:2000:XPK,
author = "Arjen K. Lenstra and Eric R. Verheul",
title = "The {XTR} Public Key System",
crossref = "Bellare:2000:ACC",
pages = "1--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800001.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Book{Lewand:2000:CM,
author = "Robert Edward Lewand",
title = "Cryptological Mathematics",
publisher = pub-MATH-ASSOC-AMER,
address = pub-MATH-ASSOC-AMER:adr,
pages = "xiv + 1999",
year = "2000",
ISBN = "0-88385-719-7",
ISBN-13 = "978-0-88385-719-9",
LCCN = "QA268 .L48 2000",
bibdate = "Sat Apr 20 11:43:10 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 19.95",
URL = "http://www.loc.gov/catdir/description/cam041/00105256.html;
http://www.loc.gov/catdir/toc/cam041/00105256.html",
acknowledgement = ack-nhfb,
subject = "coding theory; cryptography; mathematics",
}
@Article{Lie:2000:ASC,
author = "David Lie and Chandramohan Thekkath and Mark Mitchell
and Patrick Lincoln and Dan Boneh and John Mitchell and
Mark Horowitz",
title = "Architectural Support for Copy and Tamper Resistant
Software",
journal = j-SIGPLAN,
volume = "35",
number = "11",
pages = "168--177",
month = nov,
year = "2000",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Sun Dec 14 09:18:19 MST 2003",
bibsource = "http://foothill.lcs.mit.edu/asplos2k/program.html;
http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Although there have been attempts to develop code
transformations that yield tamper-resistant software,
no reliable software-only methods are known. This paper
studies the hardware implementation of a form of
execute-only memory (XOM) that allows instructions
stored in memory to be executed there but not otherwise
manipulated. To support XOM code we use a machine that
supports internal compartments --- a process in one
compartment cannot read data from another compartment.
All data that leaves the machine is encrypted, since we
assume external memory is not secure. The design of
this machine poses some interesting tradeoffs between
security, efficient, and flexibility. We explore some
of the potential security issues as one pushes the
machine to become more efficient and flexible. Although
security carries a performance penalty, our analysis
indicates that it is possible to create a normal
multi-tasking machine where nearly all applications can
be run in XOM mode. While a virtual XOM machine is
possible, the underlying hardware needs to support a
unique private key, private memory, and traps on cache
misses. For efficient operation, hardware assist to
provide fast symmetric ciphers is also required.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "cryptography",
}
@Article{Lim:2000:GTC,
author = "Seongan Lim and Seungjoo Kim and Ikkwon Yie and
Hongsub Lee",
booktitle = "Progress in cryptology---INDOCRYPT 2000 (Calcutta)",
title = "A generalized {Takagi}-cryptosystem with a modulus of
the form {$ p^r q^s $}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "283--294",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 847 762",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lin:2000:PAS,
author = "Xiaodong Lin and Johnny W. Wong and Weidong Kou",
title = "Performance Analysis of Secure {Web} Server Based on
{SSL}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "249--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750249.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750249.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lin:2000:RTI,
author = "Phen-Lan Lin",
title = "Robust transparent image watermarking system with
spatial mechanisms",
journal = j-J-SYST-SOFTW,
volume = "50",
number = "2",
pages = "107--116",
day = "15",
month = feb,
year = "2000",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Oct 10 10:06:11 MDT 2000",
bibsource = "http://www.elsevier.com/locate/issn/01641212;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/29/11/49/27/27/article.pdf;
http://www.elsevier.nl/gej-ng/10/29/11/49/27/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lin:2000:TPE,
author = "Chun-Li Lin and Hung-Min Sun and Tzonelih Hwang",
title = "Three-party encrypted key exchange: attacks and a
solution",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "12--20",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Linares:2000:SAM,
author = "Leandro Rodr{\'\i}guez Li{\~n}ares and Carmen
Garc{\'\i}a Mateo",
title = "A Speaker Authentication Module in {TelCorreo}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1902",
pages = "375--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:45 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1902.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1902/19020375.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1902/19020375.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Lindell:2000:PPD,
author = "Yehuda Lindell and Benny Pinkas",
title = "Privacy Preserving Data Mining",
crossref = "Bellare:2000:ACC",
pages = "36--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800036.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800036.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@TechReport{Linn:2000:TMM,
author = "John Linn",
title = "Trust Models and Management in Public-Key
Infrastructures",
type = "Technical report",
institution = pub-RSA,
address = pub-RSA:adr,
pages = "13",
day = "6",
month = nov,
year = "2000",
bibdate = "Wed Jun 06 06:19:54 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "ftp://ftp.rsasecurity.com/pub/pdfs/PKIPaper.pdf",
acknowledgement = ack-nhfb,
}
@Article{Loidreau:2000:SMC,
author = "Pierre Loidreau",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Strengthening {McEliece} cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "585--598",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62 (94B27)",
MRnumber = "2002g:94042",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Lucks:2000:ASR,
author = "Stefan Lucks",
title = "Attacking Seven Rounds of {Rijndael} under 192-bit and
256-bit Keys",
crossref = "NIST:2000:TAE",
pages = "215--229",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{MacAndrew:2000:LPT,
author = "Tim MacAndrew and Robert H. Norman and Jeff Templon
and Kevin W. Wall and Shari Lawrence Pfleeger and
Joseph C. Sligo and Christopher Jack and Terry Ritter",
title = "Letters: Probability Theory and Software Engineering;
Food for Thought; Uncovering Erroneous Assumptions;
{Einstein}'s {Nobel Prize}; Small-Project Process
Improvement; The Truth about Cryptography",
journal = j-COMPUTER,
volume = "33",
number = "2",
pages = "4--8",
month = feb,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Mar 11 09:52:58 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/r2004.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@TechReport{Machado:2000:NCP,
author = "Alexis Warner Machado",
title = "The {Nimbus} cipher: a proposal for {NESSIE}",
type = "Report",
number = "??",
institution = "????",
address = "????",
month = sep,
year = "2000",
bibdate = "Fri Sep 23 05:59:10 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "NESSIE (New European Schemes for Signature, Integrity
and Encryption)",
remark = "I can find this report cited, but no source for it
yet.",
}
@Article{MacKenzie:2000:PAK,
author = "Philip MacKenzie and Sarvar Patel and Ram
Swaminathan",
title = "Password-Authenticated Key Exchange Based on {RSA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "599--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760599.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760599.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maclean:2000:OIG,
author = "Abby Maclean and Stephen M. Matyas and Nevenko Zunic",
title = "Organization Implementation Guidelines for Recovery of
Encrypted Information",
journal = j-COMPUT-SECUR,
volume = "19",
number = "1",
pages = "69--81",
day = "1",
month = jan,
year = "2000",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:38 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404800863658",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Madsen:2000:HCI,
author = "Wayne Madsen",
title = "Health Care Industry Debate: Electronic Versus Digital
Signatures",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "12",
pages = "5--5",
day = "1",
month = dec,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)12013-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800120136",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Madsen:2000:RDU,
author = "Wayne Madsen",
title = "Revised Draft {US} Crypto Export Regulations leaked",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "3",
pages = "8--8",
day = "1",
month = mar,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)88024-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:52 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800880241",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Madsen:2000:WUN,
author = "Wayne Madsen",
title = "{Whitehouse} unveils new cyber-crime, crypto export
policies",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "8",
pages = "7--7",
day = "1",
month = aug,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)08017-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:00 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580008017X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Mazieres:2000:SKM,
author = "David Mazi{\`e}res and Michael Kaminsky and M. Frans
Kaashoek and Emmett Witchel",
title = "Separating key management from file system security",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "19--20",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Merton:2000:NBG,
author = "Orren Merton and Linda Dailey Paulson",
title = "News Briefs: Gamers Jump into Broadband Technology;
{Intel} Has New Chip Design for Handhelds; Patent
Expiration Begins New Encryption Era; Privacy
Organization Raises Privacy Concerns",
journal = j-COMPUTER,
volume = "33",
number = "11",
pages = "16--19",
month = nov,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Nov 7 15:11:30 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/ry016.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Messerges:2000:SAF,
author = "Thomas Messerges",
title = "Securing the {AES} Finalists Against Power Analysis
Attacks (abstract only)",
crossref = "NIST:2000:TAE",
pages = "10--10",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Techniques to protect software implementations of the
AES candidate algorithms from power analysis attacks
are investigated. New countermeasures that employ
random masks are developed and the performance
characteristics of these countermeasures are analyzed.
Implementations in a 32-bit, ARM-based smartcard are
considered.",
acknowledgement = ack-nhfb,
}
@Article{Michener:2000:IWM,
author = "John R. Michener and Tolga Acar",
title = "{Internet} Watch: Managing System and Active-Content
Integrity",
journal = j-COMPUTER,
volume = "33",
number = "7",
pages = "108--110",
month = jul,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Mon Oct 30 17:20:20 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/r7108.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "ActiveX; code signing and verification; cryptography",
}
@Article{Michener:2000:MSA,
author = "John R. Michener and Tolga Acar",
title = "Managing System and Active-Content Integrity",
journal = j-COMPUTER,
volume = "33",
number = "7",
pages = "108--110",
month = jul,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Sat Jul 29 06:05:28 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "ActiveX; code signing and verification; cryptography",
}
@Article{Mitchell:2000:MSN,
author = "Chris J. Mitchell",
title = "Making serial number based authentication robust
against loss of state",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "56--59",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Monrose:2000:KDB,
author = "Fabian Monrose and Aviel D. Rubin",
title = "Keystroke dynamics as a biometric for authentication",
journal = j-FUT-GEN-COMP-SYS,
volume = "16",
number = "4",
pages = "351--359",
month = feb,
year = "2000",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Wed Feb 27 12:41:19 MST 2002",
bibsource = "http://www.elsevier.com/locate/issn/0167739X;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/19/19/41/27/30/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Moriai:2000:PTL,
author = "Shiho Moriai and Serge Vaudenay",
title = "On the Pseudorandomness of Top-Level Schemes of Block
Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "289--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760289.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760289.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Murphy:2000:KST,
author = "S. Murphy",
title = "The Key Separation of {Twofish}",
howpublished = "Comments on AES round 2 submitted to NIST.",
month = mar,
year = "2000",
bibdate = "Mon Oct 16 08:49:21 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Book{Nichols:2000:DYD,
author = "Randall K. Nichols and Daniel J. Ryan and Julie J. C.
H. Ryan",
title = "Defending your digital assets: against hackers,
crackers, spies and thieves",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "xxxv + 858",
year = "2000",
ISBN = "0-07-212285-4",
ISBN-13 = "978-0-07-212285-5",
LCCN = "QA76.9.A25 N528 2000",
bibdate = "Wed Jun 06 18:22:07 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$59.99",
URL = "http://corpitk.earthweb.com/reference/0072122854.html",
acknowledgement = ack-nhfb,
}
@Book{NIST:2000:FPD,
author = "{National Institute of Standards and Technology}",
title = "{FIPS PUB 186-2}: {Digital Signature Standard (DSS)}",
publisher = pub-NIST,
address = pub-NIST:adr,
day = "27",
month = jan,
year = "2000",
bibdate = "Mon Nov 27 09:20:17 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.itl.nist.gov/fipspubs/fip186-2.pdf",
abstract = "This standard specifies a suite of algorithms which
can be used to generate a digital signature. Digital
signatures are used to detect unauthorized
modifications to data and to authenticate the identity
of the signatory. In addition, the recipient of signed
data can use a digital signature in proving to a third
party that the signature was in fact generated by the
signatory. This is known as nonrepudiation since the
signatory cannot, at a later time, repudiate the
signature.",
acknowledgement = ack-nhfb,
keywords = "ADP security; computer security; digital signatures;
Federal Information Processing Standards; public-key
cryptography",
}
@InProceedings{Okamoto:2000:QPK,
author = "Tatsuaki Okamoto and Keisuke Tanaka and Shigenori
Uchiyama",
title = "Quantum Public-Key Cryptosystems",
crossref = "Bellare:2000:ACC",
pages = "147--??",
year = "2000",
MRclass = "94A62 (81P68)",
MRnumber = "2002i:94060",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800147.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800147.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Okeya:2000:PAB,
author = "Katsuyuki Okeya and Kouichi Sakurai",
booktitle = "Progress in cryptology---INDOCRYPT 2000 (Calcutta)",
title = "Power analysis breaks elliptic curve cryptosystems
even secure against the timing attack",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "178--190",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (14G50)",
MRnumber = "2002i:94047",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Olson:2000:SCT,
author = "Adam Olson",
title = "Scaring Crackers Away with {TCP} Wrapper",
journal = j-SYS-ADMIN,
volume = "9",
number = "10",
pages = "67--71",
month = oct,
year = "2000",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Mon Sep 18 08:04:28 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.samag.com/",
abstract = "This article covers how to configure TCP Wrapper so
that crackers probing your network will be afraid to
investigate any further.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Ortiz:2000:ITW,
author = "Sixto {Ortiz Jr.}",
title = "Industry Trends: Will {PKI} Become a Key to Online
Security?",
journal = j-COMPUTER,
volume = "33",
number = "12",
pages = "13--15",
month = dec,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed Dec 6 18:12:09 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/rz013.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "digital certificates; encryption; public key
infrastructure (PKI)",
}
@InProceedings{Osvik:2000:SS,
author = "Dag Arne Osvik",
title = "Speeding up {Serpent}",
crossref = "NIST:2000:TAE",
pages = "317--329",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Park:2000:CAP,
author = "DongGook Park and Colin Boyd and Ed Dawson",
title = "Classification of Authentication Protocols: a
Practical Approach",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "194--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750194.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750194.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Paulson:2000:NBU,
author = "Linda Dailey Paulson and Orren Merton",
title = "News Briefs: {U.S.} Picks New Encryption Standard;
Better Software with Open Source; Taking a {SIP} of
{Internet} Telephony; Schools May Hold Valuable
Spectrum; Getting a Feel for the {Web}",
journal = j-COMPUTER,
volume = "33",
number = "12",
pages = "20--23",
month = dec,
year = "2000",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed Dec 6 18:12:09 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2000/pdf/rz020.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Petrie:2000:NBI,
author = "C. Petrie and J. Connelly",
title = "A noise-based {IC} random number generator for
applications in cryptography",
journal = j-IEEE-J-SOLID-STATE-CIRCUITS,
volume = "47",
number = "5",
pages = "615--621",
month = "????",
year = "2000",
CODEN = "IJSCBC",
DOI = "https://doi.org/10.1109/81.847868",
ISSN = "0018-9200 (print), 1558-173X (electronic)",
ISSN-L = "0018-9200",
bibdate = "Thu Feb 23 08:24:54 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Journal of Solid-State Circuits",
}
@Article{Peyravian:2000:MBB,
author = "Mohammad Peyravian and Stephen M. Matyas and Allen
Roginsky and Nevenko Zunic",
title = "Multiparty Biometric-Based Authentication",
journal = j-COMPUT-SECUR,
volume = "19",
number = "4",
pages = "369--374",
day = "1",
month = apr,
year = "2000",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:39 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404800040256",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Pointcheval:2000:CCS,
author = "David Pointcheval",
booktitle = "Public key cryptography (Melbourne, 2000)",
title = "Chosen-ciphertext security for any one-way
cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1751",
pages = "129--146",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62",
MRnumber = "1 864 776",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Poupard:2000:FER,
author = "Guillaume Poupard and Jacques Stern",
title = "Fair Encryption of {RSA} Keys",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "172--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070172.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070172.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Price:2000:NCH,
author = "Dick Price",
title = "News: {CAIDA} helps train network engineers, 109-bit
cryptographic key cracked, {LosLobos--Linux}
supercluster",
journal = j-IEEE-CONCURR,
volume = "8",
number = "2",
pages = "4--7",
month = apr # "\slash " # jun,
year = "2000",
CODEN = "IECMFX",
ISSN = "1092-3063 (print), 1558-0849 (electronic)",
ISSN-L = "1092-3063",
bibdate = "Fri Oct 13 09:48:42 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/pd/books/pd2000/pdf/p2004.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Concurrency",
}
@InProceedings{Provos:2000:EVM,
author = "Niels Provos",
title = "Encrypting Virtual Machine",
crossref = "USENIX:2000:PNU",
pages = "??--??",
year = "2000",
bibdate = "Wed Oct 16 05:17:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000/provos.html",
acknowledgement = ack-nhfb,
}
@Article{Raikhel:2000:DF,
author = "Eugene Raikhel",
title = "Decoding the Forecast",
journal = j-SCI-AMER,
volume = "283",
number = "3s",
pages = "20--??",
month = mar,
year = "2000",
CODEN = "SCAMAC",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Mon Nov 13 06:19:23 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
OCLC Contents1st database",
abstract = "From ``cold front'' to ``degree days,'' this guide
deciphers the often abstruse terminology of newspaper
and broadcast reports",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
}
@InProceedings{Ramzan:2000:RSS,
author = "Zulfikar Ramzan and Leonid Reyzin",
title = "On the Round Security of Symmetric-Key Cryptographic
Primitives",
crossref = "Bellare:2000:ACC",
pages = "376--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800376.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800376.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Book{Rankl:2000:SCH,
author = "W. (Wolfgang) Rankl and W. Effing",
title = "Smart card handbook",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Second",
pages = "xxviii + 746",
year = "2000",
ISBN = "0-471-98875-8",
ISBN-13 = "978-0-471-98875-5",
LCCN = "TK7895.S62 R3613 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "smart cards --- handbooks, manuals, etc",
}
@Article{Reed:2000:ANA,
author = "Benjamin C. Reed and Edward G. Chron and Randal C.
Burns and Darrell D. E. Long",
title = "Authenticating Network-Attached Storage",
journal = j-IEEE-MICRO,
volume = "20",
number = "1",
pages = "49--57",
month = jan # "\slash " # feb,
year = "2000",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.820053",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Dec 14 06:08:58 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib;
Science Citation Index database (1980--2000)",
URL = "http://dlib.computer.org/mi/books/mi2000/pdf/m1049.pdf;
http://www.computer.org/micro/mi2000/m1049abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Rieffel:2000:IQC,
author = "Eleanor Rieffel and Wolfgang Polak",
title = "An introduction to quantum computing for
non-physicists",
journal = j-COMP-SURV,
volume = "32",
number = "3",
pages = "300--335",
month = sep,
year = "2000",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/367701.367709",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:14:44 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/journals/surveys/2000-32-3/p300-rieffel/p300-rieffel.pdf;
http://www.acm.org/pubs/citations/journals/surveys/2000-32-3/p300-rieffel/",
abstract = "Richard Feynman's observation that certain quantum
mechanical effects cannot be simulated efficiently on a
computer led to speculation that computation in general
could be done more efficiently if it used these quantum
effects. This speculation proved justified when Peter
Shor described a polynomial time quantum algorithm for
factoring integers. \par
In quantum systems, the computational space increases
exponentially with the size of the system, which
enables exponential parallelism. This parallelism could
lead to exponentially faster quantum algorithms than
possible classically. The catch is that accessing the
results, which requires measurement, proves tricky and
requires new nontraditional programming techniques.
\par
The aim of this paper is to guide computer scientists
through the barriers that separate quantum computing
from conventional computing. We introduce basic
principles of quantum mechanics to explain where the
power of quantum computers comes from and why it is
difficult to harness. We describe quantum cryptography,
teleportation, and dense coding. Various approaches to
exploiting the power of quantum parallelism are
explained. We conclude with a discussion of quantum
error correction.",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
generalterms = "Algorithms; Security; Theory",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "complexity; parallelism; quantum computing",
subject = "General Literature --- Introductory and Survey (A.1);
Computer Applications --- Physical Sciences and
Engineering (J.2): {\bf Physics}",
}
@Article{Riezenman:2000:CSB,
author = "M. J. Riezenman",
title = "Cellular security: better, but foes still lurk",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "6",
pages = "39--42",
month = jun,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.846096",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "authentication; Cellular networks; Cellular phones;
cellular radio; cellular security; Cloning; Costs;
Credit cards; electronic commerce; fingerprint
identification; fraud; handset; Instruments; Internet;
RF fingerprinting; Security; security issues; security
of data; service provider subsidies misapplication;
subscription fraud; Subscriptions; Telephone sets; user
identification",
}
@InProceedings{Rivest:2000:RA,
author = "Ronald L. Rivest and M. J. B. Robshaw and Yiqun Lisa
Yin",
title = "{RC6} as the {AES}",
crossref = "NIST:2000:TAE",
pages = "337--342",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Rosen:2000:NRC,
author = "Alon Rosen",
title = "A Note on the Round-Complexity of Concurrent
Zero-Knowledge",
crossref = "Bellare:2000:ACC",
pages = "451--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800451.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800451.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Rosenbaum:2000:SFR,
author = "Ren{\'e} Rosenbaum and Heidrun Schumann",
title = "A Steganographic Framework for Reference Colour Based
Encoding and Cover Image Selection",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "30--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750030.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750030.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Rosenblatt:2000:CBE,
author = "A. Rosenblatt",
title = "{{\booktitle{The code book: the evolution of secrecy
from Mary Queen of Scots to quantum cryptography}}}
[Books]",
journal = j-IEEE-SPECTRUM,
volume = "37",
number = "10",
pages = "10--14",
month = oct,
year = "2000",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2000.873912",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Algorithm design and analysis; Books; Cultural
differences; Data privacy; Frequency; Machine
intelligence; Mathematics; Public key cryptography;
Quantum computing; Statistics",
}
@Manual{Roychowdhury:2000:PCJ,
author = "Vwani P. Roychowdhury",
title = "Practical cryptography: July 24--27, 2000, Engineering
819.311",
publisher = "Dept. of Engineering, Information Systems and
Technical Management, University of California, Los
Angeles",
address = "Los Angeles, CA, USA",
pages = "(various)",
year = "2000",
LCCN = "????",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Manual{RSA:2000:PCP,
author = "{RSA Laboratories}",
title = "{PKCS \#15}: Conformance Profile Specification",
organization = pub-RSA,
address = pub-RSA:adr,
pages = "8",
day = "1",
month = aug,
year = "2000",
bibdate = "Mon Dec 08 08:20:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-15/index.html",
acknowledgement = ack-nhfb,
}
@Misc{RSA:2000:PKC,
author = "{RSA}",
title = "Public-Key Cryptography Standards",
howpublished = "World-Wide Web site.",
year = "2000",
bibdate = "Mon Dec 08 08:03:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/",
acknowledgement = ack-nhfb,
}
@Manual{RSA:2000:PVCa,
author = "{RSA Laboratories}",
title = "{PKCS \#10 v1.7}: Certification Request Syntax
Standard",
organization = pub-RSA,
address = pub-RSA:adr,
pages = "10",
day = "26",
month = may,
year = "2000",
bibdate = "Mon Dec 08 08:20:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-10/index.html",
acknowledgement = ack-nhfb,
}
@Manual{RSA:2000:PVCb,
author = "{RSA Laboratories}",
title = "{PKCS \#15 v1.1}: Cryptographic Token Information
Syntax Standard",
organization = pub-RSA,
address = pub-RSA:adr,
pages = "81",
day = "6",
month = jun,
year = "2000",
bibdate = "Mon Dec 08 08:20:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-15/index.html",
acknowledgement = ack-nhfb,
}
@Manual{RSA:2000:PVS,
author = "{RSA Laboratories}",
title = "{PKCS \#9 v2.0}: Selected Object Classes and Attribute
Types",
organization = pub-RSA,
address = pub-RSA:adr,
pages = "34",
day = "25",
month = feb,
year = "2000",
bibdate = "Mon Dec 08 08:20:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-9/index.html",
acknowledgement = ack-nhfb,
}
@Article{Rubin:2000:KVL,
author = "Aviel D. Rubin",
title = "{Kerberos} Versus the {Leighton-Micali} Protocol",
journal = j-DDJ,
volume = "25",
number = "11",
pages = "21--22, 24, 26",
month = nov,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Nov 8 15:09:25 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Although more complicated, the Leighton-Micali
protocol is more elegant, efficient, and secure than
the venerable Kerberos security protocol.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Ryutov:2000:RESa,
author = "Tatyana Ryutov and Clifford Neuman",
title = "Representation and evaluation of security policies",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "34--34",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Ryutov:2000:RESb,
author = "Tatyana Ryutov and Clifford Neuman",
title = "Representation and evaluation of security policies
(poster session)",
journal = j-OPER-SYS-REV,
volume = "34",
number = "2",
pages = "41--41",
month = apr,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Saeednia:2000:HMB,
author = "Shahrokh Saeednia",
title = "How to maintain both privacy and authentication in
digital libraries",
journal = j-INT-J-DIGIT-LIBR,
volume = "2",
number = "4",
pages = "251--258",
month = may,
year = "2000",
CODEN = "????",
DOI = "https://doi.org/10.1007/PL00021469",
ISSN = "1432-1300 (print), 1432-5012 (electronic)",
ISSN-L = "1432-1300",
bibdate = "Tue May 7 07:43:18 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/intjdigitlibr.bib",
URL = "https://link.springer.com/article/10.1007/PL00021469",
acknowledgement = ack-nhfb,
ajournal = "Int. J. Digit. Libr.",
fjournal = "International Journal on Digital Libraries",
journal-URL = "https://link.springer.com/journal/799",
}
@InProceedings{Safavi-Naini:2000:STT,
author = "Reihaneh Safavi-Naini and Yejing Wang",
title = "Sequential Traitor Tracing",
crossref = "Bellare:2000:ACC",
pages = "316--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800316.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800316.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Sakai:2000:NDS,
author = "Hideaki Sakai and Noriko Nakamura and Yoshihide
Igarashi",
title = "A new definition of semantic security for public-key
encryption schemes",
journal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
volume = "1148",
pages = "112--117",
year = "2000",
MRclass = "94A62",
MRnumber = "1 799 822",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
note = "Theoretical foundations of computer science: toward a
paradigm for computing in the 21st century (Japanese)
(Kyoto, 2000)",
fjournal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
}
@InCollection{Sale:2000:CBP,
author = "Anthony E. Sale",
title = "The {Colossus of Bletchley Park}: the {German} cipher
system",
crossref = "Rojas:2000:FCH",
pages = "351--364",
year = "2000",
bibdate = "Sat Nov 20 21:08:08 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Sale:2000:CGL,
author = "Anthony E. Sale",
title = "{Colossus} and the {German Lorenz} Cipher --- Code
Breaking in {WW II}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "417--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070417.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070417.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Sano:2000:PEA,
author = "Fumihiko Sano and Masanobu Koike and Shinichi Kawamura
and Masue Shiba",
title = "Performance Evaluation of {AES} Finalists on the
High-End {Smart Card}",
crossref = "NIST:2000:TAE",
pages = "82--93",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Sarkar:2000:CNB,
author = "Palash Sarkar and Subhamoy Maitra",
title = "Construction of Nonlinear {Boolean} Functions with
Important Cryptographic Properties",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "485--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070485.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070485.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Sarkar:2000:NBC,
author = "Palash Sarkar and Subhamoy Maitra",
title = "Nonlinearity Bounds and Constructions of Resilient
{Boolean} Functions",
crossref = "Bellare:2000:ACC",
pages = "515--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800515.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800515.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Satoh:2000:HSM,
author = "Akashi Satoh and Nobuyuki Ooba and Kohji Takano and
Edward D'Avignon",
title = "High-Speed {MARS} Hardware",
crossref = "NIST:2000:TAE",
pages = "305--316",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Schneier:2000:AAR,
author = "Bruce Schneier",
title = "Abstracts of {AES}-related Papers from the {Fast
Software Encryption Workshop (FSE) 2000}",
crossref = "NIST:2000:TAE",
pages = "9--10",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Schneier:2000:CTA,
author = "Bruce Schneier and John Kelsey and Doug Whiting and
David Wagner and Niels Ferguson",
title = "Comments on {Twofish} as an {AES} Candidate",
crossref = "NIST:2000:TAE",
pages = "355--356",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Schneier:2000:IRS,
author = "Bruce Schneier",
title = "Inside risks: semantic network attacks",
journal = j-CACM,
volume = "43",
number = "12",
pages = "168--168",
month = dec,
year = "2000",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Feb 05 16:53:17 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See letters
\cite{Crawford:2001:FHC,Crawford:2001:FPV}.",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2000-43-12/p168-schneier/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Schneier:2000:PCF,
author = "Bruce Schneier and Doug Whiting",
title = "A Performance Comparison of the Five {AES} Finalists",
crossref = "NIST:2000:TAE",
pages = "123--135",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Schneier:2000:SLD,
author = "Bruce Schneier",
title = "Secrets and Lies: Digital Security in a Networked
World",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xv + 412",
year = "2000",
ISBN = "0-471-25311-1",
ISBN-13 = "978-0-471-25311-2",
LCCN = "QA76.9.A25 S352 2000",
bibdate = "Wed Sep 20 16:28:33 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$29.99",
acknowledgement = ack-nhfb,
}
@Article{Schneier:2000:SRF,
author = "Bruce Schneier",
title = "Security Research and the Future",
journal = j-DDJ,
volume = "25",
number = "12 (supplement)",
pages = "33--35",
month = dec,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Nov 08 18:09:45 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "cryptography",
}
@InCollection{Schnorr:2000:SSE,
author = "Claus Peter Schnorr and Markus Jakobsson",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Security of Signed {ElGamal} Encryption",
volume = "1976",
publisher = pub-SV,
address = pub-SV:adr,
pages = "73--89",
year = "2000",
MRclass = "94A60",
MRnumber = "2002h:94067",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1976.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1976/19760073.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1976/19760073.pdf",
}
@Book{Sebag-Montefiore:2000:EBC,
author = "Hugh Sebag-Montefiore",
title = "{Enigma}: the battle for the code",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "x + 422",
year = "2000",
ISBN = "0-471-40738-0 (cloth)",
ISBN-13 = "978-0-471-40738-6 (cloth)",
LCCN = "D810.C88 S43 2000",
bibdate = "Sat Dec 17 17:34:41 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/wiley043/00043920.html;
http://www.loc.gov/catdir/description/wiley035/00043920.html;
http://www.loc.gov/catdir/toc/onix06/00043920.html",
acknowledgement = ack-nhfb,
subject = "Enigma cipher system; History; World War, 1939--1945;
Cryptography",
}
@Article{Sebe:2000:SDI,
author = "Francesc Seb{\'e} and Josep Domingo-Ferrer and Jordi
Herrera",
title = "Spatial-Domain Image Watermarking Robust against
Compression, Filtering, Cropping and Scaling",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "44--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750044.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750044.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Seifried:2000:C,
author = "Kurt Seifried",
title = "{Crypto 101}",
journal = j-SYS-ADMIN,
volume = "9",
number = "5",
pages = "16, 20, 22, 24, 26--27",
month = may,
year = "2000",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Wed Apr 26 16:13:37 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.samag.com/",
abstract = "Seifried provides an overview of cryptography and an
introduction to Open Source cryptographic software.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Seifried:2000:PPA,
author = "Kurt Seifried",
title = "{PAM} --- {Pluggable Authentication Modules}",
journal = j-SYS-ADMIN,
volume = "9",
number = "9",
pages = "8, 10, 12, 14",
month = sep,
year = "2000",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Wed Oct 18 18:03:13 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.samag.com/",
abstract = "PAM provides the backbone of most authentication in
modern Linux systems, yet it is typically ignored and
underutilized. Seifried explains how it works.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Selcuk:2000:BEL,
author = "Ali Ayd{\i}n Sel{\c{c}}uk",
booktitle = "Progress in cryptology---INDOCRYPT 2000 (Calcutta)",
title = "On bias estimation in linear cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "52--66",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "2002h:94068",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Semanko:2000:CAA,
author = "Michael Semanko",
title = "{L}-collision Attacks against Randomized {MACs}",
crossref = "Bellare:2000:ACC",
pages = "216--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800216.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800216.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InCollection{Shin:2000:ANT,
author = "Sang Uk Shin and Kyung Hyune Rhee",
booktitle = "Public key cryptography (Melbourne, 2000)",
title = "All-or-nothing transform and remotely keyed encryption
protocols",
volume = "1751",
publisher = pub-SV,
address = pub-SV:adr,
pages = "178--195",
year = "2000",
MRclass = "94A60",
MRnumber = "1 864 779",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
}
@Article{Shoup:2000:CTU,
author = "Victor Shoup",
title = "A Composition Theorem for Universal One-Way Hash
Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "445--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070445.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070445.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shoup:2000:UHF,
author = "Victor Shoup",
title = "Using Hash Functions as a Hedge against Chosen
Ciphertext Attack",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1807",
pages = "275--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1807.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1807/18070275.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1807/18070275.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Singh:2000:CBE,
author = "Simon Singh",
title = "The code book: the evolution of secrecy from Ancient
{Egypt} to quantum cryptography",
publisher = pub-ANCHOR,
address = pub-ANCHOR:adr,
pages = "xvii + 411",
year = "2000",
ISBN = "0-385-49532-3",
ISBN-13 = "978-0-385-49532-5",
LCCN = "Z103 .S56 1999",
bibdate = "Mon Dec 06 16:25:40 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See also \cite{Almgren:2000:HWC}.",
price = "US\$15.00",
acknowledgement = ack-nhfb,
xxnote = "Check year: some catalogs have 1999, others 2000.
Check publisher: some have Anchor Books, others
Delacorte Press. See also
\cite{Singh:1999:CBE,Singh:2002:CBH}.",
}
@Article{Smith:2000:ABS,
author = "Tim Smith",
title = "Authentication by biometric smart card",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "6",
pages = "5--5",
day = "1",
month = jun,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)06011-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:57 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800060116",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Smith:2000:CIR,
author = "Michael Smith and Paul {Van Oorschot} and Michael
Willett",
title = "Cryptographic Information Recovery Using Key
Recovery",
journal = j-COMPUT-SECUR,
volume = "19",
number = "1",
pages = "21--27",
day = "1",
month = jan,
year = "2000",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:38 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404800863580",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Song:2000:TPA,
author = "Boyeon Song and Kwangjo Kim",
title = "Two-Pass Authenticated Key Agreement Protocol with Key
Confirmation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1977",
pages = "237--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1977.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1977/19770237.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1977/19770237.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sonntag:2000:MAS,
author = "Michael Sonntag and Rudolf H{\"o}rmanseder",
title = "Mobile agent security based on payment",
journal = j-OPER-SYS-REV,
volume = "34",
number = "4",
pages = "48--55",
month = oct,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@TechReport{Soto:2000:RTA,
author = "Juan Soto and Lawrence E. Bassham",
title = "Randomness Testing of the {Advanced Encryption
Standard} Finalist Candidates",
type = "NIST internal report",
number = "6483",
institution = pub-NIST,
address = pub-NIST:adr,
month = apr,
year = "2000",
LCCN = "DOC C 13.58:6483 mf11 Microcopy",
bibdate = "Mon Dec 08 07:51:45 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "NISTIR",
URL = "http://csrc.nist.gov/rng/aes-report-final.doc",
acknowledgement = ack-nhfb,
keywords = "data encryption (computer science)",
}
@Article{Stallings:2000:SSC,
author = "William Stallings",
title = "The {SET Standard} and {E}-Commerce",
journal = j-DDJ,
volume = "25",
number = "11",
pages = "30, 32, 34, 36",
month = nov,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Wed Nov 8 15:09:25 MST 2000",
bibsource = "http://www.ddj.com/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The Secure Electronic Transaction (SET) is an open
encryption and security specification designed to
protect credit-card transactions on the Internet.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@InProceedings{Steinwandt:2000:WHS,
author = "Rainer Steinwandt and Markus Grassl and Willi
Geiselmann and Thomas Beth",
title = "Weaknesses in the $ \mathrm {SL}_2 (\bbb {F}_{2^n}) $
Hashing Scheme",
crossref = "Bellare:2000:ACC",
pages = "287--299",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800287.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800287.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@InProceedings{Sterbenz:2000:PAC,
author = "Andreas Sterbenz and Peter Lipp",
title = "Performance of the {AES} Candidate Algorithms in
{Java}",
crossref = "NIST:2000:TAE",
pages = "161--168",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Sterlicchi:2000:SCD,
author = "John Sterlicchi",
title = "Software companies disappointed by encryption draft",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "1",
pages = "4--4",
month = jan,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)86647-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:49 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800866477",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{StPierre:2000:TFA,
author = "Jim {St. Pierre}",
title = "Two-factor authentication added to {PKI} solutions",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "5",
pages = "6--6",
day = "1",
month = may,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)05018-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800050182",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Sugita:2000:RAD,
author = "Makoto Sugita and Kazukuni Kobara and Kazuhiro Uehara
and Shuji Kubota and Hideki Imai",
title = "Relationships among Differential, Truncated
Differential, Impossible Differential Cryptanalyses
against Word-Oriented Block Ciphers like {RIJNDAEL},
{E2}",
crossref = "NIST:2000:TAE",
pages = "242--256",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Sun:2000:AFA,
author = "Yongxing Sun and Xinmei Wang",
title = "An approach to finding the attacks on the
cryptographic protocols",
journal = j-OPER-SYS-REV,
volume = "34",
number = "3",
pages = "19--28",
month = jul,
year = "2000",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:47 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Sun:2000:DRR,
author = "H.-M.-Min Sun",
title = "On the Dealer's Randomness Required in Perfect Secret
Sharing Schemes with Access Structures of Constant
Rank",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "11",
number = "2",
pages = "263--282",
year = "2000",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:49 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/;
http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
OCLC Article1st database",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Sun:2000:ESM,
author = "Hung-Min Sun",
title = "Enhancing the security of the {McEliece} public-key
cryptosystem",
journal = j-J-INFO-SCI-ENG,
volume = "16",
number = "6",
pages = "799--812",
year = "2000",
CODEN = "JINEEY",
ISSN = "1016-2364",
MRclass = "94A62",
MRnumber = "2001m:94050",
MRreviewer = "J. D{\'e}nes",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "JISE. Journal of Information Science and Engineering",
}
@Article{Sung:2000:PSS,
author = "Jaechul Sung and Sangjin Lee and Jongin Lim and
Seokhie Hong and Sangjoon Park",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Provable security for the {Skipjack}-like structure
against differential cryptanalysis and linear
cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "274--288",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "2002h:94069",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Susilo:2000:NEF,
author = "Willy Susilo and Rei Safavi-Naini and Marc Gysin and
Jennifer Seberry",
title = "A New and Efficient Fail-stop Signature Scheme",
journal = j-COMP-J,
volume = "43",
number = "5",
pages = "430--437",
month = "????",
year = "2000",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sat Dec 23 14:12:23 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_05/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_05/430430.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_05/pdf/430430.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Syed:2000:CLA,
author = "Furqan Syed",
title = "Children of {DES}: a Look at the {Advanced Encryption
Standard}",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "9",
pages = "11--12",
day = "1",
month = sep,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)09026-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800090267",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Tahir:2000:RCM,
author = "Farasat Tahir and Muhammad Tahir",
title = "{RSA} ciphers with {Maple}",
journal = "Punjab Univ. J. Math. (Lahore)",
volume = "33",
pages = "145--152",
year = "2000",
ISSN = "1016-2526",
MRclass = "94A60",
MRnumber = "MR1895055",
bibdate = "Sat Apr 16 17:32:47 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "The Punjab University. Journal of Mathematics",
}
@InProceedings{Takano:2000:PTH,
author = "Kohji Takano and Akashi Satoh and Nobuyuki Ohba",
title = "Poster 5: {TATSU} --- Hardware Accelerator for
Public-Key Cryptography Using {Montgomery} Method",
crossref = "Anonymous:2000:CCI",
pages = "??--??",
year = "2000",
bibdate = "Mon Jan 08 05:28:04 2001",
bibsource = "http://www.coolchips.org/index-cool3.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Tao:2000:ITF,
author = "Renji Tao and Shihua Chen",
title = "Input-trees of finite automata and application to
cryptanalysis",
journal = "J. Comput. Sci. Tech.",
volume = "15",
number = "4",
pages = "305--325",
year = "2000",
CODEN = "JCTEEM",
ISSN = "1000-9000",
MRclass = "68Q45 (94A60)",
MRnumber = "2001e:68108",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Journal of Computer Science and Technology",
}
@Article{Tochikubo:2000:RAE,
author = "Kouya Tochikubo and Koji Okada and Naoki Endoh and
Eiji Okamoto",
title = "Renewable authentication and encryption systems",
journal = j-TRANS-INFO-PROCESSING-SOC-JAPAN,
volume = "41",
number = "8",
pages = "2121--2127",
year = "2000",
CODEN = "JSGRD5",
ISSN = "0387-5806",
ISSN-L = "0387-5806",
MRclass = "94A62",
MRnumber = "2001i:94066",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "IPSJ Journal",
}
@Article{Totsch:2000:MSS,
author = "David Totsch",
title = "Managing {SUID\slash SGID} Files",
journal = j-SYS-ADMIN,
volume = "9",
number = "9",
pages = "60, 62--63, 65",
month = sep,
year = "2000",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Wed Oct 18 18:03:13 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.samag.com/",
abstract = "Normally, the SUID bit gives ordinary users the
ability to perform functions like changing their own
passwords. However, a cracker may expend significant
effort to set the same bit on a covert copy of a shell.
As admins, we need to discern between the mild mannered
and sinister files.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Tousidou:2000:IMS,
author = "Eleni Tousidou and Alex Nanopoulos and Yannis
Manolopoulos",
title = "Improved Methods for Signature-Tree Construction",
journal = j-COMP-J,
volume = "43",
number = "4",
pages = "301--314",
month = "????",
year = "2000",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 14 07:02:08 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_04/430301.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_04/pdf/430301.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Ulfving:2000:GS,
author = "Lars Ulfving and Frode Weierud",
title = "The {Geheimschreiber} Secret",
crossref = "Joyner:2000:CTC",
pages = "??--??",
year = "2000",
bibdate = "Mon Nov 07 18:23:52 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{USC:2000:HRS,
author = "{United States Congress}",
title = "{H.R. 850, the Security and Freedom through Encryption
(SAFE) Act: Markup before the Committee on
International Relations, House of Representatives, One
Hundred Sixth Congress, first session, Tuesday, July
13, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
pages = "iii + 102",
year = "2000",
ISBN = "0-16-060340-4, 0-16-060340-4",
ISBN-13 = "978-0-16-060340-2, 978-0-16-060340-2",
LCCN = "KF27.I53 106th",
bibdate = "Wed Sep 28 08:32:47 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Manual{USHCAS:2000:UEP,
author = "{United States Congress.House Committee on Armed
Services}",
title = "{U.S.} encryption policy: hearing before the
{Committee on Armed Services, House of Representatives,
One Hundred Sixth Congress, first session: hearings
held July 1, 13, 1999}",
number = "H.A.S.C. no. 106-16",
publisher = pub-USGPO,
address = pub-USGPO:adr,
pages = "iv + 195",
year = "2000",
ISBN = "0-16-060018-9",
ISBN-13 = "978-0-16-060018-0",
LCCN = "Y 4.AR 5/2 A:999-2000/16 Govt Pub; J61 .A752 106th
no.16",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "H.A.S.C. no. 106-16.",
acknowledgement = ack-nhfb,
keywords = "computer software --- law and legislation --- United
States; computers --- access control --- United States;
data encryption (computer science) --- law and
legislation --- United States; export controls ---
United States; national security --- United States",
}
@Manual{USHCIR:2000:ESH,
author = "{United States Congress.House Committee on
International Relations.Subcommittee on International
Economic Policy and Trade}",
title = "{Encryption security in a high tech era: hearing
before the Subcommittee on International Economic
Policy and Trade of the Committee on International
Relations, House of Representatives, One Hundred Sixth
Congress, first session, Tuesday, May 18, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
pages = "iii + 60",
year = "2000",
ISBN = "0-16-060699-3",
ISBN-13 = "978-0-16-060699-1",
LCCN = "KF27.I53 106th",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Serial no. 106-108. Shipping list no.: 2000-0319-P.",
acknowledgement = ack-nhfb,
keywords = "computers --- access control --- United States; data
encryption (computer science) --- United States; export
controls --- United States",
}
@Manual{USHCIR:2000:HES,
author = "{United States Congress.House Committee on
International Relations}",
title = "{106-1 Hearing: Encryption Security in a High Tech
Era, May 18, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
year = "2000",
LCCN = "DOC Y 4.IN 8/16:SE 2/9 Gov Info Stacks",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Shipping List \#: 2000-0319-P. Shipping List Date:
07/31/2000.",
acknowledgement = ack-nhfb,
}
@Manual{USHCIR:2000:HSF,
author = "{United States Congress.House Committee on
International Relations}",
title = "{H.R. 850, the Security and Freedom through Encryption
(SAFE) Act: markup before the Committee on
International Relations, House of Representatives, One
Hundred Sixth Congress, first session, Tuesday, July
13, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
pages = "iii + 102",
year = "2000",
ISBN = "0-16-060340-4",
ISBN-13 = "978-0-16-060340-2",
LCCN = "KF27.I53 106th",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Shipping list no.: 2000-0214-P",
acknowledgement = ack-nhfb,
keywords = "computer software --- law and legislation --- United
States; computers --- access control --- United States;
data encryption (computer science) --- law and
legislation --- United States; export controls ---
United States",
}
@Manual{USHCIR:2000:MHS,
author = "{United States Congress.House Committee on
International Relations}",
title = "{106-1 Markup: H.R. 850, The Security And Freedom
Through Encryption (SAFE) Act, July 13, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
year = "2000",
LCCN = "Y 4.IN 8/16:SE 2/4/999 Gov Pubs US Docs",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Shipping List \#: 2000-0214-P. Shipping List Date:
04/20/2000.",
acknowledgement = ack-nhfb,
}
@Manual{USHCJ:2000:HSF,
author = "{United States Congress.House Committee on the
Judiciary}",
title = "{106-1 Hearing: Security And Freedom Through
Encryption, (SAFE) Act, Serial No. 34, March 4, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
year = "2000",
LCCN = "Y 4.J 89/1:106/34 Gov Pubs US Docs",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Shipping List \#: 2000-0275-P. Shipping List Date:
06/21/2000.",
acknowledgement = ack-nhfb,
}
@Manual{USHCJ:2000:SFT,
author = "{United States Congress.House Committee on the
Judiciary.Subcommittee on Courts and Intellectual
Property}",
title = "{Security and Freedom through Encryption (SAFE) Act:
hearing before the Subcommittee on Courts and
Intellectual Property of the Committee on the
Judiciary, House of Representatives, One Hundred Sixth
Congress, first session, on H.R. 850, March 4, 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
pages = "iv + 169",
year = "2000",
ISBN = "0-16-060600-4",
ISBN-13 = "978-0-16-060600-7",
LCCN = "KF27.J8 106th",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Serial no. 34. Shipping list no.: 2000-0275-P",
acknowledgement = ack-nhfb,
keywords = "computer software --- law and legislation --- United
States; computers --- access control --- United States;
data encryption (computer science) --- law and
legislation --- United States; export controls ---
United States",
}
@Book{vanTilborg:2000:FCP,
author = "Henk C. A. van Tilborg",
title = "Fundamentals of cryptology: a professional reference
and interactive tutorial",
volume = "SECS 528",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xiv + 490",
year = "2000",
ISBN = "0-7923-8675-2",
ISBN-13 = "978-0-7923-8675-9",
LCCN = "QA76.9.A25 T53 2000 Accompanying CD-Rom shelved in
Reserves",
bibdate = "Mon Oct 16 09:48:58 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "The Kluwer international series in engineering and
computer science",
acknowledgement = ack-nhfb,
annote = "Updated and improved version of ``An introduction to
cryptology''. 1988. Accompanied by a full text
electronic version on CD-ROM as an interactive
Mathematica manuscript.",
keywords = "computers --- access control; cryptography",
}
@Article{Wagner:2000:CYL,
author = "David Wagner",
booktitle = "Advances in cryptology---ASIACRYPT 2000 (Kyoto)",
title = "Cryptanalysis of the {Yi-Lam} hash",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1976",
pages = "483--488",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "2002h:94071",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wallach:2000:SSM,
author = "Dan S. Wallach and Andrew W. Appel and Edward W.
Felten",
title = "{SAFKASI}: a security mechanism for language-based
systems",
journal = j-TOSEM,
volume = "9",
number = "4",
pages = "341--378",
month = oct,
year = "2000",
CODEN = "ATSMER",
ISSN = "1049-331X (print), 1557-7392 (electronic)",
ISSN-L = "1049-331X",
bibdate = "Fri Apr 20 08:21:35 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tosem.bib",
URL = "http://www.acm.org/pubs/articles/journals/tosem/2000-9-4/p341-wallach/p341-wallach.pdf;
http://www.acm.org/pubs/citations/journals/tosem/2000-9-4/p341-wallach/",
abstract = "In order to run untrusted code in the same process as
trusted code, there must be a mechanism to allow
dangerous calls to determine if their caller is
authorized to exercise the privilege of using the
dangerous routine. Java systems have adopted a
technique called stack inspection to address this
concern. But its original definition, in terms of
searching stack frames, had an unclear relationship to
the actual achievement of security, overconstrained the
implementation of a Java system, limited many desirable
optimizations such as method inlining and tail
recursion, and generally interfered with
interprocedural optimization. We present a new
semantics for stack inspection based on a belief logic
and its implementation using the calculus of {\em
security-passing style\/} which addresses the concerns
of traditional stack inspection. With security-passing
style, we can efficiently represent the security
context for any method activation, and we can build a
new implementation strictly by rewriting the Java
bytecodes before they are loaded by the system. No
changes to the JVM or bytecode semantics are necessary.
With a combination of static analysis and runtime
optimizations, our prototype implementation shows
reasonable performance (although traditional stack
inspection is still faster), and is easier to consider
for languages beyond Java. We call our system SAFKASI
(the Security Architecture Formerly Known as Stack
Inspection).",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Software Engineering and
Methodology",
generalterms = "Design; Languages; Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J790",
keywords = "access control; applets; Internet; Java;
security-passing style; stack inspection; WWW",
subject = "Software --- Programming Techniques ---
Object-oriented Programming (D.1.5); Software ---
Software Engineering --- General (D.2.0): {\bf
Protection mechanisms}; Software --- Programming
Languages --- Language Classifications (D.3.2): {\bf
Object-oriented languages}; Software --- Operating
Systems --- Security and Protection (D.4.6): {\bf
Access controls}; Software --- Operating Systems ---
Security and Protection (D.4.6): {\bf Authentication}",
}
@Article{Walsh:2000:BRM,
author = "Gary Walsh",
title = "Book review: {{\em The Mathematics of Ciphers, Number
Theory and RSA Cryptography}}",
journal = j-MATH-COMPUT,
volume = "69",
number = "231",
pages = "1314--1315",
month = jul,
year = "2000",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Nov 1 11:50:05 MST 2000",
bibsource = "http://www.ams.org/mcom/2000-69-231;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/mcom/2000-69-231/S0025-5718-00-01249-7/bookrev-S0025-5718-00-01249-7.html;
http://www.ams.org/mcom/2000-69-231/S0025-5718-00-01249-7/S0025-5718-00-01249-7.dvi;
http://www.ams.org/mcom/2000-69-231/S0025-5718-00-01249-7/S0025-5718-00-01249-7.pdf;
http://www.ams.org/mcom/2000-69-231/S0025-5718-00-01249-7/S0025-5718-00-01249-7.ps;
http://www.ams.org/mcom/2000-69-231/S0025-5718-00-01249-7/S0025-5718-00-01249-7.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@InCollection{Wardlaw:2000:RPK,
author = "William P. Wardlaw",
booktitle = "Coding theory and cryptography (Annapolis, MD, 1998)",
title = "The {RSA} public key cryptosystem",
publisher = pub-SV,
address = pub-SV:adr,
pages = "101--123",
year = "2000",
MRclass = "94A60",
MRnumber = "1 749 520",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
}
@InProceedings{Weaver:2000:CAC,
author = "Nicholas Weaver and John Wawrzynek",
title = "A Comparison of the {AES} Candidates Amenability to
{FPGA} Implementation",
crossref = "NIST:2000:TAE",
pages = "28--39",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Weeks:2000:HPS,
author = "Bryan Weeks and Mark Bean and Tom Rozylowicz and Chris
Ficke",
title = "Hardware Performance Simulations of Round 2 {Advanced
Encryption Standard} Algorithms",
crossref = "NIST:2000:TAE",
pages = "286--304",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Wehde:2000:IME,
author = "Ed Wehde",
title = "{IBM}, {Microsoft} in encryption effort",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "2",
pages = "5--5",
day = "1",
month = feb,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)87654-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:51 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800876540",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Weierud:2000:SFB,
author = "Frode Weierud",
title = "{Sturgeon}, The {FISH BP} Never Really Caught",
crossref = "Joyner:2000:CTC",
pages = "??--??",
year = "2000",
bibdate = "Mon Nov 07 18:24:29 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Weiss:2000:CAC,
author = "Richard Weiss and Nathan Binkert",
title = "A comparison of {AES} candidates on the {Alpha
21264}",
crossref = "NIST:2000:TAE",
pages = "75--81",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Wiener:2000:AAH,
author = "Michael J. Wiener",
title = "Algorithm Alley: High-Speed Cryptography with the
{RSA} Algorithm",
journal = j-DDJ,
volume = "25",
number = "2",
pages = "123--126",
month = feb,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:13 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2000/2000_02/aa220.txt",
abstract = "Michael presents some key optimizations (with
source-code examples) that can be made to make RSA
algorithm as fast as possible. Additional resources
include aa220.txt (listings).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Book{Winterbotham:2000:USI,
author = "F. W. (Frederick William) Winterbotham",
title = "The {Ultra} secret: the inside story of {Operation
Ultra}, {Bletchley Park} and {Enigma}",
publisher = "Orion",
address = "London, UK",
pages = "xv + 199",
year = "2000",
ISBN = "0-7528-3751-6",
ISBN-13 = "978-0-7528-3751-2",
LCCN = "????",
bibdate = "Mon Sep 3 18:06:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.ox.ac.uk:210/ADVANCE",
acknowledgement = ack-nhfb,
author-dates = "1897--1990",
remark = "Originally published: London: Weidenfeld and Nicolson,
1974.",
subject = "World War, 1939-1945; Electronic intelligence; Great
Britain; Secret service; Cryptography",
}
@InProceedings{Wollinger:2000:HWH,
author = "Thomas J. Wollinger and Min Wang and Jorge Guajardo
and Christof Paar",
title = "How Well Are High-End {DSPs} Suited for the {AES}
Algorithms? {AES} Algorithms on the {TMS320C6x DSP}",
crossref = "NIST:2000:TAE",
pages = "94--105",
year = "2000",
bibdate = "Wed Feb 07 19:03:41 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Wong:2000:SGC,
author = "Chung Kei Wong and Mohamed Gouda and Simon S. Lam",
title = "Secure group communications using key graphs",
journal = j-IEEE-TRANS-NETWORKING,
volume = "8",
number = "1",
pages = "16--30",
month = feb,
year = "2000",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/90.836475",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Oct 28 17:15:07 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/ton/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/ton/2000-8-1/p16-wong/",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "confidentiality; group communications; group key
management; key distribution; multicast; privacy;
rekeying; security",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- General (C.2.0):
{\bf Security and protection (e.g., firewalls)}",
}
@Article{Wool:2000:KME,
author = "Avishai Wool",
title = "Key Management for Encrypted Broadcast",
journal = j-TISSEC,
volume = "3",
number = "2",
pages = "107--134",
month = may,
year = "2000",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 25 16:47:22 MST 2002",
bibsource = "http://www.acm.org/tissec/v3no2.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Worley:2000:AFP,
author = "John Worley and Bill Worley and Tom Christian and
Christopher Worley",
title = "{AES} Finalists on {PA-RISC} and {IA-64}:
Implementations {\&} Performance",
crossref = "NIST:2000:TAE",
pages = "57--74",
year = "2000",
bibdate = "Tue Jan 23 13:29:28 MST 2001",
bibsource = "http://dblp.uni-trier.de/db/conf/aes/aes2000.html#WorleyWCW00;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/qc.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
oldlabel = "WorleyWCW00",
XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/aes/WorleyWCW00",
}
@Article{Wright:2000:IQC,
author = "Marie A. Wright",
title = "The Impact of Quantum Computing on Cryptography",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "9",
pages = "13--15",
day = "1",
month = sep,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)09027-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485800090279",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Wu:2000:PKC,
author = "Chuan-Kun Wu and Vijay Varadharajan",
title = "Public key cryptosystems based on {Boolean}
permutations and their applications",
journal = j-INT-J-COMPUT-MATH,
volume = "74",
number = "2",
pages = "167--184",
year = "2000",
CODEN = "IJCMAT",
ISSN = "0020-7160",
ISSN-L = "0020-7160",
MRclass = "94A60",
MRnumber = "2001a:94027",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "International Journal of Computer Mathematics",
}
@Article{Yamamura:2000:QCB,
author = "Akihiro Yamamura and Hirokazu Ishizuka",
title = "Quantum cryptanalysis of block ciphers",
journal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
volume = "1166",
pages = "235--243",
year = "2000",
MRclass = "81P68 (94A60)",
MRnumber = "1 805 390",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Algebraic systems, formal languages and computations
(Japanese) (Kyoto, 2000)",
fjournal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
}
@Book{Yan:2000:NTC,
author = "S. Y. Yan",
title = "Number Theory for Computing",
publisher = pub-SV,
address = pub-SV:adr,
pages = "256 (est.)",
year = "2000",
ISBN = "0-387-65472-0",
ISBN-13 = "978-0-387-65472-0",
LCCN = "????",
bibdate = "Wed Mar 14 08:32:42 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$46.00",
acknowledgement = ack-nhfb,
keywords = "cryptography; discrete logarithms; elliptic curves",
}
@Article{Yen:2000:CBO,
author = "Sung-Ming Yen and M. Joye",
title = "Checking before output may not be enough against
fault-based cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "49",
number = "9",
pages = "967--970",
month = sep,
year = "2000",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.869328",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 10:35:25 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=869328",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Yen:2000:WOW,
author = "Sung-Ming Yen and Yuliang Zheng",
title = "Weighted One-Way Hash Chain and Its Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1975",
pages = "135--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:57 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1975.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1975/19750135.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1975/19750135.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Young:2000:RBA,
author = "Adam Young and Moti Yung",
booktitle = "Public key cryptography (Melbourne, 2000)",
title = "{RSA}-based auto-recoverable cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1751",
pages = "326--341",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62",
MRnumber = "2002h:94088",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zafar:2000:ACB,
author = "Naeem Zafar",
title = "Authentication company buys smart card firm",
journal = j-NETWORK-SECURITY,
volume = "2000",
number = "5",
pages = "4--5",
day = "1",
month = may,
year = "2000",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(00)05011-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:57:55 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580005011X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Zeadally:2000:IPQ,
author = "S. Zeadally",
title = "Implementation and Performance of {QoS}-aware {Java}
Applications over {ATM} Networks",
journal = j-COMP-J,
volume = "43",
number = "4",
pages = "266--273",
month = "????",
year = "2000",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 14 07:02:08 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_04/430266.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_43/Issue_04/pdf/430266.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Zhang:2000:MCA,
author = "Muxiang Zhang and Agnes Chan",
title = "Maximum Correlation Analysis of Nonlinear {S}-boxes in
Stream Ciphers",
crossref = "Bellare:2000:ACC",
pages = "501--??",
year = "2000",
bibdate = "Fri Feb 1 09:16:56 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1880.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1880/18800501.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1880/18800501.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2000; cryptography",
}
@Article{Zhang:2000:WMH,
author = "Peter Zhang",
title = "{Webrelay}: a Multithreaded {HTTP} Relay Server",
journal = j-DDJ,
volume = "25",
number = "2",
pages = "86, 88, 90--94, 96",
month = feb,
year = "2000",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Nov 9 08:25:13 MST 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/multithreading.bib",
URL = "http://www.ddj.com/ftp/2000/2000_02/webrelay.txt;
http://www.ddj.com/ftp/2000/2000_02/webrelay.zip",
abstract = "Webrelay is a freely available multithreaded HTTP
relay server that authenticates that clients are
legitimate users before they are connected to vendor
web servers. Additional resources include webrelay.txt
(listings) and webrelay.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@PhdThesis{Abdalla:2001:DAS,
author = "Michel Ferreira Abdalla",
title = "Design and analysis of secure encryption schemes",
type = "Vita Thesis ({Ph.D.})",
school = "University of California, San Diego",
address = "San Diego, CA, USA",
year = "2001",
LCCN = "QA 3.8 .A2 2001",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "dissertations, academic --- UCSD --- Computer Science;
dissertations, academic --- UCSD --- Computer Science
and Engineering",
}
@Article{Abdalla:2001:ODH,
author = "Michel Abdalla and Mihir Bellare and Phillip Rogaway",
title = "The Oracle {Diffie--Hellman} Assumptions and an
Analysis of {DHIES}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "143--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200143.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200143.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Abe:2001:SEP,
author = "Masayuki Abe",
title = "Securing {``Encryption $+$ Proof of Knowledge''} in
the Random Oracle Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "277--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710277.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710277.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Abe:2001:SPA,
author = "Masayuki Abe and Koutarou Suzuki",
title = "{$ M + 1 $}-st Price Auction Using Homomorphic
Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "115--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740115.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740115.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Adelsbach:2001:ZKW,
author = "Andr{\'e} Adelsbach and Ahmad-Reza Sadeghi",
title = "Zero-Knowledge Watermark Detection and Proof of
Ownership",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "273--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370273.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370273.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Agung:2001:ICI,
author = "I. Wiseto Agung and Peter Sweeney",
title = "Improvement and Comments on Image Watermarking Using
Complementary Modulation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "411--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950411.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950411.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Akkar:2001:IAS,
author = "M.-L. Akkar and C. Giraud",
title = "An Implementation of {DES} and {AES}, Secure against
Some Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "309--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620309.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620309.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Al-Ibrahim:2001:AMS,
author = "M. Al-Ibrahim and J. Pieprzyk",
title = "Authenticating Multicast Streams in Lossy Channels
Using Threshold Techniques",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2094",
pages = "239--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:54 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2094.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2094/20940239.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2094/20940239.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Allison:2001:LLE,
author = "Dennis Allison and Randy Schrickel and Reid Womack and
Jeremy C. Reed and Ashley Tate and Paul Munsey",
title = "Letters: Looking for Early {PPC [People's Computing
Company]} People; Being Prepared for Invasion;
{BetterBASIC}; {Linux} versus {BSD}; {Diffie--Hellman}
to the Rescue; The Future of Programming",
journal = j-DDJ,
volume = "26",
number = "6",
pages = "10, 12",
month = jun,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 17:40:37 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Amir:2001:FAA,
author = "Yair Amir and Cristina Nita-Rotaru and Jonathan R.
Stanton",
title = "Framework for Authentication and Access Control of
Client-Server Group Communication Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2233",
pages = "128--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:19 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2233.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2233/22330128.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2233/22330128.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{An:2001:DER,
author = "Jee Hea An and Mihir Bellare",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "Does Encryption with Redundancy Provide
Authenticity?",
volume = "2045",
publisher = pub-SV,
address = pub-SV:adr,
pages = "512--528",
year = "2001",
MRclass = "94A60",
MRnumber = "1 895 452",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450512.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450512.pdf",
}
@Article{Anagnostopoulos:2001:PAD,
author = "Aris Anagnostopoulos and Michael T. Goodrich and
Roberto Tamassia",
title = "Persistent Authenticated Dictionaries and Their
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "379--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000379.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000379.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:AAPb,
author = "Anonymous",
title = "An Anonymous Auction Protocol Using ``Money Escrow''
(Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "223--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330223.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330223.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Anonymous:2001:AIgb,
author = "Anonymous",
title = "Author Index",
crossref = "Kilian:2001:ACC",
pages = "599--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/papers/2139/2139auth.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Anonymous:2001:ANT,
author = "Anonymous",
title = "Authentication and Naming (Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "20--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330020.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330020.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:AWB,
author = "Anonymous",
title = "Authentication {Web}-Based Virtual Shops Using
Signature-Embedded Marks --- {A} Practical Analysis ---
(Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "249--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330249.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330249.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:CCA,
author = "Anonymous",
title = "Censoring crypto not the answer says {Schneier}",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "10",
pages = "4--4",
day = "31",
month = oct,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)01011-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:20 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580101011X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@TechReport{Anonymous:2001:EDS,
author = "Anonymous",
title = "Encryption and Digital Signature Standards",
type = "Technical report",
number = "AD-a398 639",
institution = "National Aeronautics and Space Administration",
address = "Ames Research Center, Moffett Field, CA, USA",
pages = "14",
year = "2001",
bibdate = "Wed Sep 28 08:23:23 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2001:EER,
author = "Anonymous",
title = "Encryption expert released on bail",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "8",
pages = "2--2",
day = "1",
month = aug,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00802-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:17 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801008029",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2001:EMB,
author = "Anonymous",
title = "Encryption market bolstered by hackers",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "7",
pages = "4--4",
day = "1",
month = jul,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00711-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:16 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801007115",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2001:LBS,
author = "Anonymous",
title = "Looking on the Bright Side of Black-Box Cryptography
(Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "54--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330054.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330054.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:MIT,
author = "Anonymous",
title = "Massive identity theft by {NY} dish washer",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "4",
pages = "2--2",
day = "1",
month = apr,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00402-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801004020",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2001:MLF,
author = "Anonymous",
title = "{Magic Lantern} fries crypto keys",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "12",
pages = "2--2",
day = "1",
month = dec,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)01202-8",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:23 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801012028",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2001:NWS,
author = "Anonymous",
title = "{Netherlands} to watch strong crypto",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "10",
pages = "4--4",
day = "31",
month = oct,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)01012-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:20 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801010121",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2001:PKC,
author = "Anonymous",
title = "Public-Key Crypto-systems Using Symmetric-Key
Crypto-algorithms (Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "184--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330184.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330184.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:RAC,
author = "Anonymous",
title = "{DOS}-Resistant Authentication with Client Puzzles
(Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "178--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330178.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330178.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:SCS,
author = "Anonymous",
title = "Short Certification of Secure {RSA} Modulus
(Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "234--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330234.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330234.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Anonymous:2001:TAD,
author = "Anonymous",
title = "Talking about digital copyright",
journal = j-IEEE-SPECTRUM,
volume = "38",
number = "6",
pages = "9--9",
month = jun,
year = "2001",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2001.925271",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Conference proceedings; Digital recording; Discussion
forums; Educational institutions; Electromagnetic
interference; Intelligent robots; Law; National
security; Protection; Watermarking",
}
@Article{Anshel:2001:NKA,
author = "Iris Anshel and Michael Anshel and Benji Fisher and
Dorian Goldfeld",
title = "New Key Agreement Protocols in Braid Group
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "13--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200013.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200013.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ansper:2001:ELT,
author = "Arne Ansper and Ahto Buldas and Meelis Roos and Jan
Willemson",
title = "Efficient Long-Term Validation of Digital Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "402--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920402.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920402.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Aoki:2001:CBB,
author = "Kazumaro Aoki and Tetsuya Ichikawa and Masayuki Kanda
and Mitsuru Matsui and Shiho Moriai and Junko Nakajima
and Toshio Tokita",
title = "Camellia: a $ 128 $-Bit Block Cipher Suitable for
Multiple Platforms --- Design and Analysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "39--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120039.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120039.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Arboit:2001:FLM,
author = "Genevi{\`e}ve Arboit and Jean-Marc Robert",
title = "From Fixed-Length Messages to Arbitrary-Length
Messages Practical {RSA} Signature Padding Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "44--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200044.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200044.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Arnold:2001:AWB,
author = "Michael Arnold",
title = "Audio Watermarking: Burying information in the data",
journal = j-DDJ,
volume = "26",
number = "11",
pages = "21--22, 24--26, 28",
month = nov,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:40 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2001/2001_11/watermk.txt;
http://www.ddj.com/ftp/2001/2001_11/watermk.zip",
abstract = "Digital watermarking is a security technique that
provides copy protection, authentication, and more for
audio and other forms of information. The approach
Michael presents here is based on a statistical
algorithm working in the Fourier domain. Additional
resources include {\tt watermk.txt} (listings) and {\tt
watermk.zip} (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Atallah:2001:NLW,
author = "Mikhail J. Atallah and Victor Raskin and Michael
Crogan and Christian Hempelmann and Florian Kerschbaum
and Dina Mohamed and Sanket Naik",
title = "Natural Language Watermarking: Design, Analysis, and a
Proof-of-Concept Implementation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "185--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370185.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370185.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ateniese:2001:ECV,
author = "Giuseppe Ateniese and Carlo Blundo and Alfredo {De
Santis} and Douglas R. Stinson",
title = "Extended capabilities for visual cryptography",
journal = j-THEOR-COMP-SCI,
volume = "250",
number = "1--2",
pages = "143--161",
day = "6",
month = jan,
year = "2001",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Oct 31 11:38:56 MST 2000",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/186/20/29/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/186/20/29/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Ateniese:2001:SRC,
author = "Giuseppe Ateniese and Cristina Nita-Rotaru",
title = "Stateless-Recipient Certified {E}-Mail System Based on
Verifiable Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "182--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710182.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710182.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Aura:2001:RAC,
author = "Tuomas Aura and Pekka Nikander and Jussipekka Leiwo",
title = "{DOS}-Resistant Authentication with Client Puzzles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "170--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330170.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330170.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Babbage:2001:MHO,
author = "Steve Babbage and Laurent Frisch",
booktitle = "Information security and cryptology---ICISC 2000
(Seoul)",
title = "On {MISTY1} higher order differential cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2015",
pages = "22--36",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 897 370",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Baier:2001:ECP,
author = "H. Baier",
title = "Elliptic Curves of Prime Order over Optimal Extension
Fields for Use in Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "99--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470099.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470099.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Baier:2001:ECS,
author = "Harald Baier",
title = "Efficient Computation of Singular Moduli with
Application in Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2138",
pages = "71--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:40 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2138.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2138/21380071.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2138/21380071.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Banks:2001:CAS,
author = "William D. Banks and Daniel Lieman and Igor E.
Shparlinski and Van Thuong To",
title = "Cryptographic Applications of Sparse Polynomials over
Finite Rings",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2015",
pages = "206--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2015/20150206.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2015/20150206.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bao:2001:CTS,
author = "Feng Bao and Robert H. Deng and Willi Geiselmann and
Claus Schnorr and Rainer Steinwandt and Hongjun Wu",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "Cryptanalysis of Two Sparse Polynomial Based Public
Key Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "153--164",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 898 031",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920153.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920153.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bao:2001:SPD,
author = "Feng Bao and Robert Deng and Peirong Feng and Yan Guo
and Hongjun Wu",
title = "Secure and Private Distribution of Online Video and
Some Related Cryptographic Issues",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "190--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190190.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190190.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Barak:2001:IPO,
author = "Boaz Barak and Oded Goldreich and Rusell Impagliazzo
and Steven Rudich and Amit Sahai and Salil Vadhan and
Ke Yang",
title = "On the (Im)possibility of Obfuscating Programs",
crossref = "Kilian:2001:ACC",
pages = "1--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390001.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Book{Barrett:2001:SSS,
author = "Daniel J. Barrett and Richard E. Silverman",
title = "{SSH}: The {Secure Shell}: The Definitive Guide",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xv + 540",
year = "2001",
ISBN = "0-596-00011-1",
ISBN-13 = "978-0-596-00011-0",
LCCN = "QA76.76.O63 B369 2001",
bibdate = "Mon Apr 18 15:01:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$39.95",
URL = "http://www.oreilly.com/catalog/9780596000110;
http://www.oreilly.com/catalog/sshtdg/;
http://www.snailbook.com/",
acknowledgement = ack-nhfb,
subject = "UNIX Shells; Data encryption (Computer science);
Computer networks; Security measures",
}
@Article{Batina:2001:AWD,
author = "Lejla Batina and Geeke Muurling",
title = "Another Way of Doing {RSA} Cryptography in Hardware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "364--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600364.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600364.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bauer:2001:PPGa,
author = "Mick Bauer",
title = "Paranoid Penguin {GPG}: The Best Free Crypto You
Aren't Using, {Part I} of {II}",
journal = j-LINUX-J,
volume = "89",
pages = "32--34, 36--37",
month = sep,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Aug 30 06:06:53 MDT 2001",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue89/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://noframes.linuxjournal.com/lj-issues/issue89/4828.html",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Bauer:2001:PPGb,
author = "Mick Bauer",
title = "Paranoid Penguin: {GPG}: the Best Free Crypto You
Aren't Using, {Part II} of {II}",
journal = j-LINUX-J,
volume = "90",
pages = "46, 48, 50--52, 54--55",
month = oct,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Wed Sep 19 18:50:19 MDT 2001",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue90/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Bauer:2001:PPUb,
author = "Mick Bauer",
title = "Paranoid Penguin: The 101 Uses of {OpenSSH}: {Part II}
of {II}",
journal = j-LINUX-J,
volume = "82",
pages = "52, 54, 56, 58--59",
month = feb,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Feb 15 08:04:55 MST 2001",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue82/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Bedi:2001:CNF,
author = "S. S. Bedi and N. R. Pillai",
title = "Cryptanalysis of the Nonlinear {FeedForward}
Generator",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "188--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470188.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470188.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bella:2001:MPS,
author = "Giampaolo Bella",
title = "Mechanising a Protocol for Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "19--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400019.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400019.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bellare:2001:KPP,
author = "Mihir Bellare and Alexandra Boldyreva and Anand Desai
and David Pointcheval",
title = "Key-Privacy in Public-Key Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "566--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480566.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480566.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Bellare:2001:OCH,
author = "Mihir Bellare and Alexandra Boldyreva and Lars Knudsen
and Chanathip Namprempre",
title = "Online Ciphers and the Hash-{CBC} Construction",
crossref = "Kilian:2001:ACC",
pages = "292--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390292.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390292.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Benantar:2001:IPK,
author = "M. Benantar",
title = "The {Internet} public key infrastructure",
journal = j-IBM-SYS-J,
volume = "40",
number = "3",
pages = "648--665",
month = "????",
year = "2001",
CODEN = "IBMSA7",
ISSN = "0018-8670",
bibdate = "Wed Nov 14 19:06:40 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/sj/403/benantar.html;
http://www.research.ibm.com/journal/sj/403/benantar.pdf",
acknowledgement = ack-nhfb,
fjournal = "IBM Systems Journal",
ordernumber = "G321-0142",
}
@TechReport{Benson:2001:VS,
author = "Robert L. Benson",
title = "The {Venona} Story",
type = "Report",
number = "????",
institution = "Center for Cryptologic History, National Security
Agency",
address = "Fort Meade, MD, USA",
month = "????",
year = "2001",
bibdate = "Mon Sep 19 22:37:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Berbecaru:2001:CPK,
author = "Diana Berbecaru and Antonio Lioy and Marius Marian",
title = "On the Complexity of Public-Key Certificate
Validation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "183--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000183.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000183.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bergadano:2001:CSA,
author = "Francesco Bergadano and Davide Cavagnino and Bruno
Crispo",
title = "Chained Stream Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "144--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120144.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120144.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biryukov:2001:RTC,
author = "Alex Biryukov and Adi Shamir and David Wagner",
title = "Real Time Cryptanalysis of {A5/1} on a {PC}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biryukov:2001:SCS,
author = "Alex Biryukov and Adi Shamir",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "Structural cryptanalysis of {SASAS}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "394--405",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 895 445",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Black:2001:CAF,
author = "John Black and Phillip Rogaway",
title = "Ciphers with Arbitrary Finite Domains",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "114--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710114.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710114.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Blanchet-Sadri:2001:MSD,
author = "F. Bl anchet-Sadri and C. Morgan",
title = "Multiset and set decipherable codes",
journal = j-COMPUT-MATH-APPL,
volume = "41",
number = "10--11",
pages = "1257--1262",
month = may # "\slash " # jun,
year = "2001",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:13 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122101000967",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Blanchet:2001:ACP,
author = "Bruno Blanchet",
title = "Abstracting Cryptographic Protocols by {Prolog}
Rules",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2126",
pages = "433--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:28 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2126.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2126/21260433.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2126/21260433.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Blanchet:2001:ECP,
author = "Bruno Blanchet",
editor = "????",
booktitle = "{IEEE Computer Security Foundations Workshop}",
title = "An efficient cryptographic protocol verifier based on
{{\tt prolog}} rules",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "82--82",
year = "2001",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:30:06 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 10]{Schneier:2015:SWC}.",
}
@Misc{Blaze:2001:LYS,
author = "Matt Blaze",
title = "Loaning Your Soul to the Devil: Influencing Policy
Without Selling Out",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, Tenth USENIX Security
Symposium, August 13--17, 2001, Washington, DC, USA.",
abstract = "All of a sudden, it seems, computer security and
cryptology have become important not only as technical
problems but as public policy issues. More to the
point, we practitioners and researchers in computer
security and cryptology often now find ourselves sought
out not only for technical expertise but also by
policymakers, lobbyists, and the media. Unfortunately,
we're often surprised at just how ill-prepared we are
for the public policy culture, and we risk finding
ourselves misused, misunderstood or misquoted. It
doesn't have to be that way. This talk will present a
personal view of the relationship between science and
public policy, focusing on the different value systems,
protocols, and expectations found in the two worlds. It
really is possible to maintain one's integrity while
making a difference, even inside the Beltway.",
acknowledgement = ack-nhfb,
}
@Article{Blomer:2001:LSE,
author = "Johannes Bl{\"o}mer and Alexander May",
title = "Low Secret Exponent {RSA} Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2146",
pages = "4--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:49 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2146.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2146/21460004.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2146/21460004.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bo:2001:EID,
author = "Xiaochen Bo and Lincheng Shen and Wensen Chang",
title = "Evaluation of the Image Degradation for a Typical
Watermarking Algorithm in the Block-{DCT} Domain",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "52--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290052.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290052.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bo:2001:SCD,
author = "Xiaochen Bo and Lincheng Shen and Wensen Chang",
title = "Sign Correlation Detector for Blind Image Watermarking
in the {DCT} Domain",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "780--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950780.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950780.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Boneh:2001:EGS,
author = "Dan Boneh and Matthew Franklin",
title = "Efficient generation of shared {RSA} keys",
journal = j-J-ACM,
volume = "48",
number = "4",
pages = "702--722",
month = jul,
year = "2001",
CODEN = "JACOAH",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Apr 1 16:42:49 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@InProceedings{Boneh:2001:IBE,
author = "Dan Boneh and Matt Franklin",
title = "Identity-Based Encryption from the {Weil} Pairing",
crossref = "Kilian:2001:ACC",
pages = "213--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390213.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390213.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Boneh:2001:LBM,
author = "Dan Boneh and Glenn Durfee and Matt Franklin",
title = "Lower Bounds for Multicast Message Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "437--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:02 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450437.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450437.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Boneh:2001:MFR,
author = "Dan Boneh and Xuhua Ding and Gene Tsudik and Chi Ming
Wong",
title = "A Method for Fast Revocation of Public Key
Certificates and Security Capabilities",
crossref = "USENIX:2001:PTU",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/boneh.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Boneh:2001:SOR,
author = "Dan Boneh",
title = "Simplified {OAEP} for the {RSA} and {Rabin}
Functions",
crossref = "Kilian:2001:ACC",
pages = "275--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390275.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390275.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InProceedings{Boneh:2001:UBE,
author = "Dan Boneh and Igor E. Shparlinski",
title = "On the Unpredictability of Bits of the Elliptic Curve
{Diffie--Hellman} Scheme",
crossref = "Kilian:2001:ACC",
pages = "201--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390201.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390201.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Boreale:2001:STA,
author = "Michele Boreale",
title = "Symbolic Trace Analysis of Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2076",
pages = "667--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:17:25 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2076.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2076/20760667.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2076/20760667.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Borst:2001:CSC,
author = "Johan Borst and Bart Preneel and Vincent Rijmen",
title = "Cryptography on smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "4",
pages = "423--435",
day = "16",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/61/28/29/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/61/28/29/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Boyd:2001:ECB,
author = "Colin Boyd and Paul Montague and Khanh Nguyen",
title = "Elliptic Curve Based Password Authenticated Key
Exchange Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "487--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190487.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190487.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Brandao:2001:UEC,
author = "T. Brand{\~a}o and M. P. Queluz and A. Rodrigues",
title = "On the Use of Error Correction Codes in Spread
Spectrum Based Image Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "630--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950630.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950630.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Brands:2001:RPK,
author = "Stefan A. Brands",
title = "Rethinking public key infrastructures and digital
certificates: building in privacy",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "xxi + 314",
year = "2001",
ISBN = "0-262-02491-8",
ISBN-13 = "978-0-262-02491-4",
LCCN = "TK5105.59 .B73 2000",
bibdate = "Mon Feb 04 12:08:50 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Brandt:2001:CPS,
author = "Felix Brandt",
title = "Cryptographic Protocols for Secure Second-Price
Auctions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2182",
pages = "154--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:25 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2182.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2182/21820154.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2182/21820154.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bresson:2001:PAG,
author = "Emmanuel Bresson and Olivier Chevassut and David
Pointcheval",
title = "Provably Authenticated Group {Diffie--Hellman} Key
Exchange --- The Dynamic Case",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "290--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480290.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480290.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Brier:2001:CRS,
author = "Eric Brier and Christophe Clavier and
Jean-S{\'e}bastien Coron and David Naccache",
title = "Cryptanalysis of {RSA} Signatures with Fixed-Pattern
Padding",
crossref = "Kilian:2001:ACC",
pages = "433--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390433.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390433.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Brincat:2001:KRA,
author = "Karl Brincat and Chris J. Mitchell",
title = "Key Recovery Attacks on {MACs} Based on Properties of
Cryptographic {APIs}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "63--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600063.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600063.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Buchmann:2001:IC,
author = "Johannes Buchmann",
title = "Introduction to cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 281",
year = "2001",
ISBN = "0-387-95034-6 (hardcover)",
ISBN-13 = "978-0-387-95034-1 (hardcover)",
LCCN = "QA268.B83 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Undergraduate texts in mathematics",
acknowledgement = ack-nhfb,
keywords = "coding theory; computer science textbooks;
cryptography",
remark = "See also second edition \cite{Buchmann:2004:IC}.",
}
@Misc{Burnett:2001:CB,
author = "Steve Burnett",
title = "Crypto Blunders",
year = "2001",
bibdate = "Tue Oct 15 15:38:06 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, LISA 2001: 15th Systems
Administration Conference, December 2--7, 2001, Town
and Country Resort Hotel, San Diego, CA.",
URL = "http://db.usenix.org/publications/library/proceedings/lisa2001/tech/",
abstract = "Cryptography has emerged as an enormously important
component of the networked world. People are hesitant
to trust the Web and e-commerce without the protections
crypto provides. More and more applications are now
built with crypto core components. Many cryptographic
algorithms are almost unbreakable \ldots{} if used
properly.\par
This presentation will describe some blunders, famous
and not so famous. Some may be a little humorous --- to
those not involved. If nothing else, the audience will
learn what not to do in their products.",
acknowledgement = ack-nhfb,
}
@Book{Burnett:2001:RSO,
author = "Steve Burnett and Stephen Paine",
title = "{RSA Security}'s Official Guide to Cryptography",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "xxi + 419",
year = "2001",
ISBN = "0-07-213139-X",
ISBN-13 = "978-0-07-213139-0",
LCCN = "TK5105.59.B87 200",
bibdate = "Wed Jan 16 10:48:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Includes CD-ROM.",
price = "US\$59.99",
acknowledgement = ack-nhfb,
}
@InProceedings{Cachin:2001:SEA,
author = "Christian Cachin and Klaus Kursawe and Frank Petzold
and Victor Shoup",
title = "Secure and Efficient Asynchronous Broadcast
Protocols",
crossref = "Kilian:2001:ACC",
pages = "524--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390524.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390524.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Book{Calvocoressi:2001:TSU,
author = "Peter Calvocoressi",
title = "Top secret {Ultra}",
publisher = "M and M Baldwin",
address = "Cleobury Mortimer, Kidderminster, England",
pages = "158",
year = "2001",
ISBN = "0-947712-41-0",
ISBN-13 = "978-0-947712-41-9",
LCCN = "D810.C88 C34 2001",
bibdate = "Mon May 8 07:07:03 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Calvocoressi, Peter; Cryptographers; Great Britain;
Biography; World War, 1939--1945; Personal narratives,
English; Cryptography; Secret service",
}
@InProceedings{Camenisch:2001:IES,
author = "Jan Camenisch and Anna Lysyanskaya",
title = "An Identity Escrow Scheme with Appointed Verifiers",
crossref = "Kilian:2001:ACC",
pages = "388--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390388.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390388.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Campo:2001:JFC,
author = "Celeste Campo and Andr{\'e}s Marm and Arturo
Garc{\'\i}a and Ignacio D{\'\i}az and Peter T. Breuer
and Carlos Delgado and Carlos Garc{\'\i}a",
title = "{JCCM}: Flexible Certificates for Smartcards with
{Java} Card",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "34--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400034.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400034.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Canda:2001:SBC,
author = "Val{\'e}r {\v{C}}anda and Tran van Trung and Spyros
Magliveras and Tam{\'a}s Horv{\'a}th",
title = "Symmetric Block Ciphers Based on Group Bases",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "89--105",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120089.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120089.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Canetti:2001:UCC,
author = "Ran Canetti and Marc Fischlin",
title = "Universally Composable Commitments",
crossref = "Kilian:2001:ACC",
pages = "19--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390019.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390019.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InProceedings{Canetti:2001:UCS,
author = "R. Canetti",
title = "Universally composable security: a new paradigm for
cryptographic protocols",
crossref = "IEEE:2001:ISF",
pages = "136--145",
year = "2001",
bibdate = "Fri Feb 22 06:25:27 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Canteaut:2001:CFD,
author = "A. Canteaut",
title = "Cryptographic Functions and Design Criteria for Block
Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Canteaut:2001:COR,
author = "Anne Canteaut and Eric Filiol",
title = "Ciphertext Only Reconstruction of Stream Ciphers Based
on Combination Generators",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "165--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780165.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780165.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Caprara:2001:PSR,
author = "Alberto Caprara",
title = "On the Practical Solution of the Reversal Median
Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2149",
pages = "238--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:52 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2149.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2149/21490238.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2149/21490238.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Carter:2001:SCT,
author = "Amy Carter",
title = "Smart card technology just got smarter",
journal = "Metro",
volume = "97",
number = "9",
month = dec,
year = "2001",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "automatic fare collection --- United States; smart
cards --- United States",
}
@InCollection{Catalano:2001:BSP,
author = "Dario Catalano and Rosario Gennaro and Nick
Howgrave-Graham",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "The Bit Security of {Paillier}'s Encryption Scheme and
Its Applications",
volume = "2045",
publisher = pub-SV,
address = pub-SV:adr,
pages = "229--243",
year = "2001",
MRclass = "94A60",
MRnumber = "1 895 436",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450229.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450229.pdf",
}
@InProceedings{Cattaneo:2001:DIT,
author = "Giuseppe Cattaneo and Luigi Catuogno and Aniello {Del
Sorbo} and Pino Persiano",
title = "The Design and Implementation of a Transparent
Cryptographic File System for {UNIX}",
crossref = "USENIX:2001:PFT",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 17:19:08 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix01/freenix01/cattaneo.html",
acknowledgement = ack-nhfb,
}
@Article{Chan:2001:CRP,
author = "Chi-Kwong Chan and L. M. Cheng",
title = "Cryptanalysis of a remote password authentication
scheme",
journal = j-INT-J-COMPUT-MATH,
volume = "78",
number = "3",
pages = "323--326",
year = "2001",
CODEN = "IJCMAT",
ISSN = "0020-7160",
ISSN-L = "0020-7160",
MRclass = "94A62 (68P25)",
MRnumber = "1 894 961",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "International Journal of Computer Mathematics",
}
@Article{Chan:2001:CTB,
author = "Chi-Kwong Chan and L. M. Cheng",
title = "Cryptanalysis of a Timestamp-Based Password
Authentication Scheme",
journal = j-COMPUT-SECUR,
volume = "21",
number = "1",
pages = "74--76",
month = "First Quarter",
year = "2001",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802001104",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chan:2001:WEF,
author = "Alvin T. S. Chan and Jiannong Cao and Henry Chan and
Gilbert Young",
title = "A {Web}-enabled framework for smart card applications
in health services",
journal = j-CACM,
volume = "44",
number = "9",
pages = "76--82",
month = sep,
year = "2001",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Sep 8 19:28:25 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/articles/journals/cacm/2001-44-9/p76-chan/p76-chan.pdf;
http://www.acm.org/pubs/citations/journals/cacm/2001-44-9/p76-chan/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Chang:2001:ASM,
author = "Kyung-Ah Chang and Byung-Rae Lee and Tai-Yun Kim",
title = "Authentication Service Model Supporting Multiple
Domains in Distributed Computing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2073",
pages = "413--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:28 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2073.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2073/20730413.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2073/20730413.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chang:2001:CIU,
author = "Chin-Chen Chang and Iuon-Chang Lin",
title = "Cryptanalysis of the Improved User Efficient Blind
Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "42--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290042.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290042.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chang:2001:FAM,
author = "Kyung-Ah Chang and Byung-Rae Lee and Tai-Yun Kim",
title = "Flexible Authentication with Multiple Domains of
Electronic Commerce",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2115",
pages = "176--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:17 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2115.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2115/21150176.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2115/21150176.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chang:2001:NEA,
author = "Chin-Chen Chang and Min-Shian Hwang and Tung-Shou
Chen",
title = "A new encryption algorithm for image cryptosystems",
journal = j-J-SYST-SOFTW,
volume = "58",
number = "2",
pages = "83--91",
day = "1",
month = sep,
year = "2001",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 19 09:08:02 MST 2001",
bibsource = "http://www.elsevier.com/locate/issn/01641212;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/29/11/68/33/27/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chang:2001:NSS,
author = "Chin-Chen Chang and Jyh-Chiang Yeh and Ju-Yuan Hsiao",
title = "A Novel Scheme for Securing Image Steganography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "804--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950804.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950804.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chang:2001:TFG,
author = "Chin-Chen Chang and Kuo-Feng Hwang",
title = "Towards the Forgery of a Group Signature without
Knowing the Group Center's Secret",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "47--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290047.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290047.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chapman:2001:PEA,
author = "Mark Chapman and George I. Davida and Marc Rennhard",
title = "A Practical and Effective Approach to Large-Scale
Automated Linguistic Steganography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "156--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000156.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000156.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2001:DEU,
author = "Chaur-Chin Chen",
title = "Data Encryption Using {MRF} with an {RSA} Key",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "399--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950399.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950399.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2001:PDP,
author = "Su-Shing Chen",
title = "The Paradox of Digital Preservation",
journal = j-COMPUTER,
volume = "34",
number = "3",
pages = "24--28",
month = mar,
year = "2001",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed Mar 14 07:01:26 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2001/pdf/r3024.pdf;
http://www.computer.org/computer/co2001/r3024abs.htm",
abstract = "Preserving digital information requires proven methods
for maintaining and accessing and authenticating
technology-generated data.",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Chen:2001:SFW,
author = "Minghua Chen and Yun He",
title = "A Synchronous Fragile Watermarking Scheme for
Erroneous {Q--DCT} Coefficients Detection",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "812--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950812.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950812.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cheng:2001:NPT,
author = "Qi Cheng and Shigenori Uchiyama",
title = "Nonuniform Polynomial Time Algorithm to Solve
Decisional {Diffie--Hellman} Problem in Finite Fields
under Conjecture",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "290--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710290.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710290.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Cheon:2001:NVR,
author = "Jung Hee Cheon",
title = "Nonlinear Vector Resilient Functions",
crossref = "Kilian:2001:ACC",
pages = "458--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390458.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390458.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Chepyzhov:2001:SAF,
author = "Vladimor V. Chepyzhov and Thomas Johansson and Ben
Smeets",
title = "A Simple Algorithm for Fast Correlation Attacks on
Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "181--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780181.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780181.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cherry:2001:HDS,
author = "S. M. Cherry",
title = "Is hyperlinking to decryption software illegal?",
journal = j-IEEE-SPECTRUM,
volume = "38",
number = "8",
pages = "64--65",
month = aug,
year = "2001",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.938724",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "2600 magazine; Cities and towns; computer code;
Computer hacking; computer program; Constitution;
Cryptography; cryptography; decryption software; DeCSS
software; digital movies illegal copying; DVD; DVD
encryption scheme decoding; federal court;
hyperlinking; hypermedia; legislation; Motion pictures;
movie-industry; New York City; protected speech;
Protection; Publishing; Software; software packages;
speech coding; Speech coding; United States; Web site",
}
@Article{Cherry:2001:HMH,
author = "S. M. Cherry",
title = "Hyperencryption: Much hype about little that is new
[Web Sites]",
journal = j-IEEE-SPECTRUM,
volume = "38",
number = "4",
pages = "87--87",
month = apr,
year = "2001",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2001.8822377",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
}
@Article{Cherry:2001:REM,
author = "S. M. Cherry",
title = "Remailers elude e-mail surveillance",
journal = j-IEEE-SPECTRUM,
volume = "38",
number = "11",
pages = "69--69",
month = nov,
year = "2001",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2001.963268",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computer networks; Cryptography; Electronic mail;
Legislation; Network servers; Software maintenance;
Surveillance; Telecommunication traffic; Terrorism; Web
and internet services",
}
@Article{Cheung:2001:TPS,
author = "O. Y. H. Cheung and K. H. Tsoi and P. H. W. Leong and
M. P. Leong",
title = "Tradeoffs in Parallel and Serial Implementations of
the International Data Encryption Algorithm {IDEA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "333--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620333.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620333.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chien:2001:CCW,
author = "Hung-Yu Chien and Tzong-Chen Wu and Jinn-Ke Jan and
Yuh-Min Tseng",
title = "Cryptanalysis of {Chang--Wu}'s group-oriented
authentication and key exchange protocols",
journal = j-INFO-PROC-LETT,
volume = "80",
number = "2",
pages = "113--117",
day = "31",
month = oct,
year = "2001",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A60 (68P25)",
MRnumber = "2002j:94033",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/23/20/80/37/33/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chien:2001:MRL,
author = "Hung-Yu Chien and Jinn-Ke Jan and Yuh-Min Tseng",
title = "A modified remote login authentication scheme based on
geometric approach",
journal = j-J-SYST-SOFTW,
volume = "55",
number = "3",
pages = "287--290",
day = "15",
month = jan,
year = "2001",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Apr 18 06:31:11 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/01641212;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/29/11/54/27/29/abstract.html;
http://www.elsevier.nl/gej-ng/10/29/11/54/27/29/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chodowiec:2001:ETG,
author = "Pawel Chodowiec and Kris Gaj and Peter Bellows and
Brian Schott",
title = "Experimental Testing of the {Gigabit IPSec}-Compliant
Implementations of {Rijndael} and {Triple DES} Using
{SLAAC-1V FPGA} Accelerator Board",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "220--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000220.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000220.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Christianson:2001:PKC,
author = "Bruce Christianson and Bruno Crispo and James A.
Malcolm",
title = "Public-Key Crypto-systems Using Symmetric-Key
Crypto-algorithms",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "182--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330182.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330182.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ciet:2001:SFC,
author = "M. Ciet and J.-J. Quisquater and F. Sica",
title = "A Secure Family of Composite Finite Fields Suitable
for Fast Implementation of Elliptic Curve
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "108--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470108.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470108.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cirstea:2001:SAP,
author = "Horatiu Cirstea",
title = "Specifying Authentication Protocols Using Rewriting
and Strategies",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1990",
pages = "138--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:09 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1990.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1990/19900138.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1990/19900138.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{claffy:2001:IMM,
author = "kc claffy",
title = "{Internet} Measurement: Myths About {Internet} Data",
year = "2001",
bibdate = "Tue Oct 15 15:38:06 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, LISA 2001: 15th Systems
Administration Conference, December 2--7, 2001, Town
and Country Resort Hotel, San Diego, CA.",
URL = "http://db.usenix.org/publications/library/proceedings/lisa2001/tech/",
abstract = "Current papers that propose new techniques and
protocols often make assumptions about traffic
characteristics that are simply not validated by real
data. Hypotheses about the level of fragmented traffic,
encrypted traffic, topology characteristics, traffic
favoritism, path symmetry, DOS attack prevalence,
address space utilization and consumption, directional
balance of traffic volume, routing protocol behavior
and policy, and distribution statistics of path
lengths, flow sizes, packet sizes, prefix lengths, and
routing announcements therefore yield questionable
analytical results. Even in cases where analysis is
based on data attainable by a researcher on his or her
local campus, attempts to generalize typically lose
integrity in the face of more complete or
representative data sets.",
acknowledgement = ack-nhfb,
annote = "Yes, author name is all lowercase.",
}
@Article{Cobas:2001:CTA,
author = "Juan David Gonz{\'a}lez Cobas and Jos{\'e} Antonio
L{\'o}pez Brugos",
title = "A Complexity-Theoretic Approach to the Design of Good
Measures of Cryptographic Strength",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2178",
pages = "233--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:59 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2178.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2178/21780233.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2178/21780233.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cochran:2001:NVS,
author = "Shannon Cochran",
title = "News and Views: Scientists Seek Immersive Reality;
{USENIX} Names Lifetime Achievement Recipients [the
{GNU Project} and the {Kerberos} network authentication
system]; Robots Need Programmers; Evangelizing the
{Semantic Web}; Get Your Supercomputer Software Free;
{Usenet} Creator {Jim Ellis} Dies; {DARPA} Funds
{FreeBSD} Security Initiative",
journal = j-DDJ,
volume = "26",
number = "9",
pages = "18--18",
month = sep,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:39 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Cocks:2001:IBE,
author = "Clifford Cocks",
title = "An Identity Based Encryption Scheme Based on Quadratic
Residues",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "360--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600360.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600360.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Cormen:2001:IA,
author = "Thomas H. Cormen and Charles E. (Eric) Leiserson and
Ronald L. Rivest",
title = "Introduction to Algorithms",
publisher = pub-MIT,
address = pub-MIT:adr,
edition = "Second",
pages = "xxi + 1180",
year = "2001",
ISBN = "0-262-53196-8 (paperback), 0-262-03293-7 (hardcover),
0-07-013151-1 (McGraw-Hill), 0-07-297054-5 (McGraw-Hill
with CD-ROM)",
ISBN-13 = "978-0-262-53196-2 (paperback), 978-0-262-03293-3
(hardcover), 978-0-07-013151-4 (McGraw-Hill),
978-0-07-297054-8 (McGraw-Hill with CD-ROM)",
LCCN = "QA76.6 .I5858 2001",
bibdate = "Sat Jan 26 12:46:16 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
abstract = "This title covers a broad range of algorithms in
depth, yet makes their design and analysis accessible
to all levels of readers. Each chapter is relatively
self-contained and can be used as a unit of study. The
algorithms are described in English and in a pseudocode
designed to be readable by anyone who has done a little
programming. The explanations have been kept elementary
without sacrificing depth of coverage or mathematical
rigor. This second edition features new chapters on the
role of algorithms, probabilistic analysis and
randomized algorithms, and linear programming, as well
as extensive revisions to virtually every section of
the book. In a subtle but important change, loop
invariants are introduced early and used throughout the
text to prove algorithm correctness. Without changing
the mathematical and analytic focus, the authors have
moved much of the mathematical foundations material
from Part I to an appendix and have included additional
motivational material at the beginning.",
acknowledgement = ack-ds # " and " # ack-nhfb,
libnote = "Not yet in my library.",
rawdata = "Cormen, Thomas H., Charles E. Leiserson, Ronald L.
Rivest and Clifford Stein (2001) {\it Introduction to
Algorithms}, 2nd Edition, MIT Press and McGraw-Hill.",
remark = "MIT Press 2001, McGraw-Hill 2002 (third printing),
McGraw-Hill 2003 (fourth printing)",
shorttableofcontents = "1: The Role of Algorithms in Computing \\
2: Getting Started \\
3: Growth of Functions \\
4: Recurrences \\
5: Probabilistic Analysis and Randomized Algorithms \\
6: Heapsort \\
7: Quicksort \\
8: Sorting in Linear Time \\
9: Medians and Order Statistics \\
10: Elementary Data Structures \\
11: Hash Tables \\
12: Binary Search Trees \\
13: Red-Black Trees \\
14: Augmenting Data Structures \\
15: Dynamic Programming \\
16: Greedy Algorithms \\
17: Amortized Analysis \\
18: B-Trees \\
19: Binomial Heaps \\
20: Fibonacci Heaps \\
21: Data Structures for Disjoint Sets \\
22: Elementary Graph Algorithms \\
23: Minimum Spanning Trees \\
24: Single-Source Shortest Paths \\
25: All-Pairs Shortest Paths \\
26: Maximum Flow \\
27: Sorting Networks \\
28: Matrix Operations \\
29: Linear Programming \\
30: Polynomials and the FFT \\
31: Number-Theoretic Algorithms \\
32: String Matching \\
33: Computational Geometry \\
34: NP-Completeness \\
35: Approximation Algorithms \\
A: Summations \\
B: Sets, etc. \\
C: Counting and probability",
subject = "Computer programming; Computer algorithms",
tableofcontents = "Preface / xiii \\
I Foundations \\
Introduction / 3 \\
1 The Role of Algorithms in Computing / 5 \\
1.1 Algorithms / 5 \\
1.2 Algorithms as a technology / 10 \\
2 Getting Started / 75 \\
2.1 Insertion sort / 15 \\
2.2 Analyzing algorithms / 21 \\
2.3 Designing algorithms / 27 \\
3 Growth of Functions / 41 \\
3.1 Asymptotic notation / 41 \\
3.2 Standard notations and common functions / 51 \\
4 Recurrences / 62 \\
4.1 The substitution method / 63 \\
4.2 The recursion-tree method / 67 \\
4.3 The master method / 73 \\
4.4 Proof of the master theorem / 76 \\
5 Probabilistic Analysis and Randomized Algorithms / 91
\\
5.1 The hiring problem / 91 \\
5.2 Indicator random variables / 94 \\
5.3 Randomized algorithms / 99 \\
5.4 Probabilistic analysis and further uses of
indicator random variables / 106 \\
II Sorting and Order Statistics \\
Introduction / 123 \\
6 Heapsort / 127 \\
6.1 Heaps / 127 \\
6.2 Maintaining the heap property / 130 \\
6.3 Building a heap / 132 \\
6.4 The heapsort algorithm / 135 \\
6.5 Priority queues / 138 \\
7 Quicksort / 145 \\
7.1 Description of quicksort / 145 \\
7.2 Performance of quicksort / 149 \\
7.3 A randomized version of quicksort / 153 \\
7.4 Analysis of quicksort / 755 \\
8 Sorting in Linear Time / 165 \\
8.1 Lower bounds for sorting / 765 \\
8.2 Counting sort / 168 \\
8.3 Radix sort / 770 \\
8.4 Bucket sort / 174 \\
9 Medians and Order Statistics / 183 \\
9.1 Minimum and maximum / 184 \\
9.2 Selection in expected linear time / 785 \\
9.3 Selection in worst-case linear time / 189 \\
III Data Structures \\
Introduction / 197 \\
10 Elementary Data Structures / 200 \\
10.1 Stacks and queues / 200 \\
10.2 Linked lists / 204 \\
10.3 Implementing pointers and objects / 209 \\
10.4 Representing rooted trees / 214 \\
11 Hash Tables / 221 \\
11.1 Direct-address tables / 222 \\
11.2 Hash tables / 224 \\
11.3 Hash functions / 229 \\
11.4 Open addressing / 237 \\
11.5 Perfect hashing / 245 \\
12 Binary Search Trees / 253 \\
12.1 What is a binary search tree? / 253 \\
12.2 Querying a binary search tree / 256 \\
12.3 Insertion and deletion / 261 \\
12.4 Randomly built binary search trees / 265 \\
13 Red--Black Trees / 273 \\
13.1 Properties of red-black trees / 273 \\
13.2 Rotations / 277 \\
13.3 Insertion / 280 \\
13.4 Deletion / 288 \\
14 Augmenting Data Structures / 302 \\
14.1 Dynamic order statistics / 302 \\
14.2 How to augment a data structure / 308 \\
14.3 Interval trees / 311 \\
IV Advanced Design and Analysis Techniques \\
Introduction / 321 \\
15 Dynamic Programming / 323 \\
15.1 Assembly-line scheduling / 324 \\
15.2 Matrix-chain multiplication / 331 \\
15.3 Elements of dynamic programming / 339 \\
15.4 Longest common subsequence / 350 \\
15.5 Optimal binary search trees / 356 \\
16 Greedy Algorithms / 370 \\
16.1 An activity-selection problem / 377 \\
16.2 Elements of the greedy strategy / 379 \\
16.3 Huffman codes / 385 \\
* 16.4 Theoretical foundations for greedy methods / 393
\\
* 16.5 A task-scheduling problem / 399 \\
17 Amortized Analysis / 405 \\
17.1 Aggregate analysis / 406 \\
17.2 The accounting method / 470 \\
17.3 The potential method / 412 \\
17.4 Dynamic tables / 476 \\
V Advanced Data Structures \\
Introduction / 431 \\
18 B-Trees / 434 \\
18.1 Definition of B-trees / 438 \\
18.2 Basic operations on B-trees / 441 \\
18.3 Deleting a key from -tree / 449 \\
19 Binomial Heaps / 455 \\
19.1 Binomial trees and binomial heaps / 457 \\
19.2 Operations on binomial heaps / 461 \\
20 Fibonacci Heaps / 476 \\
20.1 Structure of Fibonacci heaps / 477 \\
20.2 Mergeable-heap operations / 479 \\
20.3 Decreasing a key and deleting a node / 489 \\
20.4 Bounding the maximum degree / 493 \\
21 Data Structures for Disjoint Sets / 498 \\
21.1 Disjoint-set operations / 498 \\
21.2 Linked-list representation of disjoint sets / 501
\\
21.3 Disjoint-set forests / 505 \\
* 21.4 Analysis of union by rank with path compression
/ 509 \\
VI Graph Algorithms \\
Introduction / 525 \\
22 Elementary Graph Algorithms / 527 \\
22.1 Representations of graphs / 527 \\
22.2 Breadth-first search / 531 \\
22.3 Depth-first search / 540 \\
22.4 Topological sort / 549 \\
22.5 Strongly connected components / 552 \\
23 Minimum Spanning Trees / 561 \\
23.1 Growing a minimum spanning tree / 562 \\
23.2 The algorithms of Kruskal and Prim / 567 \\
24 Single-Source Shortest Paths / 580 \\
24.1 The Bellman--Ford algorithm / 588 \\
24.2 Single-source shortest paths in directed acyclic
graphs / 592 \\
24.3 Dijkstra's algorithm / 595 \\
24.4 Difference constraints and shortest paths / 607
\\
24.5 Proofs of shortest-paths properties / 607 \\
25 All-Pairs Shortest Paths / 620 \\
25.1 Shortest paths and matrix multiplication / 622 \\
25.2 The Floyd--Warshall algorithm / 629 \\
25.3 Johnson's algorithm for sparse graphs / 636 \\
26 Maximum Flow / 643 \\
26.1 Flow networks / 644 \\
26.2 The Ford--Fulkerson method / 657 \\
26.3 Maximum bipartite matching / 664 \\
* 26.4 Push-relabel algorithms / 669 \\
26.5 The relabel-to-front algorithm / 681 \\
VII Selected Topics \\
Introduction / 701 \\
27 Sorting Networks / 704 \\
21 Comparison networks / 704 \\
27.2 The zero-one principle / 709 \\
21.3 A bitonic sorting network / 712 \\
21.4 A merging network / 716 \\
27.5 A sorting network / 719 \\
28 Matrix Operations / 725 \\
28.1 Properties of matrices / 725 \\
28.2 Strassen's algorithm for matrix multiplication /
735 \\
28.3 Solving systems of linear equations / 742 \\
28.4 Inverting matrices / 755 \\
28.5 Symmetric positive-definite matrices and
least-squares approximation / 760 \\
29 Linear Programming / 770 \\
29.1 Standard and slack forms / 777 \\
29.2 Formulating problems as linear programs / 785 \\
29.3 The simplex algorithm / 790 \\
29.4 Duality / 804 \\
29.5 The initial basic feasible solution Si / 7 \\
30 Polynomials and the FFT / 822 \\
30.1 Representation of polynomials / 824 \\
30.2 The DFT and FFT / 830 \\
30.3 Efficient FFT implementations / 839 \\
31 Number-Theoretic Algorithms / 849 \\
31.1 Elementary number-theoretic notions / 850 \\
31.2 Greatest common divisor / 856 \\
31.3 Modular arithmetic / 862 \\
31.4 Solving modular linear equations / 869 \\
31.5 The Chinese remainder theorem / 873 \\
31.6 Powers of an element / 876 \\
31.7 The RSA public-key cryptosystem / 881 \\
31.8 Primality testing / 887 \\
31.9 Integer factorization / 896 \\
32 String Matching / 906 \\
32.1 The naive string-matching algorithm / 909 \\
32.2 The Rabin--Karp algorithm / 911 \\
32.3 String matching with finite automata / 976 \\
32.4 The Knuth--Morris--Pratt algorithm / 923 \\
33 Computational Geometry / 933 \\
33.1 Line-segment properties / 934 \\
33.2 Determining whether any pair of segments
intersects / 940 \\
33.3 Finding the convex hull / 947 \\
33.4 Finding the closest pair of points / 957 \\
34 NP-Completeness / 966 \\
34.1 Polynomial time / 971 \\
34.2 Polynomial-time verification / 979 \\
34.3 NP-completeness and reducibility / 984 \\
34.4 NP-completeness proofs / 995 \\
34.5 NP-complete problems / 1003 \\
35 Approximation Algorithms / 1022 \\
35.1 The vertex-cover problem / 1024 \\
35.2 The traveling-salesman problem / 7027 \\
35.3 The set-covering problem / 1033 \\
35.4 Randomization and linear programming / 7039 \\
35.5 The subset-sum problem / 1043 \\
VIII Appendix: Mathematical Background \\
Introduction / 1057 \\
A Summations / 1058 \\
A.1 Summation formulas and properties / 1058 \\
A.2 Bounding summations / 1062",
}
@Article{Coron:2001:GGC,
author = "Jean-S{\'e}bastien Coron and Helena Handschuh and Marc
Joye and Pascal Paillier and David Pointcheval and
Christophe Tymen",
title = "{GEM}: a {Generic} Chosen-Ciphertext Secure
{Encryption Method}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "263--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710263.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710263.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Coron:2001:OCC,
author = "Jean-S{\'e}bastien Coron and Helena Handschuh and Marc
Joye and Pascal Paillier and David Pointcheval and
Christophe Tymen",
title = "Optimal Chosen-Ciphertext Secure Encryption of
Arbitrary-Length Messages",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "17--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740017.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740017.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Coron:2001:SSL,
author = "Jean-S{\'e}bastien Coron and Paul Kocher and David
Naccache",
title = "Statistics and Secret Leakage",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "157--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620157.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620157.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Coulter:2001:GAH,
author = "Robert S. Coulter and George Havas and Marie
Henderson",
booktitle = "Computer mathematics (Matsuyama, 2001)",
title = "{Giesbrecht}'s algorithm, the {HFE} cryptosystem and
{Ore}'s {$ p^s $}-polynomials",
volume = "9",
publisher = pub-WORLD-SCI,
address = pub-WORLD-SCI:adr,
pages = "36--45",
year = "2001",
MRclass = "11T71 (16S35 94A60)",
MRnumber = "1 877 440",
MRreviewer = "Steven L. Swanson",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Lecture Notes Ser. Comput.",
}
@Article{Courtois:2001:EZK,
author = "Nicolas T. Courtois",
title = "Efficient Zero-Knowledge Authentication Based on a
Linear Algebra Problem {MinRank}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "402--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480402.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480402.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Courtois:2001:HAM,
author = "Nicolas T. Courtois and Matthieu Finiasz and Nicolas
Sendrier",
title = "How to Achieve a {McEliece}-Based Digital Signature
Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "157--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480157.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480157.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Cramer:2001:CRS,
author = "Ronald Cramer and Ivan Damg{\aa}rd and Serge Fehr",
title = "On the Cost of Reconstructing a Secret, or {VSS} with
Optimal Reconstruction Phase",
crossref = "Kilian:2001:ACC",
pages = "503--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390503.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390503.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InCollection{Cramer:2001:MCT,
author = "Ronald Cramer and Ivan Damg{\aa}rd and Jesper B.
Nielsen",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "Multiparty Computation from Threshold Homomorphic
Encryption",
volume = "2045",
publisher = pub-SV,
address = pub-SV:adr,
pages = "280--300",
year = "2001",
MRclass = "94A60",
MRnumber = "1 895 439",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450280.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450280.pdf",
}
@InProceedings{Cramer:2001:SDL,
author = "Ronald Cramer and Ivan Damg{\aa}rd",
title = "Secure Distributed Linear Algebra in a Constant Number
of Rounds",
crossref = "Kilian:2001:ACC",
pages = "119--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390119.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390119.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Crawford:2001:FHC,
author = "Diane Crawford and Mick Zraly and Hal Berghel and Ken
Pugh and Mat H. West and Conrad Weisert and Terry
Steyaert and Richard Johnson",
title = "Forum: How Can the {Web} Advance {Western}
Democracies? Who Needs Digital Signatures;
Misinformation and the {Emulex} Hoax; {OOSCD} Not
Really So Unified; Go Back to Non-{OOSD}",
journal = j-CACM,
volume = "44",
number = "2",
pages = "11--13",
month = feb,
year = "2001",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Feb 05 18:28:34 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Schneier:2000:IRS}.",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2001-44-2/p11-crawford/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Crawford:2001:FPV,
author = "Diane Crawford and Thomas Tiahrt and Moti Ben-Ari and
Matt West and Hans A. von Spakovsky and Deborah
Phillips",
title = "Forum: Participatory Vs. Representative Democracy; Why
Store Everything?; {Emulex} Hoax; Correction",
journal = j-CACM,
volume = "44",
number = "4",
pages = "13--15",
month = apr,
year = "2001",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Apr 7 07:56:05 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Schneier:2000:IRS,Phillips:2001:GRI}.",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2001-44-4/p13-crawford/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Crouch:2001:LAR,
author = "P. A. Crouch and J. H. Davenport",
title = "Lattice Attacks on {RSA}-Encrypted {IP} and {TCP}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "329--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600329.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600329.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Crowley:2001:MFL,
author = "Paul Crowley",
title = "{Mercy}: a Fast Large Block Cipher for Disk Sector
Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "49--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780049.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780049.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Daemen:2001:AAR,
author = "Joan Daemen and Vincent Rijmen",
title = "Algorithm Alley: {Rijndael}: The {Advanced Encryption
Standard}",
journal = j-DDJ,
volume = "26",
number = "3",
pages = "137--139",
month = mar,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Feb 15 12:14:41 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2001/2001_03/aa0301.txt;
http://www.esat.kuleuven.ac.be/~rijmen/rijndael/",
abstract = "NIST has announced that the Rijndael algorithm was the
winner of its Advanced Encryption Standard competition.
Joan and Vincent, its inventors, lift the hood on the
algorithm. Additional resources include aa0301.txt
(listings).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Daemen:2001:BCP,
author = "Joan Daemen and Michael Peeters and Gilles {Van
Assche}",
title = "Bitslice Ciphers and Power Analysis Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "134--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780134.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780134.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dai:2001:CDE,
author = "Qiong Dai and Xiao Xiang Zou and Zhu Kai Luo",
title = "Cracking a data encryption and decryption system using
multi-valued logic array",
journal = j-CHIN-J-COMPUTERS,
volume = "24",
number = "6",
pages = "654--656",
year = "2001",
CODEN = "JIXUDT",
ISSN = "0254-4164",
MRclass = "94A60",
MRnumber = "1 852 016",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Chinese Journal of Computers. Jisuanji Xuebao",
}
@Article{Dale:2001:BSA,
author = "Richard Dale",
title = "Biometric Security: It's all about identification and
authentication",
journal = j-DDJ,
volume = "26",
number = "11",
pages = "93--94, 96",
month = nov,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:40 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
abstract = "Biometrics offers a strong authentication alternative
to traditional passwords and tokens, and can do so
without imposing the burden and cost of application
source-code modification.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Damgaard:2001:GSS,
author = "Ivan Damg{\aa}rd and Mads Jurik",
title = "A Generalisation, a Simplification and Some
Applications of {Paillier}'s Probabilistic Public-Key
System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "119--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920119.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920119.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Damgaard:2001:PTR,
author = "Ivan Damg{\aa}rd and Maciej Koprowski",
title = "Practical Threshold {RSA} Signatures without a Trusted
Dealer",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "152--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:02 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450152.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450152.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dandalis:2001:CSP,
author = "Andreas Dandalis and Viktor K. Prasanna and Jose D. P.
Rolim",
title = "A Comparative Study of Performance of {AES} Final
Candidates Using {FPGAs}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "125--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650125.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650125.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Danielyan:2001:AAE,
author = "Edgar Danielyan",
title = "{AES}: {Advanced Encryption Standard} is Coming",
journal = j-LOGIN,
volume = "26",
number = "1",
pages = "??--??",
month = feb,
year = "2001",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:45:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.usenix.org/publications/login/2001-02/index.html",
URL = "http://www.usenix.org/publications/login/2001-02/pdfs/danielyan.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@InProceedings{Davis:2001:DSA,
author = "Don Davis",
title = "Defective {Sign \& Encrypt} in {S/MIME}, {PKCS\#7},
{MOSS}, {PEM}, {PGP}, and {XML}",
crossref = "USENIX:2001:PUA",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 17:19:08 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix01/davis.html",
acknowledgement = ack-nhfb,
}
@Article{Davis:2001:DSE,
author = "Don Davis",
title = "Defective Sign-and-Encrypt: Can you really trust
{S/MIME}, {PCKS\#7}, {PGP}, and {XML}?",
journal = j-DDJ,
volume = "26",
number = "11",
pages = "30",
month = nov,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:40 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
abstract = "Over the past 25 years, most security protocols have
focused on securing network connections, ignoring
relatively simple file-encryption problems. Don
presents guidelines for avoiding a common security
pitfall when combining encryption with digital
signatures.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Book{Davis:2001:ISV,
author = "Carlton R. Davis",
title = "{IPSec}: Securing {VPNs}",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "xix + 404",
year = "2001",
ISBN = "0-07-212757-0",
ISBN-13 = "978-0-07-212757-7",
LCCN = "TK5105.567 D38 200",
bibdate = "Wed Jun 06 18:29:48 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.99",
acknowledgement = ack-nhfb,
}
@Article{Dawu:2001:TES,
author = "Gu Dawu and Wang Yi",
title = "On the techniques of enhancing the security of block
ciphers",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "94--96",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@InProceedings{DeSantis:2001:RNI,
author = "Alfredo {De Santis} and Giovanni {Di Crescenzo} and
Rafail Ostrovsky and Giuseppe Persiano and Amit Sahai",
title = "Robust Non-interactive Zero Knowledge",
crossref = "Kilian:2001:ACC",
pages = "566--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390566.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390566.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Desmedt:2001:ERD,
author = "Yvo Desmedt and Mike Burmester and Jennifer Seberry",
title = "Equitability in Retroactive Data Confiscation versus
Proactive Key Escrow",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "277--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920277.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920277.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dhem:2001:HSS,
author = "Jean-Fran{\c{c}}ois Dhem and Nathalie Feyt",
title = "Hardware and Software Symbiosis Helps Smart Card
Evolution",
journal = j-IEEE-MICRO,
volume = "21",
number = "6",
pages = "14--25",
month = nov # "\slash " # dec,
year = "2001",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.977754",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jan 31 18:42:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mi/books/mi2001/m6014abs.htm;
http://dlib.computer.org/mi/books/mi2001/pdf/m6014.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{DiCrescenzo:2001:SOS,
author = "Giovanni {Di Crescenzo}",
title = "Sharing One Secret vs. Sharing Many Secrets: Tight
Bounds for the Max Improvement Ratio",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2136",
pages = "292--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2136.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2136/21360292.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2136/21360292.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Diffie:2001:UC,
author = "Whitfield Diffie",
title = "Ultimate cryptography",
journal = j-CACM,
volume = "44",
number = "3",
pages = "84--86",
month = mar,
year = "2001",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/365181.365214",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Mar 13 18:15:02 MST 2001",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cacm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2001-44-3/p84-diffie/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Ding:2001:OTB,
author = "Yan Zong Ding",
title = "Oblivious Transfer in the Bounded Storage Model",
crossref = "Kilian:2001:ACC",
pages = "155--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390155.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390155.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Dittmann:2001:UCW,
author = "Jana Dittmann and Petra Wohlmacher and Klara
Nahrstedt",
title = "Using Cryptographic and Watermarking Algorithms",
journal = j-IEEE-MULTIMEDIA,
volume = "8",
number = "4",
pages = "54--65",
month = oct,
year = "2001",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.959103",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 23 11:55:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mu/books/mu2001/pdf/u4054.pdf;
http://www.computer.org/multimedia/mu2001/u4054abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Djurovic:2001:DWF,
author = "Igor Djurovic and Srdjan Stankovic and Ioannis Pitas",
title = "Digital watermarking in the fractional {Fourier}
transformation domain",
journal = j-J-NETW-COMPUT-APPL,
volume = "24",
number = "2",
pages = "167--173",
month = apr,
year = "2001",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:42:39 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804500901280",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Dodis:2001:PAS,
author = "Yevgeniy Dodis and Amit Sahai and Adam Smith",
title = "On Perfect and Adaptive Security in Exposure-Resilient
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "301--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:02 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450301.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450301.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Domingo-Ferrer:2001:CDS,
author = "Josep Domingo-Ferrer and Pieter Hartel",
title = "Current directions in smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "4",
pages = "377--379",
day = "16",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/61/28/25/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/61/28/25/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Donsez:2001:TMA,
author = "Didier Donsez and S{\'e}bastien Jean and Sylvain
Lecomte and Olivier Thomas",
title = "Turning Multi-applications Smart Cards Services
Available from Anywhere at Anytime: a {SOAP \slash MOM}
Approach in the Context of {Java} Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "83--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400083.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400083.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Du:2001:OKS,
author = "Wei Zhang Du and Xin Mei Wang",
title = "One kind of secret-code encryption scheme based on
maximum rank distance codes",
journal = j-CHIN-J-COMPUTERS,
volume = "24",
number = "6",
pages = "650--653",
year = "2001",
CODEN = "JIXUDT",
ISSN = "0254-4164",
MRclass = "94A60 (94B60)",
MRnumber = "1 852 015",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Chinese Journal of Computers. Jisuanji Xuebao",
}
@Article{Durante:2001:CWR,
author = "Antonio Durante and Riccardo Focardi and Roberto
Gorrieri",
title = "{CVS} at Work: a Report on New Failures upon Some
Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2052",
pages = "287--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2052.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2052/20520287.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2052/20520287.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Duranti:2001:LTP,
author = "Luciana Duranti",
title = "The Long-Term Preservation of Authentic Electronic
Records",
crossref = "Apers:2001:PTS",
pages = "625--628",
year = "2001",
bibdate = "Thu Feb 21 17:51:12 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb2001.html",
URL = "http://www.vldb.org/conf/2001/P625.pdf",
acknowledgement = ack-nhfb,
annote = "link",
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/d/Duranti:Luciana.html",
}
@Article{Eggers:2001:DWC,
author = "Joachim J. Eggers and Wolf-Dietrich Ihlenfeldt and
Bernd Girod",
title = "Digital Watermarking of Chemical Structure Sets",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "200--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370200.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370200.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Eghlidos:2001:IRL,
author = "Taraneh Eghlidos and Albrecht Beutelspacher and Babak
Sadeghiyan",
title = "Improving the resistance of {DES} and {DES}-like
cryptosystems against differential cryptanalysis",
journal = "Atti Sem. Mat. Fis. Univ. Modena",
volume = "49",
number = "1",
pages = "147--169",
year = "2001",
CODEN = "ASMMAK",
ISSN = "0041-8986",
MRclass = "94A60",
MRnumber = "2002d:94039",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Atti del Seminario Matematico e Fisico
dell'Universit\`a di Modena",
}
@Article{El-Kassar:2001:GPK,
author = "A. N. El-Kassar and Mohamed Rizk and N. M. Mirza and
Y. A. Awad",
title = "{El-Gamal} public key cryptosystem in the domain of
{Gaussian} integers",
journal = "Int. J. Appl. Math.",
volume = "7",
number = "4",
pages = "405--412",
year = "2001",
ISSN = "1311-1728",
MRclass = "94A60 (11T71)",
MRnumber = "1 856 865",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "International Journal of Applied Mathematics",
}
@Article{Erickson:2001:EDD,
author = "Jonathan Erickson",
title = "Editorial: From the {Department of Dumb Ideas}",
journal = j-DDJ,
volume = "26",
number = "3",
pages = "8--8",
month = mar,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Feb 15 12:14:41 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
keywords = "Content Protection for Recordable Media (CPRM)",
}
@Article{Felkel:2001:ICW,
author = "Petr Felkel and Mario Bruckschwaiger and Rainer
Wegenkittl",
title = "Implementation and Complexity of the
Watershed-from-Markers Algorithm Computed as a Minimal
Cost Forest",
journal = j-CGF,
volume = "20",
number = "3",
pages = "??--??",
month = sep,
year = "2001",
CODEN = "CGFODY",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Thu Feb 21 09:14:37 2002",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Ferguson:2001:ICRa,
author = "Niels Ferguson and John Kelsey and Stefan Lucks and
Bruce Schneier and Mike Stay and David Wagner and Doug
Whiting",
title = "Improved Cryptanalysis of {Rijndael}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "213--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780213.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780213.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Ferguson:2001:ICRb,
author = "N. Ferguson and J. Kelsey and S. Lucks and B. Schneier
and M. Stay and D. Wagner and D. Whiting",
title = "Improved Cryptanalysis of {Rijndael}",
crossref = "Schneier:2001:FSE",
pages = "19--??",
year = "2001",
bibdate = "Mon Oct 16 08:07:47 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.counterpane.com/rijndael.html;
http://www.counterpane.com/rijndael.ps.zip",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Article{Ferguson:2001:SAR,
author = "Niels Ferguson and Richard Schroeppel and Doug
Whiting",
title = "A Simple Algebraic Representation of {Rijndael}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "103--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590103.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590103.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Filiol:2001:NUS,
author = "Eric Filiol and Caroline Fontaine",
title = "A New Ultrafast Stream Cipher Design: {COS} Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "85--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600085.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600085.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Manual{FIPS:2001:AES,
author = "{FIPS}",
title = "{Advanced Encryption Standard (AES)}",
volume = "197",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "iv + 47",
day = "26",
month = nov,
year = "2001",
bibdate = "Thu Aug 18 07:16:02 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "FIPS PUB",
URL = "http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf",
acknowledgement = ack-nhfb,
keywords = "AES; computer security; cryptography",
}
@Manual{FIPS:2001:SRC,
author = "{FIPS}",
title = "Security Requirements for Cryptographic Modules",
volume = "140-2",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "viii + 61",
day = "25",
month = may,
year = "2001",
bibdate = "Thu Aug 18 07:16:02 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Annex A: Approved Security Functions (19 May 2005);
Annex B: Approved Protection Profiles (04 November
2004); Annex C: Approved Random Number Generators (31
January 2005); Annex D: Approved Key Establishment
Techniques (30 June 2005). Supersedes FIPS PUB 140-1,
1994 January 11.",
series = "FIPS PUB",
URL = "http://csrc.nist.gov/publications/fips/fips140-2/fips1402.pdf;
http://csrc.nist.gov/publications/fips/fips140-2/fips1402annexa.pdf;
http://csrc.nist.gov/publications/fips/fips140-2/fips1402annexb.pdf;
http://csrc.nist.gov/publications/fips/fips140-2/fips1402annexc.pdf;
http://csrc.nist.gov/publications/fips/fips140-2/fips1402annexd.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography",
}
@Article{Fischer:2001:TMR,
author = "V. Fischer and M. Drutarovsk{\'y}",
title = "Two Methods of {Rijndael} Implementation in
Reconfigurable Hardware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "77--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620077.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620077.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fischlin:2001:CLP,
author = "Marc Fischlin",
title = "Cryptographic limitations on parallelizing membership
and equivalence queries with applications to
random-self-reductions",
journal = j-THEOR-COMP-SCI,
volume = "268",
number = "2",
pages = "199--219",
day = "17",
month = oct,
year = "2001",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Nov 19 08:33:26 MST 2001",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/217/31/29/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/217/31/29/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Fischlin:2001:ICN,
author = "Marc Fischlin",
title = "On the Impossibility of Constructing Non-interactive
Statistically-Secret Protocols from Any Trapdoor
One-Way Function",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "79--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710079.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710079.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Fitzi:2001:MCP,
author = "Matthias Fitzi and Juan A. Garay and Ueli Maurer and
Rafail Ostrovsky",
title = "Minimal Complete Primitives for Secure Multi-party
Computation",
crossref = "Kilian:2001:ACC",
pages = "80--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390080.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390080.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Book{Flannery:2001:CYW,
author = "Sarah Flannery and David Flannery",
title = "In Code: a [Young Women's] Mathematical Journey",
publisher = "Algonquin Books of Chapel Hill",
address = "Chapel Hill, NC, USA",
pages = "ix + 341",
year = "2001",
ISBN = "1-56512-377-8",
ISBN-13 = "978-1-56512-377-9",
LCCN = "QA29.F6 A3 2003",
bibdate = "Tue Feb 18 10:28:42 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$13.95",
abstract = "In January 1999, Sarah Flannery, a sports-loving
teenager from Blarney in County Cork, won Ireland's
Young Scientist of the Year award for her extraordinary
research and discoveries in Internet cryptography. Soon
her story and photograph were splashed across the front
page of the London Times, where she was called
``brilliant.'' Her discoveries earned her the title
European Young Scientist of the Year. Just sixteen, she
was suddenly a mathematician with an international
reputation. Here is the story of how a girl next door
moved from the simple math puzzles that were the staple
of her family's dinnertime conversation to prime
numbers, the Sieve of Eratosthenes, Fermat's Little
Theorem, googols --- and finally into her breathtaking
algorithm. Parallel with each step is a modest girl's
own self-discovery. It's a heartwarming story that will
have readers cheering Sarah on.",
acknowledgement = ack-nhfb,
keywords = "Cayley--Purser (CP) encryption; cryptography; RSA",
tableofcontents = "Foreword / vii \\
Preface / ix \\
Part I: Background / 1 \\
1: Early influences / 3 \\
2: Early challenges / 8 \\
3: Beginning my first project / 32 \\
Part II: Mathematical excursions / 41 \\
4: Dad's evening class / 43 \\
5: Of prime importance / 47 \\
6: The Arithmetic of cryptography / 71 \\
7: Sums with a difference / 113 \\
8: One way only / 149 \\
9: Public key cryptography / 164 \\
Part III: Exhibition time / 187 \\
10: Young scientist '98 / 189 \\
11: Birth of a project / 194 \\
12: Young scientist '99 / 218 \\
Part IV: After-math / 229 13: Media blitz / 231 \\
14: Around the world and back / 254 \\
About this book / 269 \\
Appendix A: ``Cryptography --- New algorithm versus the
RSA'' / 271 \\
Appendix B: Answers to miscellaneous questions / 297
\\
Appendix C: Euclid's algorithm / 305 \\
Appendix D: Euler $\phi$-function and the Euler--Fermat
Theorem / 315 \\
Acknowledgments / 320 \\
Bibliography / 323 \\
Index / 325",
}
@Article{Fluhrer:2001:AES,
author = "Scott Fluhrer and Stefan Lucks",
title = "Analysis of the {$ E_0 $} Encryption System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "38--48",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590038.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590038.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Fluhrer:2001:WKS,
author = "Scott Fluhrer and Itsik Mantin and Adi Shamir",
editor = "Serge Vaudenay and Amr M. Youssef",
booktitle = "{Selected areas in cryptography: 8th Annual
International Workshop, SAC 2001, Toronto, Ontario,
Canada, August 16--17, 2001: revised papers}",
title = "Weaknesses in the Key Scheduling Algorithm of {RC4}",
volume = "2259",
publisher = pub-SV,
address = pub-SV:adr,
pages = "1--24",
year = "2001",
ISBN = "3-540-43066-0",
ISBN-13 = "978-3-540-43066-7",
LCCN = "QA76.9.A25 S22 2001",
bibdate = "Mon Jan 23 06:38:15 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://dl.acm.org/citation.cfm?id=694759;
http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
http://www.crypto.com/papers/others/rc4_ksaproc.pdf;
http://www.loc.gov/catdir/enhancements/fy0817/2002511206-d.html",
abstract = "In this paper we present several weaknesses in the key
scheduling algorithm of RC4, and describe their
cryptanalytic significance. We identify a large number
of weak keys, in which knowledge of a small number of
key bits suffices to determine many state and output
bits with non-negligible probability. We use these weak
keys to construct new distinguishers for RC4, and to
mount related key attacks with practical complexities.
Finally, we show that RC4 is completely insecure in a
common mode of operations which is used in the
widely-deployed Wired Equivalent Privacy protocol (WEP,
which is part of the 802.11 standard), in which a fixed
secret key is concatenated with known IV modifiers in
order to encrypt different messages. Our new passive
ciphertext-only attack on this mode can recover an
arbitrarily long key in a negligible amount of time
which grows only linearly with its size, both for 24
and 128 bit IV modifiers.",
acknowledgement = ack-nhfb,
remark = "The Fedora Linux {\tt airsnort} package implements an
attack on WEP. From its description: ``AirSnort is a
wireless LAN (WLAN) tool which recovers encryption
keys. AirSnort operates by passively monitoring
transmissions, computing the encryption key when enough
packets have been gathered.\par
802.11b, using the Wired Equivalent Protocol (WEP), is
crippled with numerous security flaws. Most damning of
these is the weakness described in ``Weaknesses in the
Key Scheduling Algorithm of RC4'' by Scott Fluhrer,
Itsik Mantin and Adi Shamir. Adam Stubblefield was the
first to implement this attack, but he has not made his
software public. AirSnort, along with WEPCrack, which
was released about the same time as AirSnort, are the
first publicly available implementations of this
attack.\par
AirSnort requires approximately 5--10 million encrypted
packets to be gathered. Once enough packets have been
gathered, AirSnort can guess the encryption password in
under a second.'' That attack is improved to need only
about $ 2^{15} $ packets in \cite{Vaudenay:2007:POK}.",
}
@Book{Ford:2001:SEC,
author = "Warwick Ford and Michael S. Baum",
title = "Secure electronic commerce: building the
infrastructure for digital signatures and encryption",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
edition = "Second",
pages = "xxv + 612",
year = "2001",
ISBN = "0-13-203795-5 (paperback)",
ISBN-13 = "978-0-13-203795-2 (paperback)",
LCCN = "QA76.9.A25 F655 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "business communication --- security measures; computer
networks --- security measures; computer security",
}
@Article{Fouque:2001:FDT,
author = "Pierre-Alain Fouque and Jacques Stern",
title = "Fully Distributed Threshold {RSA} under Standard
Assumptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "310--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480310.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480310.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fouque:2001:SDC,
author = "Pierre-Alain Fouque and Guillaume Poupard and Jacques
Stern",
title = "Sharing Decryption in the Context of Voting or
Lotteries",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "90--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620090.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620090.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fouque:2001:TCS,
author = "Pierre-Alain Fouque and David Pointcheval",
title = "Threshold Cryptosystems Secure against
Chosen-Ciphertext Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "351--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480351.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480351.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fox:2001:PPK,
author = "Barbara Fox and Brian LaMacchia",
title = "Panel: Public Key Infrastructure: {PKIX}, Signed {XML}
or Something Else?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "327--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620327.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620327.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Frankel:2001:ASA,
author = "Yair Frankel and Philip D. MacKenzie and Moti Yung",
title = "Adaptive Security for the Additive-Sharing Based
Proactive {RSA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "240--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920240.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920240.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Friberg:2001:UCH,
author = "Paul Friberg",
title = "Using a Cryptographic Hardware Token with {Linux}: The
{OpenSSL} Project's New Engine",
journal = j-LINUX-J,
volume = "89",
pages = "??--??",
month = sep,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Aug 30 06:06:53 MDT 2001",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue89/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Web only.",
URL = "http://www.linuxjournal.com/articles/style/0006.html",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Fridrich:2001:DLS,
author = "Jessica Fridrich and Miroslav Goljan and Rui Du",
title = "Detecting {LSB} Steganography in Color and Gray-Scale
Images",
journal = j-IEEE-MULTIMEDIA,
volume = "8",
number = "4",
pages = "22--28",
month = oct,
year = "2001",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.959097",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 23 11:55:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mu/books/mu2001/pdf/u4022.pdf;
http://www.computer.org/multimedia/mu2001/u4022abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Friedlander:2001:DDH,
author = "John B. Friedlander and Igor E. Shparlinski",
title = "On the Distribution of {Diffie--Hellman} Triples with
Sparse Exponents",
journal = j-SIAM-J-DISCR-MATH,
volume = "14",
number = "2",
pages = "162--169",
year = "2001",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480199361740",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Fri Apr 6 20:26:58 MDT 2001",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/14/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/36174",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@InProceedings{Fu:2001:DCA,
author = "Kevin Fu and Emil Sit and Kendra Smith and Nick
Feamster",
title = "The Dos and Don'ts of Client Authentication on the
{Web}",
crossref = "USENIX:2001:PTU",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/fu.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Fujisaki:2001:ROS,
author = "Eiichiro Fujisaki and Tatsuaki Okamoto and David
Pointcheval and Jacques Stern",
title = "{RSA--OAEP} Is Secure under the {RSA} Assumption",
crossref = "Kilian:2001:ACC",
pages = "260--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390260.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390260.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@MastersThesis{Furman:2001:CSM,
author = "Vladimir Furman",
title = "Cryptanalysis of some modern blockciphers",
type = "Thesis ({Master's})",
school = "Faculty of Computer Science, Technion --- Israel
Institute of Technology",
address = "Haifa, Israel",
pages = "75",
year = "2001",
bibdate = "Fri May 13 06:27:16 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
advisor = "Eli Biham",
remark = "Added title page and abstract in Hebrew.",
}
@InProceedings{Furukawa:2001:ESP,
author = "Jun Furukawa and Kazue Sako",
title = "An Efficient Scheme for Proving a Shuffle",
crossref = "Kilian:2001:ACC",
pages = "368--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390368.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390368.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Fuster-Sabater:2001:EAG,
author = "A. F{\'u}ster-Sabater and L. J. Garc{\'\i}a-Villalba",
title = "An efficient algorithm to generate binary sequences
for cryptographic purposes",
journal = j-THEOR-COMP-SCI,
volume = "259",
number = "1--2",
pages = "679--688",
day = "28",
month = may,
year = "2001",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Jul 25 18:49:24 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/202/21/54/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/202/21/54/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InCollection{Gaj:2001:FIF,
author = "Kris Gaj and Pawel Chodowiec",
booktitle = "Topics in cryptology---CT-RSA 2001 (San Francisco,
CA)",
title = "Fast Implementation and Fair Comparison of the Final
Candidates for {Advanced Encryption Standard} Using
Field Programmable Gate Arrays",
volume = "2020",
publisher = pub-SV,
address = pub-SV:adr,
pages = "84--99",
year = "2001",
MRclass = "94A60",
MRnumber = "1 907 091",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200084.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200084.pdf",
}
@TechReport{Galbraith:2001:CNR,
author = "Steven D. Galbraith and Wenbo Mao and Kenneth G.
Paterson",
title = "A Cautionary Note Regarding Cryptographic Protocols
Based on Composite Integers",
type = "Report",
number = "HPL-2001-284",
institution = "HP Laboratories Bristol",
address = "Bristol, UK",
day = "8",
month = nov,
year = "2001",
bibdate = "Sat Sep 17 10:57:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.hpl.hp.com/techreports/2001/HPL-2001-284.html",
abstract = "These days it is rather common in cryptology to see
ideas which originated in the setting of finite fields
being extended to $ Z*N $. However, the security
results do not necessarily generalise to $ Z*N $. In
this paper we illustrate this phenomenon by pointing
out a flaw in the soundness proof of a zero-knowledge
protocol in a timed commitment scheme of Boneh and
Naor",
acknowledgement = ack-nhfb,
}
@Article{Galbraith:2001:RBU,
author = "Steven D. Galbraith and Wenbo Mao and Kenneth G.
Paterson",
title = "{RSA}-Based Undeniable Signatures for General Moduli",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "200--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710200.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710200.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Galbraith:2001:SCC,
author = "Steven D. Galbraith",
title = "Supersingular Curves in Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "495--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480495.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480495.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gallant:2001:FPM,
author = "Robert P. Gallant and Robert J. Lambert and Scott A.
Vanstone",
title = "Faster Point Multiplication on Elliptic Curves with
Efficient Endomorphisms",
crossref = "Kilian:2001:ACC",
pages = "190--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390190.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390190.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InProceedings{Ganger:2001:AC,
author = "G. R. Ganger",
title = "Authentication Confidences",
crossref = "IEEE:2001:EIW",
pages = "169--169",
year = "2001",
bibdate = "Fri Feb 22 11:41:03 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
OCLC Proceedings database",
acknowledgement = ack-nhfb,
}
@Book{Gannon:2001:SST,
author = "James Gannon",
title = "Stealing Secrets, Telling Lies: How Spies and
Codebreakers Helped Shape the {Twentieth Century}",
publisher = "Brassey's",
address = "Washington, DC, USA",
pages = "xi + 324",
year = "2001",
ISBN = "1-57488-367-4, 1-57488-473-5, 1-61234-207-8",
ISBN-13 = "978-1-57488-367-1, 978-1-57488-473-9,
978-1-61234-207-8",
LCCN = "JF 1525 .I6G36 2001X ROBA; JF1525.I6 G36 2001",
bibdate = "Sun Dec 1 09:25:44 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
sirsi.library.utoronto.ca:2200/UNICORN",
acknowledgement = ack-nhfb,
subject = "Espionage; International relations",
}
@Book{Garrett:2001:MBC,
author = "Paul B. Garrett",
title = "Making, breaking codes: an introduction to
cryptology",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xix + 524",
year = "2001",
ISBN = "0-13-030369-0",
ISBN-13 = "978-0-13-030369-1",
LCCN = "QA268 .G37 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "coding theory",
}
@Article{Gasarch:2001:BRBa,
author = "William Gasarch",
title = "Book Review: {{\booktitle{The Codebreakers: the Story
of Secret Writing}}, by David Kahn. Scribner}",
journal = j-SIGACT,
volume = "32",
number = "2",
pages = "5--6",
month = jun,
year = "2001",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/504192.1005762",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:24 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See
\cite{Kahn:1967:CSSa,Kahn:1967:CSSb,Kahn:1974:C,Kahn:1996:CSS}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Gengler:2001:PPS,
author = "Barbara Gengler",
title = "{Princeton} Poll Shows 56\% Favour Crypto
Regulations",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "11",
pages = "5--6",
day = "30",
month = nov,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)01112-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801011126",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Gennaro:2001:RCV,
author = "Rosario Gennaro and Yuval Ishai and Eyal Kushilevitz
and Tal Rabin",
title = "The round complexity of verifiable secret sharing and
secure multicast",
crossref = "ACM:2001:PAA",
pages = "580--589",
year = "2001",
bibdate = "Wed Feb 20 18:37:27 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Gentry:2001:CNS,
author = "Craig Gentry and Jakob Jonsson and Jacques Stern and
Michael Szydlo",
title = "Cryptanalysis of the {NTRU Signature Scheme (NSS)}
from {Eurocrypt 2001}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gilbert:2001:SAR,
author = "H. Gilbert and H. Handschuh and A. Joux and Serge
Vaudenay",
title = "A Statistical Attack on {RC6}",
crossref = "Schneier:2001:FSE",
pages = "??--??",
year = "2001",
bibdate = "Mon Oct 16 08:34:27 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Article{Giuliani:2001:GLI,
author = "Kenneth J. Giuliani and Guang Gong",
title = "Generating Large Instances of the {Gong--Harn}
Cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "317--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600317.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600317.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Goldreich:2001:FCBa,
author = "Oded Goldreich",
title = "Foundations of Cryptography: Basic Tools",
volume = "1",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xix + 372",
year = "2001",
ISBN = "0-521-03536-8 (paperback ), 0-521-79172-3
(hardcover)",
ISBN-13 = "978-0-521-03536-1 (paperback ), 978-0-521-79172-4
(hardcover)",
LCCN = "QA268 .G5745 2001",
bibdate = "Fri Mar 23 10:23:59 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
note = "See also volume 2 \cite{Goldreich:2004:FCV}.",
price = "US\$54.95 (hardcover)",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Mathematics",
tableofcontents = "List of figures \\
Preface \\
Acknowledgements \\
5. Encryption schemes \\
6. Digital signatures and message authentication \\
7. General cryptographic protocols \\
Appendix C: corrections and additions to volume I \\
Bibliography \\
Index",
}
@Book{Goldreich:2001:FCBb,
author = "Oded Goldreich",
title = "Foundations of Cryptography: Basic Applications",
volume = "2",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xii + 373--798",
year = "2001",
ISBN = "0-521-83084-2 (hardcover)",
ISBN-13 = "978-0-521-83084-3 (hardcover)",
LCCN = "QA268.G5745 2001",
bibdate = "Wed Jan 16 10:57:08 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See also volume 2 \cite{Goldreich:2004:FCV}.",
price = "US\$54.95 (hardcover)",
acknowledgement = ack-nhfb,
}
@InProceedings{Goldreich:2001:SKG,
author = "Oded Goldreich and Yehuda Lindell",
title = "Session-Key Generation Using Human Passwords Only",
crossref = "Kilian:2001:ACC",
pages = "408--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390408.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390408.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InProceedings{Golic:2001:CAS,
author = "Jovan D. Goli{\'c}",
title = "Correlation Analysis of the Shrinking Generator",
crossref = "Kilian:2001:ACC",
pages = "440--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390440.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390440.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Golic:2001:HCC,
author = "Jovan Dj. Goli{\'c}",
title = "How to Construct Cryptographic Primitives from Stream
Ciphers",
journal = j-COMPUT-SECUR,
volume = "20",
number = "1",
pages = "79--89",
day = "31",
month = jan,
year = "2001",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:43 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404801010252",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Golic:2001:MOS,
author = "Jovan Dj. Golic",
title = "Modes of Operation of Stream Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "233--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120233.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120233.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gong:2001:GPK,
author = "Guang Gong and Lein Harn and Huapeng Wu",
title = "The {GH} Public-Key Cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "284--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590284.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590284.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{GonzalezVasco:2001:CPK,
author = "Mar{\'\i}a Isabel {Gonz{\'a}lez Vasco} and Rainer
Steinwandt",
title = "Clouds over a public key cryptosystem based on
{Lyndon} words",
journal = j-INFO-PROC-LETT,
volume = "80",
number = "5",
pages = "239--242",
year = "2001",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A62 (68R15)",
MRnumber = "1 864 974",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Goodman:2001:EER,
author = "James Goodman and Anantha Chandrakasan",
title = "An Energy Efficient Reconfigurable Public-Key
Cryptography Processor Architecture",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "175--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650175.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650175.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Goots:2001:FEA,
author = "Nick D. Goots and Alexander A. Moldovyan and Nick A.
Moldovyan",
title = "Fast Encryption Algorithm {Spectr-H64}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2052",
pages = "275--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2052.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2052/20520275.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2052/20520275.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gopalakrishnan:2001:PWV,
author = "K. Gopalakrishnan and Nasir Memon and Poorvi L. Vora",
title = "Protocols for Watermark Verification",
journal = j-IEEE-MULTIMEDIA,
volume = "8",
number = "4",
pages = "66--70",
month = oct,
year = "2001",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.959104",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 23 11:55:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mu/books/mu2001/pdf/u4066.pdf;
http://www.computer.org/multimedia/mu2001/u4066abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Gore:2001:CMT,
author = "Rajeev Prabhakar Gor{\'e} and Phuong Th{\^e}
Nguy{\^e}n",
title = "{CardS4}: Modal Theorem Proving on {Java} Smartcards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "111--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400111.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400111.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Graff:2001:CCW,
author = "Jon Graff",
title = "Cryptography and e-commerce: a {Wiley} tech brief",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xviii + 222",
year = "2001",
ISBN = "0-471-40574-4 (paperback)",
ISBN-13 = "978-0-471-40574-0 (paperback)",
LCCN = "QA76.9.A25 G68 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Wiley tech brief series",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; electronic commerce",
}
@Article{Grigg:2001:FCL,
author = "Ian Grigg",
title = "Financial Cryptography in $7$ Layers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "332--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620332.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620332.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Grosek:2001:SPK,
author = "Otokar Gro{\v{s}}ek and Spyros S. Magliveras and Wandi
Wei",
booktitle = "Public-key cryptography and computational number
theory (Warsaw, 2000)",
title = "On the security of a public-key cryptosystem",
publisher = pub-GRUYTER,
address = pub-GRUYTER:adr,
pages = "71--75",
year = "2001",
MRclass = "94A60 (11T71)",
MRnumber = "1 881 628",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
}
@Article{Grossschadl:2001:HSR,
author = "Johann Gro{\ss}sch{\"a}dl",
title = "High-Speed {RSA} Hardware Based on {Barret}'s Modular
Reduction Method",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "191--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650191.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650191.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Guajardo:2001:EIE,
author = "Jorge Guajardo and Rainer Bl{\"u}mel and Uwe Krieger
and Christof Paar",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "Efficient implementation of elliptic curve
cryptosystems on the {TI MSP430x33x} family of
microcontrollers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "365--382",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (94B27)",
MRnumber = "1 898 047",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Guillou:2001:CAP,
author = "L. C. Guillou and M. Ugon and J-J. Quisquater",
title = "Cryptographic authentication protocols for smart
cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "4",
pages = "437--451",
day = "16",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/61/28/30/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/61/28/30/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Guoxiang:2001:IFB,
author = "Song Guoxiang and Wang Weiwei",
title = "Image-Feature Based Second Generation Watermarking in
Wavelet Domain",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2251",
pages = "16--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:36 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2251.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2251/22510016.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2251/22510016.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hamann:2001:SBA,
author = "E.-M. Hamann and H. Henn and T. Sch{\"a}ck and F.
Seliger",
title = "Securing e-business applications using smart cards",
journal = j-IBM-SYS-J,
volume = "40",
number = "3",
pages = "635--647",
month = "????",
year = "2001",
CODEN = "IBMSA7",
ISSN = "0018-8670",
bibdate = "Wed Nov 14 19:06:40 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/sj/403/hamann.html;
http://www.research.ibm.com/journal/sj/403/hamann.pdf",
acknowledgement = ack-nhfb,
fjournal = "IBM Systems Journal",
ordernumber = "G321-0142",
}
@Article{Hanaoka:2001:EUS,
author = "Goichiro Hanaoka and Junji Shikata and Yuliang Zheng
and Hideki Imai",
title = "Efficient and Unconditionally Secure Digital
Signatures and a Security Analysis of a Multireceiver
Authentication Code",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "64--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740064.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740064.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Handschuh:2001:ASE,
author = "Helena Handschuh and Lars R. Knudsen and Matthew J.
Robshaw",
booktitle = "Topics in cryptology---CT-RSA 2001 (San Francisco,
CA)",
title = "Analysis of {SHA-1} in Encryption Mode",
volume = "2020",
publisher = pub-SV,
address = pub-SV:adr,
pages = "70--83",
year = "2001",
MRclass = "94A60",
MRnumber = "1 907 090",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200070.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200070.pdf",
}
@Article{Hankerson:2001:SIE,
author = "Darrel Hankerson and Julio L{\'o}pez Hernandez and
Alfred Menezes",
title = "Software Implementation of Elliptic Curve Cryptography
over Binary Fields",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hare:2001:RUPa,
author = "Chris Hare",
title = "Revisiting {UNIX} Password Controls -- Part 1",
journal = j-SYS-ADMIN,
volume = "10",
number = "10",
pages = "30, 32--34",
month = oct,
year = "2001",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Thu Sep 13 18:44:19 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.samag.com/",
abstract = "This article discusses UNIX password controls
including the encryption systems used, password rules
and validation, password shadows, and aging.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Hare:2001:RUPb,
author = "Chris Hare",
title = "Revisiting {UNIX} Password Controls -- Part 2",
journal = j-SYS-ADMIN,
volume = "10",
number = "11",
pages = "35--38",
month = nov,
year = "2001",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Fri Feb 08 11:17:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The first part of Hare's series discussed the
encryption methods used in protecting the passwords on
a UNIX system. This concluding article describes using
a shadow file to provide further protection for the
encrypted passwords and discusses the validity of
password-cracking tools.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Hartel:2001:FSJ,
author = "Pieter H. Hartel and Luc Moreau",
title = "Formalizing the safety of {Java}, the {Java Virtual
Machine}, and {Java} card",
journal = j-COMP-SURV,
volume = "33",
number = "4",
pages = "517--558",
month = dec,
year = "2001",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/503112.503115",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:17:06 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We review the existing literature on Java safety,
emphasizing formal approaches, and the impact of Java
safety on small footprint devices such as smartcards.
The conclusion is that although a lot of good work has
been done, a more concerted effort is needed to build a
coherent set of machine-readable formal models of the
whole of Java and its implementation. This is a
formidable task but we believe it is essential to build
trust in Java safety, and thence to achieve ITSEC level
6 or Common Criteria level 7 certification for Java
programs.",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Common criteria; programming",
}
@Article{Hartel:2001:TMS,
author = "Pieter H. Hartel and Michael J. Butler and Eduard de
Jong and Mark Longley",
title = "Transacted Memory for Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2021",
pages = "478--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2021.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2021/20210478.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2021/20210478.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Hasan:2001:ECM,
author = "M. A. Hasan",
title = "Efficient Computation of Multiplicative Inverses for
Cryptographic Applications",
crossref = "Burgess:2001:ISC",
pages = "66--72",
year = "2001",
bibdate = "Fri May 3 13:58:18 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib; OCLC
Proceedings database",
URL = "http://www.acsel-lab.com/arithmetic/arith15/papers/ARITH15_Hasan.pdf",
acknowledgement = ack-nhfb,
keywords = "ARITH-15",
}
@Article{Hasan:2001:PAA,
author = "M. A. Hasan",
title = "Power analysis attacks and algorithmic approaches to
their countermeasures for {Koblitz} curve
cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "50",
number = "10",
pages = "1071--1083",
year = "2001",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/12.956092",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
MRclass = "94A60",
MRnumber = "1 860 290",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Institute of Electrical and Electronics Engineers.
Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hawkes:2001:PCS,
author = "Philip Hawkes and Frank Quick and Gregory G. Rose",
title = "A Practical Cryptanalysis of {SSC2}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "25--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590025.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590025.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{He:2001:SAR,
author = "Yeping He and Sihan Qing",
title = "Square Attack on Reduced {Camellia} Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "238--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290238.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290238.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Heijl:2001:DXS,
author = "Danny Heijl",
title = "The {Delphi XML SAX2} Component and {MSXML 3.0}",
journal = j-DDJ,
volume = "26",
number = "9",
pages = "42, 46, 48, 50, 52, 54",
month = sep,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:39 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See correction \cite{Todd:2001:LSS}.",
URL = "http://www.ddj.com/ftp/2001/2001_09/xmlsax2.txt;
http://www.ddj.com/ftp/2001/2001_09/xmlsax2.zip",
abstract = "Danny shows how to use the C++ COM interfaces of
Microsoft's MSXML 3.0 SAX2 parser with Borland Delphi.
He then presents TSAXParser, a Delphi component that
uses these interfaces, but shields you from their
complexities. Additional resources include {\tt
xmlsax2.txt} (listings) and {\tt xmlsax2.zip} (source
code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Henderson:2001:IEV,
author = "Neil J. Henderson and Neil M. White and Pieter H.
Hartel",
title = "{iButton} Enrolment and Verification Requirements for
the Pressure Sequence Smartcard Biometric",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "124--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400124.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400124.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Hendry:2001:SCS,
author = "Mike Hendry",
title = "Smart card security and applications",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
edition = "Second",
pages = "xviii + 305",
year = "2001",
ISBN = "1-58053-156-3",
ISBN-13 = "978-1-58053-156-6",
LCCN = "TK7895.S62 H46 2001",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "The Artech House telecommunications library",
acknowledgement = ack-nhfb,
keywords = "smart cards --- security measures",
}
@Article{Hernandez:2001:DTR,
author = "Julio C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a
Sierra and Arturo Ribagorda and Benjam{\'\i}n Ramos and
J. C. Mex-Perera",
title = "Distinguishing {TEA} from a Random Permutation:
Reduced Round Versions of {TEA} Do Not Have the {SAC}
or Do Not Generate Random Numbers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "374--377",
year = "2001",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-45325-3_34",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Feb 01 16:50:09 2012",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600374.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600374.pdf",
abstract = "In this paper the authors present a statistical test
for testing the strict avalanche criterion (SAC), a
property that cryptographic primitives such as block
ciphers and hash functions must have. Random
permutations should also behave as good random number
generators when, given any initial input, its output is
considered part of a pseudorandom stream and then used
as an input block to produce more output bits. Using
these two ideal properties, we construct a test
framework for cryptographic primitives that is shown at
work on the block cipher TEA. In this way, we are able
to distinguish reduced round versions of it from a
random permutation.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hess:2001:TTH,
author = "Florian Hess and Gadiel Seroussi and Nigel P. Smart",
title = "Two Topics in Hyperelliptic Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "181--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590181.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590181.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hirose:2001:UAS,
author = "Shouichi Hirose and Susumu Yoshida",
title = "A User Authentication Scheme with Identity and
Location Privacy",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "235--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190235.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190235.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Hirt:2001:RFU,
author = "Martin Hirt and Ueli Maurer",
title = "Robustness for Free in Unconditional Multi-party
Computation",
crossref = "Kilian:2001:ACC",
pages = "101--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390101.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390101.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Hoepman:2001:SKA,
author = "Jaap-Henk Hoepman",
title = "Secret Key Authentication with Software-Only
Verification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "313--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620313.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620313.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hoffstein:2001:MAD,
author = "Jeffrey Hoffstein and Joseph H. Silverman",
title = "{MiniPASS}: Authentication and Digital Signatures in a
Constrained Environment",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "328--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650328.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650328.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Hoffstein:2001:NNL,
author = "J. Hoffstein and J. Pipher and J. H. Silverman",
title = "{NSS}: An {NTRU} lattice-based signature scheme",
crossref = "Pfitzmann:2001:ACE",
pages = "211--228",
year = "2001",
bibdate = "Thu Apr 21 13:42:36 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Hofinger:2001:LBE,
author = "Siegfried H{\"o}finger",
title = "Load Balancing for the Electronic Structure Program
{GREMLIN} in a Very Heterogeneous {SSH}-Connected
{WAN}-Cluster of {UNIX}-Type Hosts",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2074",
pages = "801--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2074.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2074/20740801.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2074/20740801.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hong:2001:KIA,
author = "Deukjo Hong and Jaechul Sung and Seokhie Hong and
Wonil Lee and Sangjin Lee and Jongin Lim and Okyeon
Yi",
title = "Known-{IV} Attacks on Triple Modes of Operation of
Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "208--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480208.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480208.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hong:2001:PSA,
author = "Seokhie Hong and Sangjin Lee and Jongin Lim and
Jaechul Sung and Donghyeon Cheon and Inho Cho",
title = "Provable Security against Differential and Linear
Cryptanalysis for the {SPN} Structure",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "273--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780273.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780273.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Huhnlein:2001:ICB,
author = "Detlef H{\"u}hnlein and Sachar Paulus",
booktitle = "Selected areas in cryptography (Waterloo, ON, 2000)",
title = "On the implementation of cryptosystems based on real
quadratic number fields (extended abstract)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "288--302",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62 (94A60)",
MRnumber = "1 895 598",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Huhnlein:2001:TPN,
author = "Detlef H{\"u}hnlein and Michael J. {Jacobson, Jr.} and
Damian Weber",
booktitle = "Selected areas in cryptography (Waterloo, ON, 2000)",
title = "Towards Practical Non-interactive Public Key
Cryptosystems Using Non-maximal Imaginary Quadratic
Orders (Extended Abstract)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "275--287",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62 (94A60)",
MRnumber = "1 895 597",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120275.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120275.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Husemann:2001:SSC,
author = "Dirk Husemann",
title = "Standards in the smart card world",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "4",
pages = "473--487",
day = "16",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/61/28/32/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/61/28/32/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Book{Hutchinson:2001:IWC,
author = "William Hutchinson and Matthew Warren",
title = "Information Warfare: Corporate Attack and Defense in a
Digital World",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xx + 204",
year = "2001",
ISBN = "0-7506-4944-5",
ISBN-13 = "978-0-7506-4944-5",
LCCN = "QA76.9.A25 H88 2001",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
series = "Computer Weekly professional series",
acknowledgement = ack-nhfb,
subject = "Computer security; Information warfare",
}
@Book{Huth:2001:SCS,
author = "Michael R. A. Huth",
title = "Secure communicating systems: design, analysis, and
implementation",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "x + 283",
year = "2001",
ISBN = "0-521-80731-X (hardcover)",
ISBN-13 = "978-0-521-80731-9 (hardcover)",
LCCN = "TK5102.85 .H88 2001",
bibdate = "Tue Apr 02 15:13:35 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$40.00",
acknowledgement = ack-nhfb,
}
@Article{Hwang:2001:LCT,
author = "Ren-Junn Hwang and Timothy K. Shih and Chuan-Ho Kao
and Tsung-Ming Chang",
title = "Lossy Compression Tolerant Steganography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2105",
pages = "427--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:05 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2105.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2105/21050427.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2105/21050427.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hwang:2001:TSB,
author = "Min-Shiang Hwang and Cheng-Chi Lee and Yuan-Liang
Tang",
title = "Two Simple Batch Verifying Multiple Digital
Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "233--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290233.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290233.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Itkis:2001:FSS,
author = "Gene Itkis and Leonid Reyzin",
title = "Forward-Secure Signatures with Optimal Signing and
Verifying",
crossref = "Kilian:2001:ACC",
pages = "332--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390332.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390332.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InProceedings{Itoi:2001:SCS,
author = "Naomaru Itoi",
title = "{SC-CFS}: {Smartcard} Secured Cryptographic File
System",
crossref = "USENIX:2001:PTU",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/itoi.html",
acknowledgement = ack-nhfb,
}
@Article{Itoi:2001:SIS,
author = "Naomaru Itoi and Tomoko Fukuzawa and Peter Honeyman",
title = "Secure {Internet} Smartcards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2041",
pages = "73--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:58 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2041.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2041/20410073.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2041/20410073.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Iwata:2001:PAF,
author = "Tetsu Iwata and Kaoru Kurosawa",
title = "On the Pseudorandomness of the {AES} Finalists ---
{RC6} and {Serpent}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "231--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780231.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780231.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Izotov:2001:COC,
author = "Boris V. Izotov and Alexander A. Moldovyan and Nick A.
Moldovyan",
title = "Controlled Operations as a Cryptographic Primitive",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2052",
pages = "230--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2052.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2052/20520230.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2052/20520230.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jablon:2001:PAU,
author = "David P. Jablon",
title = "Password Authentication Using Multiple Servers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "344--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200344.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200344.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jakimoski:2001:ASR,
author = "Goce Jakimoski and Ljup{\v{c}}o Kocarev",
title = "Analysis of some recently proposed chaos-based
encryption algorithms",
journal = j-PHYS-LET-A,
volume = "291",
number = "6",
pages = "381--384",
year = "2001",
CODEN = "PYLAAG",
ISSN = "0375-9601 (print), 1873-2429 (electronic)",
ISSN-L = "0375-9601",
MRclass = "94A60",
MRnumber = "1 917 690",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Physics Letters. A",
journal-URL = "http://www.sciencedirect.com/science/journal/03759601",
}
@Article{Jakimoski:2001:CCB,
author = "Goce Jakimoski and Ljup{\v{c}}o Kocarev",
title = "Chaos and cryptography: block encryption ciphers based
on chaotic maps",
journal = "IEEE Trans. Circuits Systems I Fund. Theory Appl.",
volume = "48",
number = "2",
pages = "163--169",
year = "2001",
CODEN = "ITCAEX",
ISSN = "1057-7122 (print), 1558-1268 (electronic)",
MRclass = "94A60",
MRnumber = "1 820 541",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "IEEE Transactions on Circuits and Systems. I.
Fundamental Theory and Applications",
}
@Article{Jang:2001:BWA,
author = "Yongwon Jang and Intaek Kim and Hwan Il Kang and Kab
Il Kim and Seung-Soo Han",
title = "Blind Watermarking Algorithm Using Complex Block
Selection Method",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "996--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950996.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950996.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jaulmes:2001:CPN,
author = "{\'E}liane Jaulmes and Antoine Joux",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "Cryptanalysis of {PKP}: a new approach",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "165--172",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 898 032",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ji:2001:CAF,
author = "Dongyao Ji and Yuming Wang",
title = "Comments on {{\em ``An approach to the formal
verification of the two-party cryptographic
protocols''\/} by Zhang, Li and Xiao}",
journal = j-OPER-SYS-REV,
volume = "35",
number = "1",
pages = "6--7",
month = jan,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Zhang:1999:AFV}.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Jin:2001:WCS,
author = "Liang Jin and Shi Ren and Liang Feng and Gao Zheng
Hua",
title = "{WAP} Clients and Set Protocol",
journal = j-DDJ,
volume = "26",
number = "6",
pages = "85, 87--89, 91",
month = jun,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jun 7 06:07:16 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
abstract = "Our authors examine both the Secure Electronic
Transaction (SET) protocol and the Wireless Application
Protocol (WAP), then present a model that uses WAP to
support SET with a SET thin client and smartcard
technology.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Book{Johnson:2001:IHS,
author = "Neil F. Johnson and Zoran Duric and Sushil Jajodia",
title = "Information hiding: steganography and watermarking:
attacks and countermeasures",
volume = "1",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xx + 137",
year = "2001",
ISBN = "0-7923-7204-2",
ISBN-13 = "978-0-7923-7204-2",
LCCN = "QA76.9.A25 J25 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Advances in information security",
acknowledgement = ack-nhfb,
keywords = "computer security; data protection",
subject = "Computer security; Data protection;
Computerbeveiliging; Databescherming; Watermerken;
Datensicherung; Elektronisches Wasserzeichen;
Steganographie; Filigranes num{\'e}riques;
Cryptographie; Protection de l'information
(informatique); Syst{\`e}mes informatiques; Mesures de
s{\^u}ret{\'e}; Computer security; Data protection.",
tableofcontents = "Steganography: Hiding Information \\
Steganography throughout History \\
Methods for Hiding Information \\
Hiding in Text \\
Hiding in Disk Space \\
Hiding in Network Packets \\
Hiding in Software and Circuitry \\
Hiding in Audio and Images \\
Attacks against Hidden Information \\
Detection \\
Distortion and Removal \\
Countermeasures Against Attacks \\
Contributions and Future Work \\
Organization of the Book \\
Exploring Steganography \\
Digital Images \\
Hiding Information in Images \\
Hiding Data in the Noise \\
Watermarking Techniques \\
Issues in Information Hiding \\
Level of Visibility: Perceptible or Imperceptible \\
Robustness vs. Payload \\
Spatial or transform domain \\
File Format Dependence \\
Image Modeling \\
Summary of Hiding Techniques \\
Examples of Digital Image Steganography Software \\
StegoDos \\
White Noise Storm \\
S-Tools \\
Comments on Other Software \\
Summary of Tools \\
Comments on Steganography \\
Steganalysis: Attacks Against Hidden Data \\
Detection: Seeing the Unseen \\
Techniques for Detecting Hidden Information \\
Examples of Detecting Signatures in Stego-Images \\
S-Tools \\
Mandelsteg \\
Hide and Seek \\
Hide4PGP \\
EzStego, Stego On-line \\
Jsteg-Jpeg \\
Distortion: Disabling Steganography and Watermarks \\
Techniques for Distorting Embedded Data \\
Examples of Distorting Embedded Information \\
Application of Steganalysis: Forensic Investigation \\
Comments on Steganalysis \\
Countermeasures to Attacks \\
Countermeasures to Distortion \\
Stronger Watermarks",
}
@Article{Jolish:2001:EDP,
author = "Barak D. Jolish",
title = "The Encryption Debate in Plaintext: National Security
and Encryption in the {United States} and {Israel}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "202--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620202.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620202.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jongkook:2001:NUS,
author = "Lee Jongkook and Ryu Shiryong and Kim Jeungseop and
Yoo Keeyoung",
title = "A New Undeniable Signature Scheme Using Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "387--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600387.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600387.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Joye:2001:CEN,
author = "Marc Joye and Christophe Tymen",
title = "Compact Encoding of Non-adjacent Forms with
Applications to Elliptic Curve Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "353--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920353.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920353.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Joye:2001:NMM,
author = "Marc Joye and Sung-Ming Yen",
title = "New Minimal Modified Radix-$r$ Representation with
Applications to Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "375--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740375.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740375.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Joye:2001:OAD,
author = "Marc Joye and Jean-Jacques Quisquater and Sung-Ming
Yen and Moti Yung",
title = "Observability Analysis --- Detecting When Improved
Cryptosystems Fail",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "17--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710017.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710017.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Joye:2001:PAD,
author = "M. Joye and C. Tymen",
title = "Protections against Differential Analysis for Elliptic
Curve Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "377--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620377.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620377.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Joye:2001:PMA,
author = "Marc Joye and Jean-Jacques Quisquater and Moti Yung",
title = "On the Power of Misbehaving Adversaries and Security
Analysis of the Original {EPOC}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "208--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200208.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200208.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Juang:2001:FBT,
author = "W.-S. Juang and C.-L. Lei and H.-T. Liaw",
title = "Fair blind threshold signatures based on discrete
logarithm",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "16",
number = "6",
pages = "??--??",
month = nov,
year = "2001",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Sat Jan 03 19:15:31 2004",
bibsource = "http://www.crlpublishing.co.uk/cssecont00.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Juels:2001:RKG,
author = "Ari Juels and Jorge Guajardo",
title = "{RSA} Key Generation with Verifiable Randomness",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "357--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740357.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740357.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jung:2001:EMO,
author = "Oliver Jung and Sven Kuhn and Christoph Ruland and Kai
Wollenweber",
title = "Enhanced Modes of Operation for the Encryption in
High-Speed Networks and Their Impact on {QoS}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "344--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190344.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190344.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Jutla:2001:EMA,
author = "Charanjit S. Jutla",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "Encryption Modes with Almost Free Message Integrity",
volume = "2045",
publisher = pub-SV,
address = pub-SV:adr,
pages = "529--544",
year = "2001",
MRclass = "94A60",
MRnumber = "1 895 453",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450529.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450529.pdf",
}
@Article{Kabatnik:2001:LSD,
author = "M. Kabatnik and A. Zugenmaier",
title = "Location Stamps for Digital Signatures: a New Service
for Mobile Telephone Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2094",
pages = "20--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:54 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2094.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2094/20940020.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2094/20940020.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kaliski:2001:RDS,
author = "Burton S. {Kaliski, Jr.}",
title = "{RSA} Digital Signatures",
journal = j-DDJ,
volume = "26",
number = "5",
pages = "30, 32--33, 35--36",
month = may,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Apr 12 06:45:08 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
abstract = "Digital signatures are growing in importance as they
gain legal standing with traditional handwritten
signatures. Burton examines the three most popular
signature schemes currently in use.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Kanda:2001:PSE,
author = "Masayuki Kanda",
booktitle = "Selected areas in cryptography (Waterloo, ON, 2000)",
title = "Practical Security Evaluation against Differential and
Linear Cryptanalyses for {Feistel} Ciphers with {SPN}
Round Function",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "324--338",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 895 601",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120324.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120324.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kang:2001:NHO,
author = "Ju-Sung Kang and Seongtaek Chee and Choonsik Park",
title = "A Note on the Higher Order Differential Attack of
Block Ciphers with Two-Block Structures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2015",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2015/20150001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2015/20150001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kang:2001:PMT,
author = "Ju-Sung Kang and Okyeon Yi and Dowon Hong and Hyunsook
Cho",
title = "Pseudorandomness of {MISTY}-Type Transformations and
the Block Cipher {KASUMI}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "60--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190060.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190060.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kang:2001:PSK,
author = "Ju-Sung Kang and Sang-Uk Shin and Dowon Hong and
Okyeon Yi",
title = "Provable Security of {KASUMI} and {3GPP} Encryption
Mode $ f8 $",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "255--271",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480255.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480255.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Karski:2001:SSS,
author = "Jan Karski",
title = "Story of a Secret State",
publisher = pub-HOUGHTON-MIFFLIN,
address = pub-HOUGHTON-MIFFLIN:adr,
pages = "vi + 391",
year = "2001",
ISBN = "1-931541-39-6 (hardcover)",
ISBN-13 = "978-1-931541-39-8 (hardcover)",
LCCN = "D802.P6 K3 2001",
bibdate = "Thu Feb 23 07:42:11 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
acknowledgement = ack-nhfb,
subject = "World War, 1939--1945; Personal narratives; Polish
World War, 1939--1945 --- Poland; Poland --- History
--- Occupation, 1939--1945",
tableofcontents = "Note on the Text / xi \\
Publisher's Note / xii \\
Preface / xv \\
Foreword / xvii \\
Biographical Essay of Jan Karski / xxv \\
1 Defeat / 1 \\
2 Prisoner in Russia / 15 \\
3 Exchange and Escape / 28 \\
4 Devastated Poland / 45 \\
5 The Beginning / 54 \\
6 Transformation / 66 \\
7 Initiation / 73 \\
8 Borecki / 79 \\
9 Contact between Cells / 89 \\
10 Mission to France / 101 \\
11 The Underground State / 117 \\
12 Caught by the Gestapo / 127 \\
13 Torture / 136 \\
14 The SS Hospital / 156 \\
15 Rescue / 168 \\
16 The ``Gardener'' / 180 \\
17 Propaganda from the Country / 189 \\
18 Execution of a Traitor / 207 \\
19 The Four Branches of the Underground / 218 \\
20 The Laskowa Apartment / 225 \\
21 Assignment in Lublin / 232 \\
22 Retribution / 240 \\
23 The Secret Press / 250 \\
24 My ``Conspiratorial Apparatus'' / 260 \\
25 The Liaison Women / 265 \\
26 Marriage per Procuram / 272 \\
27 School-Underground / 277 \\
28 Parliament in Poland / 293 \\
29 The Ghetto / 302 \\
30 ``To Die in Agony'' / 320 \\
31 Unter den Linden Revisited / 335 \\
32 Journey through France and Spain / 340 \\
33 My Report to the World / 358 \\
Notes / 367 \\
Glossary / 385 \\
Further Reading / 397 \\
Afterword / 401 \\
Index / 403",
}
@Article{Katz:2001:CCA,
author = "Jonathan Katz and Steven Myers and Rafail Ostrovsky",
title = "Cryptographic Counters and Applications to Electronic
Voting",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "78--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:02 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450078.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450078.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Katz:2001:EPA,
author = "Jonathan Katz and Rafail Ostrovsky and Moti Yung",
title = "Efficient Password-Authenticated Key Exchange Using
Human-Memorable Passwords",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "475--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:02 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450475.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450475.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Katz:2001:UEC,
author = "Jonathan Katz and Moti Yung",
title = "Unforgeable Encryption and Chosen Ciphertext Secure
Modes of Operation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "284--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780284.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780284.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Katzenbeisser:2001:RAR,
author = "Stefan Katzenbeisser",
title = "Recent advances in {RSA} cryptography",
volume = "3",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "xiii + 140",
year = "2001",
ISBN = "0-7923-7438-X",
ISBN-13 = "978-0-7923-7438-1",
LCCN = "QA76.9.A25 K38 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Advances in information security",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography",
}
@Article{Kavut:2001:SCP,
author = "Sel{\c{c}}uk Kavut and Melek D. Y{\"u}cel",
title = "On Some Cryptographic Properties of {Rijndael}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2052",
pages = "300--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2052.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2052/20520300.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2052/20520300.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kehr:2001:ISM,
author = "Roger Kehr and Michael Rohs and Harald Vogt",
title = "Issues in Smartcard Middleware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2041",
pages = "90--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:58 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2041.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2041/20410090.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2041/20410090.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Keliher:2001:IUB,
author = "Liam Keliher and Henk Meijer and Stafford Tavares",
title = "Improving the Upper Bound on the Maximum Average
Linear Hull Probability for {Rijndael}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "112--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590112.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590112.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kelsey:2001:ABA,
author = "J. Kelsey and T. Kohno and B. Schneier",
title = "Amplified Boomerang Attacks Against Reduced-Round
{MARS} and {Serpent}",
crossref = "Schneier:2001:FSE",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??--??",
year = "2001",
bibdate = "Mon Oct 16 08:39:00 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Article{Khachatrian:2001:FMI,
author = "Gurgen H. Khachatrian and Melsik K. Kuregian and Karen
R. Ispiryan and James L. Massey",
title = "Fast Multiplication of Integers for Public-Key
Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "245--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590245.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590245.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kiayias:2001:PRB,
author = "Aggelos Kiayias and Moti Yung",
title = "Polynomial Reconstruction Based Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "129--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590129.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590129.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kiayias:2001:SPP,
author = "Aggelos Kiayias and Moti Yung",
title = "Self Protecting Pirates and Black-Box Traitor
Tracing",
crossref = "Kilian:2001:ACC",
pages = "63--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390063.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390063.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Kiltz:2001:TBC,
author = "E. Kiltz",
title = "A Tool Box of Cryptographic Functions Related to the
{Diffie--Hellman} Function",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "339--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470339.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470339.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2001:NPK,
author = "Hwankoo Kim and SangJae Moon",
title = "New Public-Key Cryptosystem Using Divisor Class
Groups",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "74--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190074.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190074.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2001:SAC,
author = "Seungjoo Kim and Jung Hee Cheon and Marc Joye and
Seongan Lim and Masahiro Mambo and Dongho Won and
Yuliang Zheng",
title = "Strong Adaptive Chosen-Ciphertext Attacks with Memory
Dump (or: The Importance of the Order of Decryption and
Validation)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "114--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600114.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600114.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{King:2001:CMF,
author = "David A. King",
title = "The ciphers of the monks: a forgotten number-notation
of the {Middle Ages}",
volume = "44",
publisher = "F. Steiner",
address = "Stuttgart, Germany",
pages = "506",
year = "2001",
ISBN = "3-515-07640-9",
ISBN-13 = "978-3-515-07640-1",
LCCN = "QA141.2 .K56 2001",
bibdate = "Thu Sep 23 23:53:13 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Boethius: Texte und Abhandlungen zur Geschichte der
Mathematik der Naturwissenschaften",
acknowledgement = ack-nhfb,
remark = "Errata slip laid in.",
subject = "Numeration; History; Numerals, Writing of;
Manuscripts, Medieval; Astrolabes; Astronomy, Medieval;
Instruments",
}
@Book{King:2001:SAD,
author = "Christopher M. King and Curtis E. Dalton and T. Ertam
Osmano{\u{g}}lu",
title = "Security Architecture: Design, Deployment and
Operations",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "xxii + 481",
year = "2001",
ISBN = "0-07-213385-6",
ISBN-13 = "978-0-07-213385-1",
LCCN = "QA76.9.A25 K54 2001",
bibdate = "Wed Jun 06 18:29:48 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Kirkby:2001:CCW,
author = "Andrea Kirkby",
title = "Cryptography and E-Commerce: a {Wiley} Tech Brief",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "4",
pages = "9--9",
day = "1",
month = apr,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00416-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801004160",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Kirtland:2001:INC,
author = "Joseph Kirtland",
title = "Identification numbers and check digit schemes",
publisher = pub-MATH-ASSOC-AMER,
address = pub-MATH-ASSOC-AMER:adr,
pages = "xi + 174",
year = "2001",
ISBN = "0-88385-720-0",
ISBN-13 = "978-0-88385-720-5",
LCCN = "QA241 .K576 2001",
bibdate = "Fri Mar 23 16:59:36 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Classroom resource materials",
URL = "http://www.loc.gov/catdir/description/cam021/00108052.html;
http://www.loc.gov/catdir/toc/cam027/00108052.html",
abstract = "This book develops the mathematical skills necessary
for the investigation of the increasingly pervasive
codes used to identify everything from credit cards to
books to supermarket goods. An important part of such
codes is the check digit, which can point out when an
error has been made, either accidentally in
transmission, or deliberately in an attempt at fraud.
Mathematics plays a crucial role in designing and
verifying such check digit schemes. Beginning
undergraduates and pre-university students should find
this book both accessible and fun. In the process of
describing the identification number schemes, the
author introduces many fundamental areas of discrete
mathematics, including modular arithmetic and group
theory, with emphasis on their applications. A unique
point of the book is the way it offers students the
possibility of writing papers summarizing a given topic
to improve their understanding. It also contains
pointers into the literature for further reading.",
acknowledgement = ack-nhfb,
subject = "Number theory; Check digit schemes",
tableofcontents = "Introduction\\
1. Identification numbers and check digit schemes\\
2. Number theory, cryptography, and check digit
schemes\\
3. Functions, permutations, and their applications\\
4. Symmetry and rigid motions\\
5. Group theory and applications.",
}
@Article{Klarlund:2001:MIS,
author = "Nils Klarlund and Anders M{\o}ller and Michael I.
Schwartzbach",
title = "{MONA} Implementation Secrets",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2088",
pages = "182--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:47 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2088.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2088/20880182.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2088/20880182.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Knudsen:2001:CPL,
author = "Lars R. Knudsen and John Erik Mathiassen",
title = "A Chosen-Plaintext Linear Attack on {DES}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "262--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780262.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780262.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Knudsen:2001:CRR,
author = "L. Knudsen and W. Meier",
title = "Correlations in {RC6} with a Reduced Number of
Rounds",
crossref = "Schneier:2001:FSE",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??--??",
year = "2001",
bibdate = "Mon Oct 16 08:40:53 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb # " and " # ack-bs,
}
@Article{Kobara:2001:NCP,
author = "Kazukuni Kobara and Hideki Imai",
title = "New Chosen-Plaintext Attacks on the One-Wayness of the
Modified {McEliece PKC} Proposed at {Asiacrypt 2000}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "237--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740237.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740237.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kobara:2001:SSM,
author = "Kazukuni Kobara and Hideki Imai",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "Semantically Secure {McEliece} Public-Key
Cryptosystems --- Conversions for {McEliece PKC}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "19--35",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (94A62)",
MRnumber = "1 898 022",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920019.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920019.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kocarev:2001:LMB,
author = "Ljup{\v{c}}o Kocarev and Goce Jakimoski",
title = "Logistic map as a block encryption algorithm",
journal = j-PHYS-LET-A,
volume = "289",
number = "4-5",
pages = "199--206",
year = "2001",
CODEN = "PYLAAG",
ISSN = "0375-9601 (print), 1873-2429 (electronic)",
ISSN-L = "0375-9601",
MRclass = "94A60 (37D45 37N99 82Bxx)",
MRnumber = "1 867 990",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Physics Letters. A",
journal-URL = "http://www.sciencedirect.com/science/journal/03759601",
}
@Article{Komninos:2001:ESC,
author = "N. Komninos and Bahram Honary and Michael Darnell",
title = "An Efficient Stream Cipher {Alpha1} for Mobile and
Wireless Devices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "294--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600294.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600294.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kong:2001:AVW,
author = "Xiangwei Kong and Yu Liu and Huajian Liu",
title = "Adaptive Video Watermarking Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "933--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950933.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950933.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Koshiba:2001:NAS,
author = "Takeshi Koshiba",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "A New Aspect for Security Notions: Secure Randomness
in Public-Key Encryption Schemes",
volume = "1992",
publisher = pub-SV,
address = pub-SV:adr,
pages = "87--103",
year = "2001",
MRclass = "94A60 (62D05 94A62)",
MRnumber = "1 898 027",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920087.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920087.pdf",
}
@Article{Koshiba:2001:SRS,
author = "Takeshi Koshiba",
title = "On Sufficient Randomness for Secure Public-Key
Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "34--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740034.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740034.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Koskinen:2001:NIK,
author = "Jukka A. Koskinen",
title = "Non-injective knapsack public-key cryptosystems",
journal = j-THEOR-COMP-SCI,
volume = "255",
number = "1--2",
pages = "401--422",
day = "28",
month = mar,
year = "2001",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
MRclass = "94A60 (68P25)",
MRnumber = "2001m:94047",
MRreviewer = "J. D{\'e}nes",
bibdate = "Tue Apr 17 08:40:28 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl../40/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/197/21/40/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Book{Kovach:2001:BCB,
author = "Karen Kovach",
title = "Breaking codes, breaking barriers: the {WACs} of the
{Signal Security Agency}, {World War II}",
publisher = "History Office, Office of the Chief of Staff, US Army
Intelligence and Security Command",
address = "Fort Belvoir, VA, USA",
pages = "vi + 49",
year = "2001",
LCCN = "UA565.W6 K68 2001",
bibdate = "Thu Dec 28 09:53:35 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "World War, 1939--1945; Military intelligence; United
States; Cryptography",
}
@InProceedings{Krawczyk:2001:OEA,
author = "Hugo Krawczyk",
title = "The Order of Encryption and Authentication for
Protecting Communications (or: How Secure Is {SSL}?)",
crossref = "Kilian:2001:ACC",
pages = "310--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390310.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390310.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Kuhn:2001:CRR,
author = "Ulrich K{\"u}hn",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "Cryptanalysis of reduced-round {MISTY}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "325--329",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 895 441",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kukorelly:2001:PAL,
author = "Zsolt Kukorelly",
title = "The piling-up approximation in linear cryptanalysis",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "47",
number = "7",
pages = "2812--2823",
month = jul,
year = "2001",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.959262",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A60 (60-XX)",
MRnumber = "1 872 842",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Institute of Electrical and Electronics Engineers.
Transactions on Information Theory",
}
@Article{Kundur:2001:WDI,
author = "Deepa Kundur",
title = "Watermarking with Diversity: Insights and
Implications",
journal = j-IEEE-MULTIMEDIA,
volume = "8",
number = "4",
pages = "46--52",
month = oct,
year = "2001",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.959102",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 23 11:55:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mu/books/mu2001/pdf/u4046.pdf;
http://www.computer.org/multimedia/mu2001/u4046abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Kuo:2001:AOS,
author = "H. Kuo and I. Verbauwhede",
title = "Architectural Optimization for a 1.82Gbits\slash sec
{VLSI} Implementation of the {AES Rijndael} Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "51--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620051.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620051.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kuribayashi:2001:NAF,
author = "M. Kuribayashi and H. Tanaka",
title = "A New Anonymous Fingerprinting Scheme with High
Enciphering Rate",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "30--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470030.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470030.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kurosawa:2001:ICP,
author = "Kaoru Kurosawa and Wakaha Ogata and Toshihiko Matsuo
and Shuichi Makishima",
title = "{IND--CCA} Public Key Schemes Equivalent to Factoring
$n = p q$",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "36--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920036.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920036.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kurosawa:2001:LCI,
author = "Kaoru Kurosawa and Takuya Yoshida",
title = "Linear Code Implies Public-Key Traitor Tracing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "172--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740172.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740172.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kurosawa:2001:MRP,
author = "Kaoru Kurosawa",
title = "Multi-recipient Public-Key Encryption with Shortened
Ciphertext",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "48--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740048.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740048.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Lam:2001:CCN,
author = "Kwok Yan Lam",
title = "Cryptography and computational number theory",
volume = "20",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "viii + 378",
year = "2001",
ISBN = "3-7643-6510-2, 0-8176-6510-2",
ISBN-13 = "978-3-7643-6510-3, 978-0-8176-6510-4",
LCCN = "QA268 .C77 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Progress in computer science and applied logic",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; cryptography ---
congresses; number theory --- data processing ---
congresses",
}
@Article{Lang:2001:CMS,
author = "Ulrich Lang and Dieter Gollmann and Rudolf Schreiner",
title = "Cryptography and Middleware Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "408--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290408.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290408.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@PhdThesis{Lee:2001:AES,
author = "Jee Hea Lee",
title = "Authenticated encryption in the symmetric and
asymmetric settings",
type = "Vita Thesis ({Ph.D.})",
school = "University of California, San Diego",
address = "San Diego, CA, USA",
year = "2001",
LCCN = "QA 3.8 .L44 2001 Archives DISS",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "dissertations, academic --- UCSD --- Computer Science;
dissertations, academic --- UCSD --- Computer Science
and Engineering",
}
@Article{Lee:2001:EPI,
author = "Ruby B. Lee and Zhijie Shi and Xiao Yang",
title = "Efficient Permutation Instructions for Fast Software
Cryptography",
journal = j-IEEE-MICRO,
volume = "21",
number = "6",
pages = "56--69",
month = nov # "\slash " # dec,
year = "2001",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.977759",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jan 31 18:42:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mi/books/mi2001/m6056abs.htm;
http://dlib.computer.org/mi/books/mi2001/pdf/m6056.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@InProceedings{Lee:2001:PBG,
author = "Eonkyung Lee and Sang Jin Lee and Sang Geun Hahn",
title = "Pseudorandomness from Braid Groups",
crossref = "Kilian:2001:ACC",
pages = "486--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390486.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390486.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Lee:2001:SEK,
author = "Byung-Rae Lee and Kyung-Ah Chang and Tai-Yun Kim",
title = "A Secure and Efficient Key Escrow Protocol for Mobile
Communications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2073",
pages = "433--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:28 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2073.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2073/20730433.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2073/20730433.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Leitold:2001:MTN,
author = "Herbert Leitold and Wolfgang Mayerwieser and Udo Payer
and Karl Christian Posch and Reinhard Posch and
Johannes Wolkerstorfer",
title = "A {155 Mbps Triple-DES} Network Encryptor",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "164--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650164.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650164.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lenstra:2001:SFR,
author = "Arjen K. Lenstra and Igor E. Shparlinski",
title = "Selective Forgery of {RSA} Signatures with
Fixed-Pattern Padding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "228--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740228.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740228.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lenstra:2001:USM,
author = "Arjen K. Lenstra",
title = "Unbelievable Security. Matching {AES} Security Using
Public Key Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "67--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480067.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480067.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Leung:2001:WDI,
author = "K. H. Leung and Bing Zeng",
title = "Wavelet-Domain Image Watermarking Based on Statistical
Metrics",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "788--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950788.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950788.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Leveiller:2001:CNF,
author = "Sabine Leveiller and Joseph Boutros and Philippe
Guillot and Gilles Z{\'e}mor",
title = "Cryptanalysis of Nonlinear Filter Generators with $ \{
0, 1 \} $-Metric {Viterbi} Decoding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "402--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600402.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600402.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Levy:2001:CHC,
author = "Steven Levy",
title = "Crypto: how the code rebels beat the government,
saving privacy in the digital age",
publisher = pub-VIKING,
address = pub-VIKING:adr,
pages = "viii + 356",
year = "2001",
ISBN = "0-670-85950-8, 0-14-024432-8",
ISBN-13 = "978-0-670-85950-4, 978-0-14-024432-8",
LCCN = "QA76.9.A25 L49 2001",
bibdate = "Sat Dec 17 17:13:01 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
xxtitle = "Crypto: secrecy and privacy in the new code war",
}
@Article{Li:2001:CCB,
author = "Zi Chen Li and Yi Qi Dai",
title = "Cryptoanalysis of cryptosystems based on the quadratic
residue problem",
journal = "J. Tsinghua Univ.",
volume = "41",
number = "7",
pages = "80--82",
year = "2001",
CODEN = "QDXKE8",
ISSN = "1000-0054",
MRclass = "94A60",
MRnumber = "2002f:94038",
MRreviewer = "Dingyi Pei",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Journal of Tsinghua University. Science and
Technology. Qinghua Daxue Xuebao. Ziran Kexue Ban",
}
@Article{Li:2001:GOT,
author = "Zi-Chen Li and Jun-Mei Zhang and Jun Luo and William
Song and Yi-Qi Dai",
title = "Group-Oriented $ (t, n) $ Threshold Digital Signature
Schemes with Traceable Signers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2040",
pages = "57--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2040.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2040/20400057.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2040/20400057.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2001:NSA,
author = "Yifa Li",
title = "A New Semantics of Authentication Logic",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "476--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290476.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290476.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Li:2001:SPD,
author = "Shujun Li and Qi Li and Wenmin Li and Xuanqin Mou and
Yuanlong Cai",
title = "Statistical Properties of Digital Piecewise Linear
Chaotic Maps and Their Roles in Cryptography and
Pseudo-Random Coding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "205--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600205.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600205.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Lientz:2001:BTP,
author = "Bennet P. Lientz and Kathryn P. Rea",
title = "Breakthrough technology project management",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xxv + 342",
year = "2001",
ISBN = "0-12-449968-6",
ISBN-13 = "978-0-12-449968-3",
LCCN = "HD69.P75 L538 2001",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.95",
acknowledgement = ack-nhfb,
}
@Article{Lim:2001:SAW,
author = "Shin-Young Lim and Jeong-Ho Ko and Eun-Ah Jun and
Gang-Soo Lee",
title = "Specification and analysis of $n$-way key recovery
system by {Extended Cryptographic Timed Petri Net}",
journal = j-J-SYST-SOFTW,
volume = "58",
number = "2",
pages = "93--106",
day = "1",
month = sep,
year = "2001",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Mon Nov 19 09:08:02 MST 2001",
bibsource = "http://www.elsevier.com/locate/issn/01641212;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
URL = "http://www.elsevier.com/gej-ng/10/29/11/68/33/28/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lin:2001:DWM,
author = "Phen-Lan Lin",
title = "Digital watermarking models for resolving rightful
ownership and authenticating legitimate customer",
journal = j-J-SYST-SOFTW,
volume = "55",
number = "3",
pages = "261--271",
day = "15",
month = jan,
year = "2001",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed Apr 18 06:31:11 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/01641212;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/29/11/54/27/27/abstract.html;
http://www.elsevier.nl/gej-ng/10/29/11/54/27/27/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lin:2001:HKA,
author = "Chu-Hsing Lin",
title = "Hierarchical key assignment without public-key
cryptography",
journal = j-COMPUT-SECUR,
volume = "20",
number = "7",
pages = "612--619",
day = "31",
month = oct,
year = "2001",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404801007118",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Lindell:2001:PCT,
author = "Yehuda Lindell",
title = "Parallel Coin-Tossing and Constant-Round Secure
Two-Party Computation",
crossref = "Kilian:2001:ACC",
pages = "171--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390171.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390171.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@InProceedings{Lindemann:2001:ICT,
author = "Mark Lindemann and Sean W. Smith",
title = "Improving {DES} Coprocessor Throughput for Short
Operations",
crossref = "USENIX:2001:PTU",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/lindemann.html",
acknowledgement = ack-nhfb,
}
@Article{Loidreau:2001:WKM,
author = "Pierre Loidreau and Nicolas Sendrier",
title = "Weak keys in the {McEliece} public-key cryptosystem",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "47",
number = "3",
pages = "1207--1211",
month = mar,
year = "2001",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/18.915687",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
MRclass = "94A62",
MRnumber = "2002f:94049",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Institute of Electrical and Electronics Engineers.
Transactions on Information Theory",
}
@Article{Lovering:2001:TKF,
author = "Daniel Lovering",
title = "Taming the Killing Fields of {Laos}: Live bombs from
the {Vietnam War} continue to kill people and hamper
agricultural development in {Laos}. The cleanup project
required deciphering decades-old computer files",
journal = j-SCI-AMER,
volume = "285",
number = "2",
pages = "66--71",
month = aug,
year = "2001",
CODEN = "SCAMAC",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Thu Jul 19 06:21:52 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciam.com/2001/0801issue/0801quicksummary.html",
URL = "http://www.sciam.com/2001/0801issue/2001/0801issue/0801hargrove.html",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
}
@Article{Lu:2001:DWC,
author = "Chun-Shien Lu and Hong-Yuan Mark Liao",
title = "Digital Watermarking: a Communications with Side
Information Perspective",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "927--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950927.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950927.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ludwig:2001:FSE,
author = "Stefan Ludwig and Winfried Kalfa",
title = "File system encryption with integrated user
management",
journal = j-OPER-SYS-REV,
volume = "35",
number = "4",
pages = "88--93",
month = oct,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lukyanov:2001:PFA,
author = "Dmitro O. Luk'yanov",
title = "On the problem of the formation of an authentication
protocol for on-line cryptosystems",
journal = "V{\=\i}sn. Ki{\"\i} v. Un{\=\i}v. Ser. F{\=\i}z.-Mat.
Nauki",
volume = "2",
pages = "269--276",
year = "2001",
MRclass = "94A60",
MRnumber = "1 897 251",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "V{\=\i}snik Ki{\"\i} vs\cprime kogo Un{\=\i}versitetu.
Ser{\=\i}ya: F{\=\i}ziko-Matematichn{\=\i} Nauki",
}
@Article{Lysyanskaya:2001:AST,
author = "Anna Lysyanskaya and Chris Peikert",
title = "Adaptive Security in the Threshold Setting: From
Cryptosystems to Signature Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "331--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480331.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480331.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{MacKenzie:2001:MEP,
author = "Philip MacKenzie",
title = "More Efficient Password-Authenticated Key Exchange",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "361--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200361.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200361.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{MacKenzie:2001:TPG,
author = "Philip MacKenzie and Michael K. Reiter",
title = "Two-Party Generation of {DSA} Signatures",
crossref = "Kilian:2001:ACC",
pages = "137--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390137.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390137.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Maitra:2001:SDD,
author = "S. Maitra and D. P. Mukherjee",
title = "Spatial Domain Digital Watermarking with Buyer
Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "149--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470149.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470149.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Manger:2001:CCA,
author = "James Manger",
title = "A Chosen Ciphertext Attack on {RSA} Optimal Asymmetric
Encryption Padding {(OAEP)} as Standardized in {PKCS}
\#1 v2.0",
crossref = "Kilian:2001:ACC",
pages = "230--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390230.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390230.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Mao:2001:TRC,
author = "Wenbo Mao",
title = "Timed-Release Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "342--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590342.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590342.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maurer:2001:C,
author = "Ueli Maurer",
title = "Cryptography $ 2000 \pm 10 $",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2000",
pages = "63--85",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:19 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2000.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2000/20000063.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2000/20000063.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mayer-Sommer:2001:SAS,
author = "Rita Mayer-Sommer",
title = "Smartly Analyzing the Simplicity and the Power of
Simple Power Analysis on Smartcards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "78--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650078.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650078.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mayers:2001:USQ,
author = "Dominic Mayers",
title = "Unconditional security in quantum cryptography",
journal = j-J-ACM,
volume = "48",
number = "3",
pages = "351--406",
month = may,
year = "2001",
CODEN = "JACOAH",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Apr 1 16:52:07 MST 2002",
bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/pubs/citations/journals/jacm/2001-48-3/p351-mayers/",
abstract = "Basic techniques to prove the unconditional security
of quantum cryptography are described. They are applied
to a quantum key distribution protocol proposed by
Bennett and Brassard [1984]. The proof considers a
practical variation on the protocol in which the
channel is noisy and photos may be lost during the
transmission. Each individual signal sent into the
channel must contain a single photon or any
two-dimensional system in the exact state described in
the protocol. No restriction is imposed on the detector
used at the receiving side of the channel, except that
whether or not the received system is detected must be
independent of the basis used to measure this system.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
generalterms = "Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "quantum cryptography; quantum information theory;
unconditional security",
subject = "Data --- Data Encryption (E.3): {\bf Public key
cryptosystems}",
}
@Article{McCook:2001:NSS,
author = "Alison McCook and Philip Yam and Graham P. Collins",
title = "News Scan: The Not So Sheltering Sky; Computer: Hack
Job; Tissue Engineering: Fat into Cartilage;
Psychology: Holier Than Thou; Astronomy: Otherworldly
Ocean; Physics: Microscopic Maelstrom; Medicine: Fetal
Cell Setback",
journal = j-SCI-AMER,
volume = "284",
number = "5",
pages = "24--25",
month = may,
year = "2001",
CODEN = "SCAMAC",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Tue Apr 17 05:07:31 MDT 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciam.com/2001/0501issue/0501quicksummary.html",
URL = "http://www.sciam.com/2001/0501issue/0501inbrief.html",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
keywords = "CSS (content scrambling system); DVD encryption;
efdtt; flood, hurricane, and tornado damage costs;
Jupiter's largest moon, Ganymede; qrpff",
}
@InCollection{McGrew:2001:AAE,
author = "David A. McGrew and Scott R. Fluhrer",
booktitle = "Selected areas in cryptography (Waterloo, ON, 2000)",
title = "Attacks on Additive Encryption of Redundant Plaintext
and Implications on {Internet} Security",
volume = "2012",
publisher = pub-SV,
address = pub-SV:adr,
pages = "14--28",
year = "2001",
MRclass = "94A60",
MRnumber = "1 895 579",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120014.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120014.pdf",
}
@Article{McLoone:2001:HPS,
author = "M. McLoone and J. V. McCanny",
title = "High Performance Single-Chip {FPGA Rijndael} Algorithm
Implementations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "65--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620065.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620065.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{McLoone:2001:SCF,
author = "M{\'a}ire McLoone and John V. McCanny",
title = "Single-Chip {FPGA} Implementation of the Advanced
Encryption Standard Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2147",
pages = "152--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:49 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2147.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2147/21470152.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2147/21470152.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{McMillan:2001:JIA,
author = "Scott McMillan and Cameron Patterson",
title = "{JBits{\TM}} Implementations of the {Advanced
Encryption Standard (Rijndael)}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2147",
pages = "162--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:49 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2147.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2147/21470162.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2147/21470162.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Meadows:2001:OIF,
author = "Catherine Meadows",
title = "Open Issues in Formal Methods for Cryptographic
Protocol Analysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2052",
pages = "21--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2052.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2052/20520021.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2052/20520021.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mehrabi:2001:DW,
author = "Hamid Reza Mehrabi",
title = "Digital Watermark",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2163",
pages = "49--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:07 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2163.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2163/21630049.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2163/21630049.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Meister:2001:PPG,
author = "Gisela Meister and Michael Vogel",
title = "Protection Profiles and Generic Security Targets for
Smart Cards as Secure Signature Creation Devices ---
Existing Solutions for the Payment Sector",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "179--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400179.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400179.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Mel:2001:CD,
author = "H. X. Mel and Doris M. Baker",
title = "Cryptography Decrypted",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xx + 352",
year = "2001",
ISBN = "0-201-61647-5",
ISBN-13 = "978-0-201-61647-7",
LCCN = "QA76.9.A25 M44 2001",
bibdate = "Wed Jan 16 09:04:46 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US \$29.95; CDN \$44.95; UK\pounds 22.99",
acknowledgement = ack-nhfb,
annote = "Contents: Pt. I. Secret Key Cryptography. Ch. 1. Locks
and Keys. Ch. 2. Substitution and Caesar's Cipher. Ch.
3. Transposition Ciphers: Moving Around. Ch. 4. Diffuse
and Confuse: How Cryptographers Win the End Game. Ch.
5. DES Isn't Strong Anymore. Ch. 6. Evolution of
Cryptography: Going Global. Ch. 7. Secret Key
Assurances. Ch. 8. Problems with Secret Key Exchange
--- Pt. II. Public Key Cryptography. Ch. 9. Pioneering
Public Key: Public Exchange of Secret Keys. Ch. 10.
Confidentiality Using Public Keys. Ch. 11. Making
Public Keys: Math Tricks. Ch. 12. Creating Digital
Signatures Using the Private Key. Ch. 13. Hashes:
Non-keyed Message Digests. Ch. 14. Message Digest
Assurances. Ch. 15. Comparing Secret Key, Public Key,
and Message Digests --- Pt. III. Distribution of Public
Keys. Ch. 16. Digital Certificates. Ch. 17. X.509
Public Key Infrastructure. Ch. 18. Pretty Good Privacy
and the Web of Trust --- Pt. IV. Real-World Systems.
Ch. 19. Secure E-mail. Ch. 20. Secure Socket Layer and
Transport Layer Security. Ch. 21. IPsec Overview. Ch.
22. Cryptographic Gotchas. Ch. 23. Protecting Your Keys
--- App. A. Public Key Mathematics (and Some Words on
Random Numbers) --- App. B. (A Few) IPsec Details.",
keywords = "computer security; cryptography",
}
@Article{Messerges:2001:SAF,
author = "Thomas S. Messerges",
title = "Securing the {AES} Finalists Against Power Analysis
Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "150--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780150.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780150.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Meyer:2001:FIC,
author = "Andreas Meyer and Stefan Neis and Thomas Pfahler",
title = "First Implementation of Cryptographic Protocols Based
on Algebraic Number Fields",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "84--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190084.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190084.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Miaou:2001:BCW,
author = "Shaou-Gang Miaou and Tzung-Shian Lee and Chih-Ming
Chen",
title = "{BCH} Coded Watermarks for Error-Prone Transmission of
{MPEG} Video",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "654--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950654.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950654.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Micali:2001:MRR,
author = "Silvio Micali and Leonid Reyzin",
title = "Min-round Resettable Zero-Knowledge in the Public-Key
Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "373--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:02 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2045/20450373.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2045/20450373.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Micali:2001:SPK,
author = "Silvio Micali and Leonid Reyzin",
title = "Soundness in the Public-Key Model",
crossref = "Kilian:2001:ACC",
pages = "542--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390542.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390542.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Micciancio:2001:ILB,
author = "Daniele Micciancio",
booktitle = "Cryptography and lattices (Providence, RI, 2001)",
title = "Improving lattice based cryptosystems using the
{Hermite} normal form",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2146",
pages = "126--145",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "11H71 (94Axx)",
MRnumber = "1 903 892",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mihailescu:2001:BRE,
author = "Preda Mihailescu and F. Pappalardi",
title = "Book review: {{\em Elliptic curves in cryptography}}",
journal = j-MATH-COMPUT,
volume = "70",
number = "236",
pages = "1755--1759",
month = oct,
year = "2001",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Mon Jul 16 07:53:14 MDT 2001",
bibsource = "http://www.ams.org/mcom/2001-70-236;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib",
URL = "http://www.ams.org/mcom/2001-70-236/S0025-5718-01-01400-4/bookrev-S0025-5718-01-01400-4.html;
http://www.ams.org/mcom/2001-70-236/S0025-5718-01-01400-4/S0025-5718-01-01400-4.dvi;
http://www.ams.org/mcom/2001-70-236/S0025-5718-01-01400-4/S0025-5718-01-01400-4.pdf;
http://www.ams.org/mcom/2001-70-236/S0025-5718-01-01400-4/S0025-5718-01-01400-4.ps;
http://www.ams.org/mcom/2001-70-236/S0025-5718-01-01400-4/S0025-5718-01-01400-4.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Minier:2001:SCC,
author = "Marine Minier and Henri Gilbert",
title = "Stochastic Cryptanalysis of {Crypton}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "121--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780121.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780121.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Miyazaki:2001:ISG,
author = "Takeru Miyazaki",
title = "An Improved Scheme of the {Gennaro-Krawczyk-Rabin}
Undeniable Signature System Based on {RSA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2015",
pages = "135--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2015/20150135.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2015/20150135.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mizuki:2001:NSN,
author = "Takaaki Mizuki and Takao Nishizeki",
title = "Necessary and Sufficient Numbers of Cards for Sharing
Secret Keys on Hierarchical Groups",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2223",
pages = "196--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:08 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2223.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2223/22230196.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2223/22230196.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Mollin:2001:IC,
author = "Richard A. Mollin",
title = "An Introduction to Cryptography",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xiii + 373",
year = "2001",
ISBN = "1-58488-127-5",
ISBN-13 = "978-1-58488-127-8",
LCCN = "QA268 .M65 2000",
bibdate = "Wed Jan 16 09:22:51 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 29.99",
series = "The CRC Press series on discrete mathematics and its
applications",
acknowledgement = ack-nhfb,
keywords = "coding theory",
}
@Article{Monsignori:2001:WMS,
author = "M. Monsignori and P. Nesi and M. B. Spinu",
title = "Watermarking Music Sheets",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "646--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950646.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950646.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Moore:2001:AGK,
author = "Patrick C. Moore and Wilbur R. Johnson and Richard J.
Detry",
title = "Adapting {Globus} and {Kerberos} for a Secure {ASCI}
Grid",
crossref = "ACM:2001:SHP",
pages = "??--??",
year = "2001",
bibdate = "Sat Feb 10 14:28:55 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sc2001.org/papers/pap.pap192.pdf",
acknowledgement = ack-nhfb,
pagecount = "9",
}
@Article{Moore:2001:UMW,
author = "Samuel K. Moore",
title = "Unhooking medicine [wireless networking]",
journal = j-IEEE-SPECTRUM,
volume = "38",
number = "1",
pages = "107--108",
month = jan,
year = "2001",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.901156",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "1395 to 1400 MHz; 14 MHz; 1429 to 1432 MHz; 608 to 614
MHz; bedside wireless systems; biomedical telemetry;
Control systems; Cryptography; Digital TV; FCC;
Frequency; Hospitals; hospitals; Internet; medical
device firms; patient data access; Patient monitoring;
patient-worn wireless systems; personal digital
assistant; Protection; radio applications; Telemetry;
Wireless Medical Telemetry Service; wireless
networking; wireless phone",
}
@Article{Morelli:2001:JAH,
author = "Ralph Morelli and Ralph Walde and Gregg Marcuccio",
title = "A {Java API} for historical ciphers: an
object-oriented design project",
journal = j-SIGCSE,
volume = "33",
number = "1",
pages = "307--311",
month = mar,
year = "2001",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/366413.364609",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:56:46 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "This paper describes a project suitable for a software
engineering or object-oriented design course. The
project consists of asking students to design an
application programming interface (API) for a
particular range of applications. An API-design project
has several features not always found in
application-design projects: It forces students to
focus carefully on the distinction between the
programming and the user interfaces; it provides a good
justification for studying existing APIs as model code;
it provides a natural way to divide tasks between
different groups of designers/programmers; and, the
final product can be used as the basis for programming
projects in other courses. In this case the particular
project we describe is the design of an API for
implementing Historical Cipher algorithms.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Moshopoulos:2001:NSA,
author = "Nikos K. Moshopoulos and K. Z. Pekmestzi",
title = "A Novel Systolic Architecture for an Efficient {RSA}
Implementation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "416--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920416.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920416.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{MRaihi:2001:CAS,
author = "David M'Ra{\"\i}hi and Moti Yung",
title = "{E}-commerce applications of smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "4",
pages = "453--472",
day = "16",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/61/28/31/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/61/28/31/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InCollection{Muller:2001:SIC,
author = "Siguna M{\"u}ller",
booktitle = "Public-key cryptography and computational number
theory (Warsaw, 2000)",
title = "A survey of {IND-CCA} secure public-key encryption
schemes relative to factoring",
publisher = pub-GRUYTER,
address = pub-GRUYTER:adr,
pages = "181--196",
year = "2001",
MRclass = "94A60",
MRnumber = "1 881 634",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
}
@InCollection{Muller:2001:SWB,
author = "Siguna M{\"u}ller",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "On the Security of a {Williams} Based Public Key
Encryption Scheme",
volume = "1992",
publisher = pub-SV,
address = pub-SV:adr,
pages = "1--18",
year = "2001",
MRclass = "94A62 (94A60)",
MRnumber = "1 898 021",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920001.pdf",
}
@Misc{Murray:2001:CDC,
author = "Eric Murray",
title = "Changes in Deployment of Cryptography, and Possible
Causes",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, Tenth USENIX Security
Symposium, August 13--17, 2001, Washington, DC, USA.",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/murray/index.htm",
abstract = "SSL/TLS is arguably the most widely deployed
cryptographic protocol and is readily characterized.
Last year my survey of over 8,000 SSL servers found
that about 25\% of them used only weak ``export''-level
keys and cipher suites. With the wider deployment of
TLS, more high-speed cryptographic hardware, and
another year since the U.S. liberalized crypto export
regulations, more sites have deployed strong crypto.
This talk will discuss the results of this year's
survey, the changes in crypto deployment that have
occurred in the last year, and the possible causes of
those changes.",
acknowledgement = ack-nhfb,
}
@Article{Nakahara:2001:LCR,
author = "Jorge {Nakahara, Jr.} and Bart Preneel and Joos
Vandewalle",
title = "Linear Cryptanalysis of Reduced-Round Versions of the
{SAFER} Block Cipher Family",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "244--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780244.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780244.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nakai:2001:SFW,
author = "Yuichi Nakai",
title = "Semi Fragile Watermarking Based on Wavelet Transform",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "796--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950796.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950796.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Naor:2001:RTS,
author = "Dalit Naor and Moni Naor and Jeff Lotspiech",
title = "Revocation and Tracing Schemes for Stateless
Receivers",
crossref = "Kilian:2001:ACC",
pages = "41--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390041.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390041.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Book{Nash:2001:PIM,
author = "Andrew Nash and William Duane and Celia Joseph and
Derek Brink",
title = "{PKI}: Implementing and Managing {E}-Security",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "xxii + 513",
year = "2001",
ISBN = "0-07-213123-3",
ISBN-13 = "978-0-07-213123-9",
LCCN = "QA76.9.A25 P5 2001",
bibdate = "Wed Jan 16 10:56:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.99",
acknowledgement = ack-nhfb,
}
@Article{Neraud:2001:CFD,
author = "Jean N{\'e}raud and Carla Selmi",
title = "On codes with a finite deciphering delay: constructing
uncompletable words",
journal = j-THEOR-COMP-SCI,
volume = "255",
number = "1--2",
pages = "151--162",
day = "28",
month = mar,
year = "2001",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Apr 17 08:40:28 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl../28/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/197/21/28/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Nguyen:2001:ISA,
author = "Phong Q. Nguyen and Igor E. Shparlinski",
title = "On the Insecurity of a Server-Aided {RSA} Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "21--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480021.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480021.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nguyen:2001:TFLa,
author = "Phong Q. Nguyen and Jacques Stern",
title = "The Two Faces of Lattices in Cryptology",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2146",
pages = "146--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:49 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2146.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2146/21460146.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2146/21460146.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nguyen:2001:TFLb,
author = "Phong Q. Nguyen",
title = "The Two Faces of Lattices in Cryptology",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2259",
pages = "313--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2259.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2259/22590313.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2259/22590313.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nicholson:2001:YBC,
author = "John Nicholson",
title = "You've Been Cracked \ldots{} and Now You're Sued",
journal = j-LOGIN,
volume = "26",
number = "2",
pages = "??--??",
month = apr,
year = "2001",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:51:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.usenix.org/publications/login/2001-04/index.html",
URL = "http://www.usenix.org/publications/login/2001-04/pdfs/nicholson.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@Article{Nieto:2001:PKC,
author = "Juan Manuel Gonz{\'a}lez Nieto and Colin Boyd and Ed
Dawson",
title = "A Public Key Cryptosystem Based on the Subgroup
Membership Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "352--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290352.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290352.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{NIST:2001:CT,
author = "{NIST}",
title = "Cryptographic Toolkit",
howpublished = "World-Wide Web document",
year = "2001",
bibdate = "Wed Apr 20 12:03:17 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/CryptoToolkit/",
acknowledgement = ack-nhfb,
remark = "The Cryptographic Toolkit is a collection of standards
and guidance --- not actual software implementations of
the algorithms.",
}
@TechReport{NIST:2001:SRC,
author = "{NIST}",
title = "Security Requirements for Cryptographic Modules",
type = "Federal Information Processing Standards Publication",
number = "FIPS PUB 140-2",
institution = pub-NIST,
address = pub-NIST:adr,
day = "25",
month = may,
year = "2001",
bibdate = "Wed Aug 04 09:46:50 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
}
@Article{Novak:2001:SBA,
author = "Roman Novak",
title = "{SPA}-Based Adaptive Chosen-Ciphertext Attack on {RSA}
Implementation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "252--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740252.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740252.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nozaki:2001:IRA,
author = "H. Nozaki and M. Motoyama and A. Shimbo and S.
Kawamura",
title = "Implementation of {RSA} Algorithm Based on {RNS
Montgomery} Multiplication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "364--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620364.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620364.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nyberg:2001:CTC,
author = "Kaisa Nyberg",
title = "Correlation theorems in cryptanalysis",
journal = j-DISCRETE-APPL-MATH,
volume = "111",
number = "1-2",
pages = "177--188",
year = "2001",
CODEN = "DAMADU",
ISSN = "0166-218X (print), 1872-6771 (electronic)",
ISSN-L = "0166-218X",
MRclass = "94A60 (94C10)",
MRnumber = "2002f:94042",
MRreviewer = "Michael M. Dediu",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Discrete Applied Mathematics. Combinatorial
Algorithms, Optimization and Computer Science",
}
@Article{Ohkuma:2001:BCH,
author = "Kenji Ohkuma and Hirofumi Muratani and Fumihiko Sano
and Shinichi Kawamura",
title = "The Block Cipher Hierocrypt",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "72--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120072.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120072.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Okada:2001:IEC,
author = "Souichi Okada and Naoya Torii and Kouichi Itoh and
Masahiko Takenaka",
title = "Implementation of Elliptic Curve Cryptographic
Coprocessor over {$ {\rm GF}(2^m) $} on an {FPGA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "25--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650025.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650025.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Okamoto:2001:GPN,
author = "Tatsuaki Okamoto and David Pointcheval",
title = "The Gap-Problems: a New Class of Problems for the
Security of Cryptographic Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "104--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920104.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920104.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Okamoto:2001:RRE,
author = "Tatsuaki Okamoto and David Pointcheval",
booktitle = "Topics in cryptology---CT-RSA 2001 (San Francisco,
CA)",
title = "{REACT}: rapid enhanced-security asymmetric
cryptosystem transform",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "159--175",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A62 (94A60)",
MRnumber = "1 907 096",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Okeya:2001:EEC,
author = "K. Okeya and K. Sakurai",
title = "Efficient Elliptic Curve Cryptosystems from a Scalar
Multiplication Algorithm with Recovery of the
$y$-Coordinate on a {Montgomery}-Form Elliptic Curve",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "126--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620126.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620126.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Onions:2001:SSI,
author = "Paul Onions",
title = "On the Strength of Simply-Iterated {Feistel} Ciphers
with Whitening Keys",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "63--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200063.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200063.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Oppliger:2001:SMP,
author = "Rolf Oppliger",
title = "Secure messaging with {PGP} and {S/MIME}",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "xxiii + 305",
year = "2001",
ISBN = "1-58053-161-X",
ISBN-13 = "978-1-58053-161-0",
LCCN = "TK5102.85 .O67 2001",
bibdate = "Thu May 12 10:35:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Artech House computer security series",
URL = "http://www.artechhouse.com/Detail.aspx?strIsbn=978-1-58053-161-0",
acknowledgement = ack-nhfb,
subject = "telecommunication systems; security measures; PGP
(computer file); data encryption (computer science);
electronic mail systems",
}
@InProceedings{Paeng:2001:NPK,
author = "Seong-Hun Paeng and Kil-Chan Ha and Jae Heon Kim and
Seongtaek Chee and Choonsik Park",
title = "New Public Key Cryptosystem Using Finite Non {Abelian}
Groups",
crossref = "Kilian:2001:ACC",
pages = "470--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390470.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390470.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Papadimitriou:2001:PSE,
author = "S. Papadimitriou and T. Bountis and S. Mavroudi and A.
Bezerianos",
title = "A probabilistic symmetric encryption scheme for very
fast secure communication based on chaotic systems of
difference equations",
journal = j-INT-J-BIFURC-CHAOS-APPL-SCI-ENG,
volume = "11",
number = "12",
pages = "3107--3115",
year = "2001",
CODEN = "IJBEE4",
ISSN = "0218-1274",
MRclass = "94A60 (37N99)",
MRnumber = "1 885 260",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "International Journal of Bifurcation and Chaos in
Applied Sciences and Engineering",
}
@Article{Park:2001:CSC,
author = "DongGook Park and JungJoon Kim and Colin Boyd and Ed
Dawson",
title = "Cryptographic Salt: a Countermeasure against
Denial-of-Service Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "334--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190334.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190334.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Park:2001:DNP,
author = "Hee-Un Park and Im-Yeong Lee",
title = "A Digital Nominative Proxy Signature Scheme for Mobile
Communication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "451--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290451.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290451.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Park:2001:NDW,
author = "Ji Hwan Park and Sook Ee Jeong and Young Huh",
title = "A New Digital Watermarking for Text Document Images
Using Diagonal Profile",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "748--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950748.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950748.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Park:2001:RFW,
author = "Ji Hwan Park and Sook Ee Jeong and Chang Soo Kim",
title = "Robust and Fragile Watermarking Techniques for
Documents Using Bi-directional Diagonal Profiles",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "483--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290483.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290483.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Parker:2001:RKC,
author = "Andrew T. Parker and Kevin M. Short",
title = "Reconstructing the keystream from a chaotic encryption
scheme",
journal = "IEEE Trans. Circuits Systems I Fund. Theory Appl.",
volume = "48",
number = "5",
pages = "624--635",
year = "2001",
CODEN = "ITCAEX",
ISSN = "1057-7122 (print), 1558-1268 (electronic)",
MRclass = "94A60",
MRnumber = "2002j:94046",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "IEEE Transactions on Circuits and Systems. I.
Fundamental Theory and Applications",
}
@Article{Patarin:2001:QBL,
author = "Jacques Patarin and Nicolas Courtois and Louis
Goubin",
title = "{QUARTZ}, $ 128 $-Bit Long Digital Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "282--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200282.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200282.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Patterson:2001:DFI,
author = "Cameron Patterson",
title = "A Dynamic {FPGA} Implementation of the {Serpent} Block
Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "141--155",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650141.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650141.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Paulson:2001:RBS,
author = "Lawrence C. Paulson",
title = "Relations between secrets: two formal analyses of the
{Yahalom} protocol",
journal = j-J-COMP-SECUR,
volume = "9",
number = "3",
pages = "197--216",
month = "????",
year = "2001",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2001-9302",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:21:43 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Pemble:2001:CEW,
author = "Matthew Pemble",
title = "Confidentiality: From Encryption, to Where?",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "4",
pages = "10--11",
day = "1",
month = apr,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00417-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801004172",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Pemble:2001:SPA,
author = "Matthew Pemble",
title = "A Sceptical Pigeon Amongst The Crypto Cats: Report on
the {Edinburgh Financial Cryptographic Engineering
Conference, 2001}",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "7",
pages = "7--9",
day = "1",
month = jul,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00715-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:16 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801007152",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Pfitzmann:2001:SEC,
author = "Birgit Pfitzmann and Ahmad-Reza Sadeghi",
title = "Self-Escrowed Cash against User Blackmailing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "42--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620042.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620042.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Phillips:2001:GRI,
author = "Deborah M. Phillips and Hans A. von Spakovsky",
title = "Gauging the risks of {Internet} elections",
journal = j-CACM,
volume = "44",
number = "1",
pages = "73--73",
month = jan,
year = "2001",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Sat Dec 30 12:33:46 MST 2000",
bibsource = "http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See correction \cite{Crawford:2001:FPV}.",
URL = "http://www.acm.org/pubs/citations/journals/cacm/2001-44-1/p73-phillips/",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Phoha:2001:SDI,
editor = "Vir V. Phoha",
title = "The {Springer} Dictionary of {Internet} Security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "288 (est.)",
year = "2001",
ISBN = "0-387-95261-6",
ISBN-13 = "978-0-387-95261-1",
LCCN = "TK5105.59 .P56 2002",
bibdate = "Wed Feb 13 17:40:57 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
acknowledgement = ack-nhfb,
}
@Article{Picard:2001:NNF,
author = "Justin Picard and Arnaud Robert",
title = "Neural Networks Functions for Public Key
Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "142--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370142.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370142.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pieprzyk:2001:CPS,
author = "J. Pieprzyk and X.-M. Zhang",
title = "Cheating Prevention in Secret Sharing over {$ {\rm
GF}(p t) $}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "79--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470079.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470079.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pliam:2001:PTU,
author = "John O. Pliam",
title = "A Polynomial-Time Universal Security Amplifier in the
Class of Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "169--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120169.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120169.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Poh:2001:HBP,
author = "Norman Poh and Jerzy Korczak",
title = "Hybrid Biometric Person Authentication Using Face and
Voice Features",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2091",
pages = "348--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:50 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2091.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2091/20910348.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2091/20910348.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pohlmann:2001:SCA,
author = "Norbert Pohlmann",
title = "Smart cards: The Authenticated Solution For E-business
User",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "4",
pages = "12--15",
day = "1",
month = apr,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)00418-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801004184",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Pornin:2001:SHT,
author = "Thomas Pornin and Jacques Stern",
title = "Software-Hardware Trade-Offs: Application to {A5/1}
Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "318--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650318.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650318.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pornin:2001:THE,
author = "T. Pornin",
title = "Transparent Harddisk Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "273--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620273.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620273.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Praca:2001:SCS,
author = "Denis Praca and Claude Barral",
title = "From smart cards to smart objects: the road to new
smart technologies",
journal = j-COMP-NET-AMSTERDAM,
volume = "36",
number = "4",
pages = "381--389",
day = "16",
month = jul,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Jul 25 16:48:14 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/61/28/26/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/61/28/26/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Preneel:2001:NES,
author = "Bart Preneel",
title = "{New European Schemes for Signature, Integrity and
Encryption (NESSIE)}: a Status Report",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "297--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740297.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740297.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "NESSIE (New European Schemes for Signature, Integrity
and Encryption)",
}
@InProceedings{Provos:2001:DAS,
author = "Niels Provos",
title = "Defending Against Statistical Steganalysis",
crossref = "USENIX:2001:PTU",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/provos.html",
acknowledgement = ack-nhfb,
}
@Article{Pucheral:2001:PSD,
author = "Philippe Pucheral and Luc Bouganim and Patrick
Valduriez and Christophe Bobineau",
title = "{PicoDBMS}: {Scaling} down database techniques for the
smartcard",
journal = j-VLDB-J,
volume = "10",
number = "2--3",
pages = "120--132",
month = sep,
year = "2001",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s007780100047",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Jun 23 10:50:58 MDT 2008",
bibsource = "http://link.springer.de/link/service/journals/00778/tocs/t1010002.htm;
http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/journals/00778/bibs/1010002/10100120.htm;
http://link.springer.de/link/service/journals/00778/papers/1010002/10100120.pdf",
abstract = "Smartcards are the most secure portable computing
device today. They have been used successfully in
applications involving money, and proprietary and
personal data (such as banking, healthcare, insurance,
etc.). As smartcards get more powerful (with 32-bit CPU
and more than 1 MB of stable memory in the next
versions) and become multi-application, the need for
database management arises. However, smartcards have
severe hardware limitations (very slow write, very
little RAM, constrained stable memory, no autonomy,
etc.) which make traditional database technology
irrelevant. The major problem is scaling down database
techniques so they perform well under these
limitations. In this paper, we give an in-depth
analysis of this problem and propose a PicoDBMS
solution based on highly compact data structures, query
execution without RAM, and specific techniques for
atomicity and durability. We show the effectiveness of
our techniques through performance evaluation.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "atomicity; durability; execution model; PicoDBMS;
query optimization; smartcard applications; storage
model",
}
@Article{Qu:2001:KPW,
author = "Gang Qu",
title = "Keyless Public Watermarking for Intellectual Property
Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "96--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370096.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370096.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Quisquater:2001:EAE,
author = "Jean-Jacques Quisquater and David Samyde",
title = "{ElectroMagnetic} Analysis {(EMA)}: Measures and
Counter-Measures for Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "200--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400200.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400200.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ramesh:2001:TAE,
author = "D. Ramesh",
title = "A Twin Algorithm for Efficient Generation of Digital
Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "267--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470267.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470267.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Rand:2001:MRD,
author = "{Rand Corporation}",
title = "A Million Random Digits With 100,000 Normal Deviates",
publisher = "Rand Corporation",
address = "Santa Monica, CA, USA",
pages = "xxv + 400 + 200",
year = "2001",
ISBN = "0-8330-3047-7",
ISBN-13 = "978-0-8330-3047-4",
LCCN = "QA276.25 .M55 2001",
bibdate = "Sat Aug 23 07:58:03 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See also \cite{Rand:1955:MRD}.",
acknowledgement = ack-nhfb,
}
@Article{Reeds:2001:BRB,
author = "Jim Reeds",
title = "Book Review: {{\booktitle{The Code Book: the Evolution
of Secrecy from Mary Queen Of Scots to Quantum
Cryptography}}, by Simon Singh. Anchor Books}",
journal = j-SIGACT,
volume = "32",
number = "2",
pages = "6--11",
month = jun,
year = "2001",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/504192.1005763",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:24 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Singh:1999:CBE}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Rescorla:2001:IOPa,
author = "Eric Rescorla",
title = "An Introduction to {OpenSSL} Programming, {Part I} of
{II}",
journal = j-LINUX-J,
volume = "89",
pages = "74, 76--78, 80, 82--83",
month = sep,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Aug 30 06:06:53 MDT 2001",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue89/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Filling in the gaps of the OpenSSL manual pages.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Rescorla:2001:IOPb,
author = "Eric Rescorla",
title = "An Introduction to {OpenSSL} Programming, {Part II} of
{II}",
journal = j-LINUX-J,
volume = "92",
pages = "??--??",
month = dec,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Fri Feb 8 14:44:29 MST 2002",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue92/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Web only.",
URL = "http://www.linuxjournal.com/article.php?sid=5487",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Misc{Reynard:2001:SCB,
author = "Robert Reynard",
title = "Secret Code Breaker Online",
howpublished = "World-Wide Web document",
month = sep,
year = "2001",
bibdate = "Thu Jan 17 10:49:32 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://codebreaker.dids.com/",
acknowledgement = ack-nhfb,
}
@Misc{Rijmen:2001:WHF,
author = "Vincent Rijmen and Paulo S. L. M. Barreto",
title = "The {WHIRLPOOL} Hash Function",
howpublished = "World-Wide Web document",
year = "2001",
bibdate = "Tue Jul 26 18:45:41 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://paginas.terra.com.br/informatica/paulobarreto/WhirlpoolPage.html;
http://planeta.terra.com.br/informatica/paulobarreto/whirlpool.zip",
abstract = "WHIRLPOOL is a hash function designed by Vincent
Rijmen and Paulo S. L. M. Barreto that operates on
messages less than 2256 bits in length, and produces a
message digest of 512 bits.\par
WHIRLPOOL has been selected for the NESSIE portfolio of
cryptographic primitives. The International
Organization for Standardization (ISO) has decided to
include the final version of WHIRLPOOL in the revised
ISO/IEC 10118-3:2003(E) standard.",
acknowledgement = ack-nhfb,
keywords = "NESSIE (New European Schemes for Signature, Integrity
and Encryption)",
}
@Article{Rivest:2001:HLS,
author = "Ronald L. Rivest and Adi Shamir and Yael Tauman",
title = "How to Leak a Secret",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "552--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480552.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480552.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Romao:2001:SMA,
author = "Artur Rom{\~a}o and Miguel Mira da Silva",
title = "Secure Mobile Agent Digital Signatures with Proxy
Certificates",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2033",
pages = "206--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:50 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2033.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2033/20330206.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2033/20330206.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Romer:2001:ILA,
author = "Tanja R{\"o}mer and Jean-Pierre Seifert",
title = "Information Leakage Attacks against Smart Card
Implementations of the Elliptic Curve Digital Signature
Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "211--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400211.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400211.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Roth:2001:EJA,
author = "Volker Roth and Vania Conan",
title = "Encrypting {Java} Archives and Its Application to
Mobile Agent Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1991",
pages = "229--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:10 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1991.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1991/19910229.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1991/19910229.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Roth:2001:RSC,
author = "Volker Roth",
title = "On the Robustness of Some Cryptographic Protocols for
Mobile Agent Protection",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2240",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:25 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2240.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2240/22400001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2240/22400001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Manual{RSA:2001:PVC,
author = "{RSA Laboratories}",
title = "{PKCS \#11 v2.11}: Cryptographic Token Interface
Standard",
organization = pub-RSA,
address = pub-RSA:adr,
pages = "374",
day = "1",
month = nov,
year = "2001",
bibdate = "Mon Dec 08 08:20:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-11/index.html",
acknowledgement = ack-nhfb,
}
@Article{Rubin:2001:SCR,
author = "Avi Rubin",
title = "Security Considerations for Remote Electronic Voting
Over the {Internet}",
journal = j-LOGIN,
volume = "26",
number = "1",
pages = "??--??",
month = feb,
year = "2001",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:45:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.usenix.org/publications/login/2001-02/index.html",
URL = "http://www.usenix.org/publications/login/2001-02/pdfs/rubin.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@Article{Rudra:2001:ERE,
author = "A. Rudra and P. K. Dubey and C. S. Jutla and V. Kumar
and J. R. Rao and P. Rohatgi",
title = "Efficient {Rijndael} Encryption Implementation with
Composite Field Arithmetic",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "171--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620171.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620171.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ruiz:2001:SPS,
author = "Antonio Ruiz and Gregorio Mart{\'\i}nez and Oscar
C{\'a}novas and Antonio F. G{\'o}mez",
title = "{SPEED} Protocol: Smartcard-Based Payment with
Encrypted Electronic Delivery",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "446--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000446.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000446.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Manual{Rukhin:2001:STS,
author = "Andrew Rukhin and Juan Soto and James Nechvatal and
Miles Smid and Elaine Barker and Stefan Leigh and Mark
Levenson and Mark Vangel and David Banks and Alan
Heckert and James Dray and San Vo",
title = "A Statistical Test Suite For Random and Pseudorandom
Number Generators for Cryptographic Applications",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "xi + 153",
month = apr,
year = "2001",
bibdate = "Tue Apr 19 15:40:44 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "NIST Special Publication 800-22, with revisions dated
May 15, 2001.",
URL = "http://csrc.nist.gov/rng/rng2.html;
http://csrc.nist.gov/rng/SP800-22b.pdf;
http://csrc.nist.gov/rng/sts-1.5.tar;
http://csrc.nist.gov/rng/sts.data.tar;
http://csrc.nist.gov/rng/StsGui.zip;
http://www.cs.sunysb.edu/~algorith/implement/rng/distrib/SP800-22b.pdf",
abstract = "This paper discusses some aspects of selecting and
testing random and pseudorandom number generators. The
outputs of such generators may be used in many
cryptographic applications, such as the generation of
key material. Generators suitable for use in
cryptographic applications may need to meet stronger
requirements than for other applications. In
particular, their outputs must be unpredictable in the
absence of knowledge of the inputs. Some criteria for
characterizing and selecting appropriate generators are
discussed in this document. The subject of statistical
testing and its relation to cryptanalysis is also
discussed, and some recommended statistical tests are
provided. These tests may be useful as a first step in
determining whether or not a generator is suitable for
a particular cryptographic application. However, no set
of statistical tests can absolutely certify a generator
as appropriate for usage in a particular application,
i.e., statistical testing cannot serve as a substitute
for cryptanalysis. The design and cryptanalysis of
generators is outside the scope of this paper.",
acknowledgement = ack-nhfb,
keywords = "hypothesis test; P-value; random number generator",
}
@Article{Safavi-Naini:2001:BAG,
author = "Rei Safavi-Naini and Huaxiong Wang",
title = "Broadcast authentication for group communication",
journal = j-THEOR-COMP-SCI,
volume = "269",
number = "1--2",
pages = "1--21",
day = "28",
month = oct,
year = "2001",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Nov 19 08:33:27 MST 2001",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/41/16/219/27/27/abstract.html;
http://www.elsevier.nl/gej-ng/10/41/16/219/27/27/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Safavi-Naini:2001:LAC,
author = "R. Safavi-Naini and H. Wang and C. Xing",
title = "Linear Authentication Codes: Bounds and
Constructions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "127--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470127.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470127.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sakamura:2001:GEI,
author = "Ken Sakamura",
title = "Guest Editor's Introduction: Radio Frequency
Identification and Noncontact Smart Cards",
journal = j-IEEE-MICRO,
volume = "21",
number = "6",
pages = "4--6",
month = nov # "\slash " # dec,
year = "2001",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2001.977752",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jan 31 18:42:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mi/books/mi2001/m6004abs.htm;
http://dlib.computer.org/mi/books/mi2001/pdf/m6004.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Sakurai:2001:NSS,
author = "Kouichi Sakurai and Tsuyoshi Takagi",
title = "New Semantically Secure Public-Key Cryptosystems from
the {RSA}-Primitive",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2274",
pages = "1--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:07 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2274/22740001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2274/22740001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Sale:2001:GRT,
author = "Tony Sale",
title = "General Report on {Tunny}: The {Newmanry} History",
month = mar,
year = "2001",
bibdate = "Wed Apr 20 12:11:10 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.codesandciphers.org.uk/documents/newman/newman.pdf",
acknowledgement = ack-nhfb,
remark = "The original report was written by Donald Michie, Jack
Good and other members of the Newmanry, after the end
of World War II and has only recently been
declassified.",
}
@Misc{Salus:2001:CA,
author = "Peter Salus",
title = "2001: a Communications Anniversary",
year = "2001",
bibdate = "Tue Oct 15 15:38:06 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, LISA 2001: 15th Systems
Administration Conference, December 2--7, 2001, Town
and Country Resort Hotel, San Diego, CA.",
URL = "http://db.usenix.org/publications/library/proceedings/lisa2001/tech/",
abstract = "We are at the end of a year that provided a flood of
important anniversaries important to LISA attendees.
Peter will discuss the anniversaries and the
significance of this confluence. Among
them:\\par
\begin{itemize} \item 1676: Leibnitz's mechanical
calculator \\
\item 1876: Bell's telephone \\
\item 1901: Marconi's trans-Atlantic message \\
\item 1951: The junction transistor \\
\item 1951: UNIVAC, first commercial computer \\
\item 1976: John Lions and students install UNIX \\
\item 1976: 63 hosts on the ARPAnet \\
\item 1991: Phil Zimmerman posts PGP \\
\item 1991: Tim Berners-Lee posts what we now call www
\\
\item 1991: Linus Torvalds posts Linux .01
\end{itemize}\par
What a ride!",
acknowledgement = ack-nhfb,
}
@Article{Samarati:2001:AMP,
author = "Pierangela Samarati and Michael K. Reiter and Sushil
Jajodia",
title = "An authorization model for a public key management
service",
journal = j-TISSEC,
volume = "4",
number = "4",
pages = "453--482",
month = nov,
year = "2001",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 25 16:47:23 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Samid:2001:ESR,
author = "Gideon Samid",
title = "Encryption Sticks (Randomats)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "150--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290150.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290150.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sanchez-Reillo:2001:IBA,
author = "Raul Sanchez-Reillo",
title = "Including Biometric Authentication in a Smart Card
Operating System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2091",
pages = "342--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:50 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2091.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2091/20910342.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2091/20910342.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sanchez:2001:RNM,
author = "David S{\'a}nchez and Agust{\'\i}n Orfila and Julio
C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a
Sierra",
title = "Robust New Method in Frequency Domain Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "166--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000166.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000166.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sarkar:2001:EIL,
author = "P. Sarkar and S. Maitra",
title = "Efficient Implementation of ``Large'' Stream Cipher
Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "319--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620319.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620319.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sarkar:2001:PAE,
author = "P. Sarkar and P. J. Schellenberg",
title = "A Parallel Algorithm for Extending Cryptographic Hash
Functions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "40--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470040.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470040.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Satoh:2001:CRH,
author = "Akashi Satoh and Sumio Morioka and Kohji Takano and
Seiji Munetoh",
title = "A Compact {Rijndael} Hardware Architecture with
{S}-Box Optimization",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "239--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480239.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480239.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Scharinger:2001:ASK,
author = "Josef Scharinger",
title = "Application of Signed {Kolmogorov} Hashes to Provide
Integrity and Authenticity in {Web}-Based Software
Distribution",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2178",
pages = "257--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:59 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2178.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2178/21780257.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2178/21780257.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Schindler:2001:IDC,
author = "Werner Schindler and Fran{\c{c}}ois Koeune and
Jean-Jacques Quisquater",
title = "Improving Divide and Conquer Attacks against
Cryptosystems by Better Error Detection\slash
Correction Strategies",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "245--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600245.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600245.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Schindler:2001:TAA,
author = "Werner Schindler",
title = "A Timing Attack against {RSA} with the {Chinese
Remainder Theorem}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "109--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650109.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650109.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InCollection{Schnorr:2001:SDE,
author = "Claus Peter Schnorr",
booktitle = "Public-key cryptography and computational number
theory (Warsaw, 2000)",
title = "Security of {DL}-encryption and signatures against
generic attacks---a survey",
publisher = pub-GRUYTER,
address = pub-GRUYTER:adr,
pages = "257--282",
year = "2001",
MRclass = "94A60 (94-02)",
MRnumber = "1 881 640",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
}
@Article{Schnorr:2001:SGH,
author = "C. P. Schnorr",
title = "Small generic hardcore subsets for the discrete
logarithm: {Short} secret {DL}-keys",
journal = j-INFO-PROC-LETT,
volume = "79",
number = "2",
pages = "93--98",
day = "30",
month = jun,
year = "2001",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Wed Jul 25 16:11:35 MDT 2001",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/23/20/80/31/31/abstract.html;
http://www.elsevier.nl/gej-ng/10/23/20/80/31/31/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@TechReport{Screamer:2001:MDR,
author = "Beale Screamer",
title = "{Microsoft}'s Digital Rights Management Scheme ---
Technical Details",
type = "Report",
institution = "Microsoft Corporation",
address = "Redmond, WA, USA",
day = "20",
month = oct,
year = "2001",
bibdate = "Thu Sep 22 18:58:17 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://cryptome.org/ms-drm.htm",
acknowledgement = ack-nhfb,
remark = "The author name appears to be pseudonym: it appears in
quotes in the document.",
}
@Article{Sebe:2001:OIW,
author = "Francesc Seb{\'e} and Josep Domingo-Ferrer",
title = "Oblivious Image Watermarking Robust against Scaling
and Geometric Distortions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "420--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000420.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000420.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Seki:2001:DCR,
author = "Haruki Seki and Toshinobu Kaneko",
booktitle = "Selected areas in cryptography (Waterloo, ON, 2000)",
title = "Differential cryptanalysis of reduced rounds of
{GOST}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "315--323",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 895 600",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Seo:2001:CDA,
author = "Jin S. Seo and Chang D. Yoo",
title = "Correlation Detection of Asymmetric Watermark",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "638--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950638.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950638.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shacham:2001:ISH,
author = "Hovav Shacham and Dan Boneh",
title = "Improving {SSL} Handshake Performance via Batching",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "28--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200028.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200028.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Shailer:2001:PMT,
author = "David M. Shailer",
title = "The project manager's toolkit: practical checklists
for systems development",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xiii + 244",
year = "2001",
ISBN = "0-7506-5035-4",
ISBN-13 = "978-0-7506-5035-9",
LCCN = "QA76.9.S88 S53 2001",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
acknowledgement = ack-nhfb,
}
@InProceedings{Shamir:2001:IOO,
author = "Adi Shamir and Yael Tauman",
title = "Improved Online\slash Offline Signature Schemes",
crossref = "Kilian:2001:ACC",
pages = "355--??",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390355.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390355.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Shamir:2001:NDC,
author = "A. Shamir",
title = "New Directions in Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "159--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620159.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620159.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shamir:2001:PSC,
author = "Adi Shamir",
title = "Protecting Smart Cards from Passive Power Analysis
with Detached Power Supplies",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "71--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650071.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650071.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shao:2001:BVM,
author = "Zuhua Shao",
title = "Batch verifying multiple {DSA}-type digital
signatures",
journal = j-COMP-NET-AMSTERDAM,
volume = "37",
number = "3--4",
pages = "383--389",
day = "5",
month = nov,
year = "2001",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Wed Feb 20 06:34:11 MST 2002",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/67/34/35/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Sharp:2001:IKB,
author = "Toby Sharp",
title = "An Implementation of Key-Based Digital Signal
Steganography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "13--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370013.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370013.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Shepherd:2001:CDC,
author = "Simon Shepherd",
title = "Cryptography: diffusing the confusion",
volume = "5",
publisher = "Research Studies Press",
address = "Philadelphia, PA, USA",
pages = "xiv + 152",
year = "2001",
ISBN = "0-86380-270-2",
ISBN-13 = "978-0-86380-270-6",
LCCN = "QA268.S44 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Communications systems, techniques, and applications
series",
acknowledgement = ack-nhfb,
keywords = "coding theory; cryptography --- mathematics",
}
@Article{Shi:2001:NSF,
author = "Jiaoying Shi and Kaixiang Yi",
title = "New Semi-fragile Authentication Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "969--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950969.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950969.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Shoup:2001:OR,
author = "Victor Shoup",
title = "{OAEP} Reconsidered",
crossref = "Kilian:2001:ACC",
pages = "239--259",
year = "2001",
bibdate = "Sat Feb 2 13:05:41 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2139/21390239.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2139/21390239.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2001; cryptography",
}
@Article{Shparlinski:2001:UDR,
author = "Igor E. Shparlinski",
title = "On the uniformity of distribution of the {RSA} pairs",
journal = j-MATH-COMPUT,
volume = "70",
number = "234",
pages = "801--808",
month = apr,
year = "2001",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Apr 18 05:10:18 MDT 2001",
bibsource = "http://www.ams.org/mcom/2001-70-234;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/journal-getitem?pii=S0025-5718-00-01274-6;
http://www.ams.org/mcom/2001-70-234/S0025-5718-00-01274-6/S0025-5718-00-01274-6.dvi;
http://www.ams.org/mcom/2001-70-234/S0025-5718-00-01274-6/S0025-5718-00-01274-6.pdf;
http://www.ams.org/mcom/2001-70-234/S0025-5718-00-01274-6/S0025-5718-00-01274-6.ps;
http://www.ams.org/mcom/2001-70-234/S0025-5718-00-01274-6/S0025-5718-00-01274-6.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Shujun:2001:PRB,
author = "L. Shujun and M. Xuanqin and C. Yuanlong",
title = "Pseudo-random Bit Generator Based on Couple Chaotic
Systems and Its Applications in Stream-Cipher
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "316--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470316.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470316.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Siegelin:2001:SCD,
author = "C. Siegelin and L. Castillo and U. Finger",
title = "{Smart Cards}: Distributed Computing with \$5
Devices",
journal = j-PARALLEL-PROCESS-LETT,
volume = "11",
number = "1",
pages = "57--??",
month = mar,
year = "2001",
CODEN = "PPLTEE",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
bibdate = "Sat Feb 23 19:27:51 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ppl/ppl.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Singh:2001:DPK,
author = "A. K. Singh",
title = "Deployment of Public-Key Infrastructure in Wireless
Data Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2094",
pages = "217--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:54 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2094.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2094/20940217.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2094/20940217.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Singh:2001:SSS,
author = "Simon Singh",
title = "The Science of Secrecy: The Secret History of Codes
and Codebreaking",
publisher = "Fourth Estate",
address = "London, UK",
pages = "xi + 224",
year = "2001",
ISBN = "1-84115-435-0",
ISBN-13 = "978-1-84115-435-0",
LCCN = "Z103 .S57 2000",
bibdate = "Thu Jan 29 18:07:39 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 14.99",
acknowledgement = ack-nhfb,
}
@Article{Smart:2001:CDF,
author = "N. P. Smart",
title = "A comparison of different finite fields for elliptic
curve cryptosystems",
journal = j-COMPUT-MATH-APPL,
volume = "42",
number = "1-2",
pages = "91--100",
year = "2001",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
MRclass = "94A60",
MRnumber = "2002c:94033",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Computers \& Mathematics with Applications. An
International Journal",
}
@Book{Smith:2001:ADB,
editor = "Michael Smith and Ralph Erskine",
title = "Action This Day: {Bletchley Park} from the breaking of
the {Enigma Code} to the birth of the modern computer",
publisher = pub-BANTAM,
address = pub-BANTAM:adr,
pages = "xv + 543",
year = "2001",
ISBN = "0-593-04910-1",
ISBN-13 = "978-0-593-04910-5",
LCCN = "D810.C88 A28 2001",
bibdate = "Wed Jan 16 08:17:47 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 25.00",
URL = "http://frode.home.cern.ch/frode/crypto/ActionContents.html",
acknowledgement = ack-nhfb,
keywords = "Bletchley Park (Buckinghamshire, England)--History;
Cryptography--Great Britain--History--20th century;
Electronic intelligence--Great Britain--History--20th
century; Government Communications Headquarters;
Intelligence services--Great Britain--History--20th
century; World War, 1939--1945--Cryptography; World
War, 1939--1945--Electronic intelligence--Great
Britain",
xxnote = "Check: University of California Melvyl catalog has
Ralph Erskine as primary author??",
}
@Book{Smith:2001:APP,
author = "Richard E. Smith",
title = "Authentication: From Passwords to Public Keys",
publisher = pub-AW,
address = pub-AW:adr,
pages = "549",
year = "2001",
ISBN = "0-201-61599-1",
ISBN-13 = "978-0-201-61599-9",
LCCN = "QA76.9.A25 S65 2002",
bibdate = "Tue Apr 30 05:08:54 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.99",
acknowledgement = ack-nhfb,
}
@Book{Smith:2001:ECB,
author = "Michael Smith",
title = "The {Emperor}'s Codes: {Bletchley Park} and the
breaking of {Japan}'s secret ciphers",
publisher = pub-BANTAM,
address = pub-BANTAM:adr,
pages = "410 + 14",
year = "2001",
ISBN = "0-553-81320-X (paperback)",
ISBN-13 = "978-0-553-81320-3 (paperback)",
LCCN = "????",
bibdate = "Wed Jan 16 09:07:49 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 7.99",
acknowledgement = ack-nhfb,
}
@Article{Smith:2001:IK,
author = "David Smith",
title = "Implementing {Kerberos}",
journal = j-SYS-ADMIN,
volume = "10",
number = "12",
pages = "28, 30, 32, 34--38",
month = dec,
year = "2001",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Fri Feb 08 11:17:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Smith describes how to implement Kerberos on multiple
operating systems and discusses use of Kerberized
applications.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Song:2001:ANL,
author = "Zhimin Song and Sihan Qing",
title = "Applying {NCP} Logic to the Analysis of {SSL 3.0}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "155--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290155.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290155.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Song:2001:DWF,
author = "Y. J. Song and R. Z. Liu and T. N. Tan",
title = "Digital Watermarking for Forgery Detection in Printed
Materials",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "403--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950403.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950403.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Speed:2001:PIS,
author = "Timothy Speed and Juanita Ellis and Steffano Korper",
title = "The Personal {Internet} Security Guidebook: Keeping
Hackers and Crackers out of Your Home",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xxiv + 202",
year = "2001",
ISBN = "0-12-656561-9",
ISBN-13 = "978-0-12-656561-4",
LCCN = "????",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.95",
acknowledgement = ack-nhfb,
}
@Article{Steiner:2001:SPB,
author = "Michael Steiner and Peter Buhler and Thomas Eirich and
Michael Waidner",
title = "Secure Password-Based Cipher Suite for {TLS}",
journal = j-TISSEC,
volume = "4",
number = "2",
pages = "134--157",
month = may,
year = "2001",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 25 16:47:22 MST 2002",
bibsource = "http://www.acm.org/tissec/contents/v4no2.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Steinfeld:2001:ALE,
author = "Ron Steinfeld and Yuliang Zheng",
title = "An Advantage of Low-Exponent {RSA} with Modulus Primes
Sharing Least Significant Bits",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "52--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200052.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200052.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Steinwandt:2001:LTP,
author = "Rainer Steinwandt",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "Loopholes in Two Public Key Cryptosystems Using the
Modular Group",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "180--189",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (11T71)",
MRnumber = "1 898 034",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920180.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920180.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Steinwandt:2001:TDB,
author = "Rainer Steinwandt and Willi Geiselmann and Thomas
Beth",
title = "A Theoretical {DPA}-Based Cryptanalysis of the
{NESSIE} Candidates {FLASH} and {SFLASH}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "280--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000280.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000280.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "NESSIE (New European Schemes for Signature, Integrity
and Encryption)",
}
@Article{Stern:2001:ADW,
author = "Julien P. Stern and Jean-Pierre Tillich",
title = "Automatic Detection of a Watermarked Document Using a
Private Key",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "258--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370258.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370258.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Stinson:2001:C,
author = "Douglas R. Stinson",
title = "Cryptography",
publisher = pub-CRC,
address = pub-CRC:adr,
edition = "Second",
pages = "512 (est)",
year = "2001",
ISBN = "1-58488-206-9",
ISBN-13 = "978-1-58488-206-0",
LCCN = "QA268 .S75 2002",
bibdate = "Thu Jan 17 10:35:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 49.99",
acknowledgement = ack-nhfb,
}
@Article{Stojanovski:2001:CBRa,
author = "T. Stojanovski and L. Kocarev",
title = "Chaos-based random number generators-part {I}:
analysis [cryptography]",
journal = j-IEEE-TRANS-CIRCUITS-SYST-I-FUNDAM-THEORY-APPL,
volume = "48",
number = "3",
pages = "281--288",
month = mar,
year = "2001",
CODEN = "ITCAEX",
DOI = "https://doi.org/10.1109/81.915385",
ISSN = "1057-7122 (print), 1558-1268 (electronic)",
ISSN-L = "1057-7122",
bibdate = "Thu Feb 23 09:01:20 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Circuits and Systems I:
Fundamental Theory and Application",
}
@PhdThesis{Stone:2001:CI,
author = "Jonathan Richard Stone",
title = "Checksums and the {Internet}",
type = "{Ph.D.} dissertation",
school = "Department of Computer Science, Stanford University",
address = "Stanford, CA, USA",
pages = "228",
month = "",
year = "2001",
ISBN = "0-493-40464-3",
ISBN-13 = "978-0-493-40464-6",
bibdate = "Sat Oct 21 09:07:20 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://wwwlib.umi.com/dissertations/fullcit/3028177",
abstract = "This dissertation examines errors above the link layer
in data communications networks. Specifically we study
the network and transport layers of the Internet
protocol suite. The focus of our study is
error-detecting codes (EDCs), such as checksums and
cyclic redundancy checks (CRCs); how often those EDCs
are called upon to detect errors, and how well they
perform that task. As a framework for the empirical
work in the thesis, we develop a formal description of
how to compare and rank different EDCs. We show that
currently deployed EDCs (the 16-bit TCP checksum, and
the alternate Fletcher checksum) should come close to
the ideal of 1 in $ 2^{16} $ undetected errors. We
present herein a set of simulation studies for existing
EDCs which show that in practice these EDCs do not
approach the expected ideal results. Our analysis shows
that the cause is self-correlation of the input data.
In this case, relocating the checksum value to the end
of the packet gives a significant improvement. Errors
captured from live networks are also examined. We
present a new method for capturing both damaged packets
from real-life networks and subsequent retransmissions
of the damaged packets. This method meets privacy and
confidentiality constraints on interception of
real-life user data. A significant body of errors was
captured at four representative sites. This data is
described, summarized, and analyzed. Comparison of the
damaged packets and the undamaged retransmissions
yields information on the kinds and causes of errors
which occur above the link layer. Our data provides
strong evidence that errors above the link-layer are
due to a variety of causes, which include bad memory in
intermediate routers, and bugs in end-host hardware or
software which are outside the protection of link-level
error checks. For the real-life captured errors, we
find CRCs are little or no better than additive
checksums of the same size. Our data shows that the
datapath between packet buffers and on-NIC CRC hardware
is a significant source of errors. We conclude that
reliable data communication should use end-to-end error
checks. Strongly reliable communication should use an
application-level end-to-end check that also covers the
packet-buffer-to-NIC datapath.",
acknowledgement = ack-nhfb,
remark = "See also \cite{Stone:1998:PCC} and Internet RFC3309
(September 2002), ``Stream Control Transmission
Protocol (SCTP) Checksum Change'', based on this
work.",
}
@Article{Struif:2001:UBU,
author = "Bruno Struif",
title = "Use of Biometrics for User Verification in Electronic
Signature Smartcards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "220--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400220.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400220.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Strunk:2001:JQJ,
author = "Elisabeth Strunk",
title = "{Java Q\&A}: {Java} \& {NT} Authentication",
journal = j-DDJ,
volume = "26",
number = "2",
pages = "145--146, 148",
month = feb,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Feb 15 12:14:41 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2001/2001_02/jqa0201.txt",
abstract = "Elisabeth builds a JNI wrapper that lets the Java
Authentication and Authorization Service and Windows NT
authenticate specific users. Additional resources
include jqa0201.txt (listings).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Stubblebine:2001:AAF,
author = "Stuart G. Stubblebine and Paul F. Syverson",
title = "Authentic Attributes with Fine-Grained Anonymity
Protection",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "276--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620276.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620276.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sugihara:2001:PCD,
author = "Ryo Sugihara",
title = "Practical Capacity of Digital Watermarks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "316--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370316.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370316.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Sugita:2001:SRV,
author = "Makoto Sugita and Kazukuni Kobara and Hideki Imai",
title = "Security of Reduced Version of the Block Cipher
{Camellia} against Truncated and Impossible
Differential Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "193--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480193.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480193.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Swaine:2001:PPSa,
author = "Michael Swaine",
title = "Programming Paradigms: Secrets and Lies",
journal = j-DDJ,
volume = "26",
number = "4",
pages = "125--127",
month = apr,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Mar 13 15:22:36 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
abstract = "Everyone has a secret, but ``Who can you believe?''
asks our resident cynic.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Syverson:2001:LAP,
author = "Paul Syverson and Iliano Cervesato",
title = "The Logic of Authentication Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2171",
pages = "63--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2171.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2171/21710063.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2171/21710063.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tabatabaian:2001:NSP,
author = "Seyed J. Tabatabaian and Sam Ikeshiro and Murat
Gumussoy and Mungal S. Dhanda",
title = "A New Search Pattern in Multiple Residue Method
{(MRM)} and Its Importance in the Cryptanalysis of the
{RSA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "378--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600378.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600378.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tanaka:2001:QPK,
author = "Keisuke Tanaka and Tatsuaki Okamoto",
title = "Quantum public-key cryptosystems and their
improvement",
journal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
volume = "1205",
pages = "53--58",
year = "2001",
MRclass = "94A62 (81P68)",
MRnumber = "1 854 610",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "New developments of the theory of computation and
algorithms (Japanese) (Kyoto, 2001)",
fjournal = "S\=urikaisekikenky\=usho K\=oky\=uroku",
}
@MastersThesis{Tang:2001:AES,
author = "Ye Tang",
title = "The advanced encryption standard mapping into
{MorphoSys} architecture",
type = "Thesis ({M.S., Electrical and Computer Engineering})",
school = "University of California, Irvine",
address = "Irvine, CA, USA",
year = "2001",
LCCN = "LD 791.8 .E38 2001 T36 SpCol Archives",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "computer algorithms; computer architecture; computer
security; cryptography --- data processing; data
encryption (computer science); dissertations, academic
--- University of California, Irvine --- Electrical and
Computer Engineering; MorphoSys (computer
architecture); parallel processing (electronic
computers); RISC microprocessors",
}
@Article{Tirkel:2001:UWE,
author = "Andrew Z. Tirkel and Thomas E. Hall",
title = "A Unique Watermark for Every Image",
journal = j-IEEE-MULTIMEDIA,
volume = "8",
number = "4",
pages = "30--37",
month = oct,
year = "2001",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.959098",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 23 11:55:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mu/books/mu2001/pdf/u4030.pdf;
http://www.computer.org/multimedia/mu2001/u4030abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Todd:2001:LSS,
author = "Andrew W. Todd and Jonathan Erickson and Nadine
McKenzie and Chris Cleeland and Richard Huang and Ragae
Ghaly and {The Editors}",
title = "Letters: Shared Source and Shared Secrets;
{JavaScript} Fix; {CORBA} Interoperability; {EJB}
Application Servers Update; Correction [{``The Delphi
XML SAX2 Component and MSXML 3.0''}]",
journal = j-DDJ,
volume = "26",
number = "10",
pages = "10, 12",
month = oct,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:40 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Heijl:2001:DXS}.",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Toft:2001:LTT,
author = "George Toft and Hugo van der Kooij and Mick Bauer and
Chris Hendrickson and Stephanie Black and Adrian Ho and
Markus Hogger and Ian Abbott and Robin Rowes",
title = "Letters: Tech Tipsy; Awkward Solution; {Mandrake 7.2}
Review; {OpenSSH} and {DSA} Keys; Missed the Tripwire;
{FAT} Problems",
journal = j-LINUX-J,
volume = "85",
pages = "6, 126",
month = may,
year = "2001",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Wed May 23 15:20:33 MDT 2001",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue85/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://noframes.linuxjournal.com/lj-issues/issue85/4646.html",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Tokita:2001:ADC,
author = "Toshio Tokita and Tsutomu Matsumoto",
title = "On applicability of differential cryptanalysis, linear
cryptanalysis and mod {$n$} cryptanalysis to an
encryption algorithm {M8} ({ISO9979}-20)",
journal = "IPSJ J.",
volume = "42",
number = "8",
pages = "2098--2105",
year = "2001",
ISSN = "0387-5806",
MRclass = "94A60",
MRnumber = "2002k:94029",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "IPSJ Journal",
}
@Article{Torrubia:2001:CRC,
author = "Andres Torrubia and Francisco J. Mora and Luis Marti",
title = "Cryptography Regulations for E-commerce and Digital
Rights Management",
journal = j-COMPUT-SECUR,
volume = "20",
number = "8",
pages = "724--738",
day = "1",
month = dec,
year = "2001",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:46 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404801008148",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Trichina:2001:SCH,
author = "Elena Trichina and Marco Bucci and Domenico {De Seta}
and Raimondo Luzzi",
title = "Supplemental Cryptographic Hardware for Smart Cards",
journal = j-IEEE-MICRO,
volume = "21",
number = "6",
pages = "26--35",
month = nov # "\slash " # dec,
year = "2001",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/40.977755",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jan 31 18:42:02 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mi/books/mi2001/m6026abs.htm;
http://dlib.computer.org/mi/books/mi2001/pdf/m6026.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Trimberger:2001:GED,
author = "Steve Trimberger and Raymond Pang and Amit Singh",
title = "A {12 Gbps DES} Encryptor\slash Decryptor Core in an
{FPGA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1965",
pages = "156--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:57 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1965/19650156.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1965/19650156.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tsai:2001:GSI,
author = "Chwei-Shyong Tsai and Chin-Chen Chang",
title = "A Generalized Secret Image Sharing and Recovery
Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "963--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950963.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950963.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tsaur:2001:FUA,
author = "W.-J. Tsaur",
title = "A Flexible User Authentication Scheme for Multi-server
{Internet} Services",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2093",
pages = "174--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:52 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2093.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2093/20930174.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2093/20930174.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Tseng:2001:CLB,
author = "Yuh-Min Tseng and Jinn-Ke Jan",
title = "Cryptanalysis of {Liaw}'s broadcasting cryptosystem",
journal = j-COMPUT-MATH-APPL,
volume = "41",
number = "12",
pages = "1575--1578",
year = "2001",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
MRclass = "94A60",
MRnumber = "2002e:94102",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Computers \& Mathematics with Applications. An
International Journal",
}
@Article{Tseng:2001:GGO,
author = "Y.-M. Tseng and J.-K. Jan",
title = "Generalized group-oriented cryptosystem with
authenticated sender",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "16",
number = "5",
pages = "??--??",
month = sep,
year = "2001",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Sat Jan 03 19:15:31 2004",
bibsource = "http://www.crlpublishing.co.uk/cssecont00.htm;
http://www.crlpublishing.co.uk/cssecont01.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Tzeng:2001:PKT,
author = "Wen-Guey Tzeng and Zhi-Jia Tzeng",
title = "A Public-Key Traitor Tracing Scheme with Revocation
Using Dynamic Shares",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "207--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920207.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920207.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Urban:2001:MWB,
author = "Mark Urban",
title = "The Man Who Broke {Napoleon}'s Codes",
publisher = pub-FABER-FABER,
address = pub-FABER-FABER:adr,
pages = "xiv + 333",
year = "2001",
ISBN = "0-571-20513-5",
ISBN-13 = "978-0-571-20513-4",
LCCN = "DC232.U73 2001",
bibdate = "Wed Jan 16 09:02:03 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 16.99",
acknowledgement = ack-nhfb,
keywords = "cryptographers --- Great Britain --- biography; Great
Britain --- history, military, --- 1789--1820; Great
Britain. army --- officers --- biography; Napoleonic
Wars, 1800--1815 --- cryptography; Peninsular War,
1807--1814 --- campaigns --- participation, British;
Scovell, George, 19th cent",
}
@Article{Urien:2001:PIS,
author = "Pascal Urien",
title = "Programming {Internet} Smartcard with {XML} Scripts",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "228--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400228.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400228.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Urien:2001:XS,
author = "P. Urien and H. Saleh and A. Tizraoui",
title = "{XML} Smartcards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2093",
pages = "811--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:52 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2093.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2093/20930811.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2093/20930811.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Manual{USPTO:2001:CCP,
author = "{United States Patent and Trademark Office}",
title = "{Class 380 --- Cryptography, Patent Classification
Definitions, Patent and Trademark Office, U.S. Dept. of
Commerce, December 1999}",
publisher = pub-USGPO,
address = pub-USGPO:adr,
year = "2001",
LCCN = "DOC C 21.3/2:380/999 mf11 Microcopy",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Shipping List \#: 2001-0468-M. Shipping List Date:
08/31/2001",
acknowledgement = ack-nhfb,
}
@InCollection{Ustimenko:2001:CGT,
author = "Vasyl Ustimenko",
booktitle = "Applied algebra, algebraic algorithms and
error-correcting codes (Melbourne, 2001)",
title = "{CRYPTIM}: Graphs as Tools for Symmetric Encryption",
volume = "2227",
publisher = pub-SV,
address = pub-SV:adr,
pages = "278--286",
year = "2001",
MRclass = "94A60 (05C90)",
MRnumber = "1 913 474",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2227.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
series = "Lecture Notes in Comput. Sci.",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2227/22270278.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2227/22270278.pdf",
}
@Article{vanTilborg:2001:ECC,
author = "Henk van Tilborg",
title = "Elliptic curve cryptosystems; too good to be true?",
journal = "Nieuw Arch. Wiskd. (5)",
volume = "2",
number = "3",
pages = "220--225",
year = "2001",
ISSN = "0028-9825",
MRclass = "94A60 (94-01)",
MRnumber = "1 872 592",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Nieuw Archief voor Wiskunde. Vijfde Serie",
}
@Article{Vasco:2001:CPK,
author = "Mar{\'\i}a Isabel Gonz{\'a}lez Vasco and Rainer
Steinwandt",
title = "Clouds over a public key cryptosystem based on
{Lyndon} words",
journal = j-INFO-PROC-LETT,
volume = "80",
number = "5",
pages = "239--242",
day = "15",
month = dec,
year = "2001",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Feb 25 15:36:49 MST 2002",
bibsource = "http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/23/20/84/36/30/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Vaudenay:2001:DID,
author = "Serge Vaudenay",
title = "Decorrelation over Infinite Domains: The Encrypted
{CBC--MAC} Case",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "189--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:30 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120189.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120189.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Venkatesan:2001:GTA,
author = "Ramarathnam Venkatesan and Vijay Vazirani and Saurabh
Sinha",
title = "A Graph Theoretic Approach to Software Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "157--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370157.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370157.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Verheul:2001:EXM,
author = "Eric R. Verheul",
booktitle = "Advances in cryptology---EUROCRYPT 2001 (Innsbruck)",
title = "Evidence that {XTR} is more secure than supersingular
elliptic curve cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2045",
pages = "195--210",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60 (11T71 14G50 94B27)",
MRnumber = "1 895 434",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Vogt:2001:USC,
author = "Holger Vogt and Henning Pagnia and Felix C.
G{\"a}rtner",
title = "Using Smart Cards for Fair Exchange",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2232",
pages = "101--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:18 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2232.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2232/22320101.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2232/22320101.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Voloshynovskiy:2001:BDA,
author = "Sviatoslav Voloshynovskiy and Alexander Herrigel and
Thierry Pun",
title = "Blur\slash Deblur Attack against Document Protection
Systems Based on Digital Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "330--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370330.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370330.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{vonWillich:2001:TIT,
author = "Manfred von Willich",
title = "A Technique with an Information-Theoretic Basis for
Protecting Secret Data from Differential Power
Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2260",
pages = "44--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:45 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2260/22600044.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2260/22600044.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Walter:2001:PBM,
author = "Colin D. Walter",
title = "Precise Bounds for {Montgomery} Modular Multiplication
and Some Potentially Insecure {RSA} Moduli",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "30--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710030.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710030.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2001:TUR,
author = "Guilin Wang and Sihan Qing and Mingsheng Wang and
Zhanfei Zhou",
title = "Threshold Undeniable {RSA} Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "221--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290221.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290221.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Watanabe:2001:EAP,
author = "Yuji Watanabe and Goichiro Hanaoka and Hideki Imai",
title = "Efficient Asymmetric Public-Key Traitor Tracing
without Trusted Agents",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2020",
pages = "392--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2020/20200392.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2020/20200392.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wayman:2001:FBA,
author = "J. L. Wayman",
title = "Fundamentals of Biometric Authentication
Technologies",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "1",
number = "1",
pages = "93--??",
month = jan,
year = "2001",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Tue Feb 26 12:00:38 MST 2002",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Weimerskirch:2001:ECC,
author = "Andr{\'e} Weimerskirch and Christof Paar and Sheueling
Chang Shantz",
title = "Elliptic Curve Cryptography on a Palm {OS} Device",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "502--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190502.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190502.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Weis:2001:SYH,
author = "R{\"u}diger Weis and Bastiaan Bakker and Stefan
Lucks",
title = "Security on Your Hand: Secure Filesystems with a
``Non-Cryptographic'' {JAVA}-Ring",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2041",
pages = "151--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:58 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2041.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/java2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2041/20410151.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2041/20410151.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Welschenbach:2001:CCC,
author = "Michael Welschenbach and David Kramer",
title = "Cryptography in {C} and {C++}",
publisher = pub-APRESS,
address = pub-APRESS:adr,
edition = "Second",
pages = "xix + 432",
year = "2001",
ISBN = "1-893115-95-X",
ISBN-13 = "978-1-893115-95-8",
LCCN = "QA76.73.C153 W457 2001",
bibdate = "Wed Jan 16 09:12:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 35.50",
acknowledgement = ack-nhfb,
annote = "Covers Rijndael, the new American encryption standard.
CD-ROM includes all programs presented in the book, x86
assembler programs, implementations of Rijndael
algorithm in both C and C++.",
keywords = "C (computer program language); data encryption
(computer science); public key cryptography",
}
@InProceedings{Westerlund:2001:HWK,
author = "Assar Westerlund and Johan Danielsson",
title = "{Heimdal} and {Windows 2000 Kerberos} --- How to Get
Them to Play Together",
crossref = "USENIX:2001:PFT",
pages = "??--??",
year = "2001",
bibdate = "Tue Oct 15 17:19:08 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix01/freenix01/westerlund.html",
acknowledgement = ack-nhfb,
}
@Article{Westfeld:2001:FSA,
author = "Andreas Westfeld",
title = "{F5} --- {A} Steganographic Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2137",
pages = "289--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:39 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2137.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2137/21370289.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2137/21370289.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Wilcox:2001:SEH,
author = "Jennifer E. Wilcox",
title = "Solving the {Enigma}: history of the cryptanalytic
bombe",
type = "Report",
institution = "National Security Agency/Central Security Service.
Center for Cryptologic History",
address = "Fort George G. Meade, MD, USA",
pages = "52",
month = jan,
year = "2001",
bibdate = "Sun Dec 01 10:07:12 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Williams:2001:ICA,
author = "Jeannette Williams and Yolande Dickerson",
title = "The Invisible Cryptologists: {African--Americans},
{WWII} to 1956",
publisher = "Center for Cryptologic History, National Security
Agency",
address = "Fort Meade, MD, USA",
pages = "viii + 43",
year = "2001",
bibdate = "Sun Dec 31 07:02:59 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.nsa.gov/about/cryptologic-heritage/historical-figures-publications/publications/wwii/assets/files/invisible_cryptologists.pdf",
acknowledgement = ack-nhfb,
tableofcontents = "Foreword / v \\
Acknowledgments / vii \\
Introduction / 1 \\
1: Race Relations on the Home Front at the Onset of
WWII / 2 \\
2: 1939--1946: African--Americans Join the SIS / 5 \\
3: 1944--1946: The Commercial Code Unit / 10 \\
4: 1947: Changing Demographics / 15 \\
5: 1948--1951: The Dark Side of the Golden Age of
Russian Plain Text / 19 \\
6: 1948--1951: Wanted --- Key Punchers and Equipment
Operators / 24 \\
7: 1948: R\&D: A Different Kind of Place / 27 \\
8: 1951: Color Barrier Broken in Security Division / 30
\\
9: 1950--1954: Strides toward Broad Integration;
Breakup of the Plantation / 33 \\
Epilogue / 39",
}
@Article{Wilson:2001:PBA,
author = "Gregory V. Wilson",
title = "Programmer's Bookshelf: Alien Worlds",
journal = j-DDJ,
volume = "26",
number = "12",
pages = "122, 124",
month = dec,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:41 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
abstract = "Greg examines a bunch of books this month, including
Network Programming with Perl, by Lincoln Stein; Perl
Debugged, by Peter Scott and Ed Wright; Beyond Contact:
A Guide to SETI and Communicating with Alien
Civilizations, by Brian McConnell; SSH, the Secure
Shell: The Definitive Guide, by Daniel Barrett and
Richard Silverman; and Hacking Exposed: Network
Security Secrets and Solutions, Second Edition, by Joel
Scambray, Stuart McClure, and George Kurtz.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Wincelberg:2001:JQH,
author = "David Wincelberg",
title = "{Java Q\&A}: How Do You Use the {{\tt javax.crypto}}
Package?",
journal = j-DDJ,
volume = "26",
number = "4",
pages = "139--140",
month = apr,
year = "2001",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Mar 13 15:22:36 MST 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2001/2001_04/jqa0401.txt;
http://www.ddj.com/ftp/2001/2001_04/jqa0401.zip",
abstract = "How do you use the javax.crypto package? David shows
you, as he adds security to Java-based e-commerce
systems by encrypting/decrypting users' credit-card
numbers. Additional resources include jqa0401.txt
(listings) and jqa0401.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Withers:2001:IWU,
author = "Alex Withers",
title = "Integrating {Windows 2000} and {UNIX} Using
{Kerberos}",
journal = j-SYS-ADMIN,
volume = "10",
number = "12",
pages = "39, 41--42, 44",
month = dec,
year = "2001",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Fri Feb 08 11:17:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Withers explains how to configure UNIX and Linux
machines to authenticate as clients to a Windows 2000
Active Directory server.",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Wolkerstorfer:2001:AIA,
author = "Johannes Wolkerstorfer and Elisabeth Oswald and Mario
Lamberger",
title = "An {ASIC} Implementation of the {AES SBoxes}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2271",
pages = "67--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:06 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2271/22710067.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2271/22710067.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wong:2001:EMA,
author = "Duncan S. Wong and Agnes H. Chan",
title = "Efficient and Mutually Authenticated Key Exchange for
Low Power Computing Devices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2248",
pages = "272--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2248/22480272.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2248/22480272.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wong:2001:MCC,
author = "Wai-kit Wong and Lap-piu Lee and Kwok-wo Wong",
title = "A modified chaotic cryptographic method",
journal = j-COMP-PHYS-COMM,
volume = "138",
number = "3",
pages = "234--236",
day = "15",
month = aug,
year = "2001",
CODEN = "CPHCBZ",
DOI = "https://doi.org/10.1016/S0010-4655(01)00220-X",
ISSN = "0010-4655 (print), 1879-2944 (electronic)",
ISSN-L = "0010-4655",
bibdate = "Mon Feb 13 23:41:01 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See comment and reply
\cite{Alvarez:2004:KCC,Wong:2004:RCK}.",
URL = "http://www.sciencedirect.com/science/article/pii/S001046550100220X",
acknowledgement = ack-nhfb,
fjournal = "Computer Physics Communications",
journal-URL = "http://www.sciencedirect.com/science/journal/00104655",
}
@Article{Wright:2001:AES,
author = "Marie A. Wright",
title = "The {Advanced Encryption Standard}",
journal = j-NETWORK-SECURITY,
volume = "2001",
number = "10",
pages = "11--13",
day = "31",
month = oct,
year = "2001",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(01)01018-2",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:20 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485801010182",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Wu:2001:CDS,
author = "Hongjun Wu and Feng Bao and Robert H. Deng",
booktitle = "Public key cryptography (Cheju Island, 2001)",
title = "Cryptanalysis of a Digital Signature Scheme on
{ID}-Based Key-Sharing Infrastructures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "173--179",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 898 033",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920173.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920173.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2001:CFF,
author = "Lisa Wu and Chris Weaver and Todd Austin",
title = "{CryptoManiac}: a fast flexible architecture for
secure communication",
journal = j-COMP-ARCH-NEWS,
volume = "29",
number = "2",
pages = "110--119",
month = may,
year = "2001",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Wu:2001:CKA,
author = "T.-C. Wu and C.-C. Chang",
title = "Cryptographic key assignment scheme for hierarchical
access control",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "16",
number = "1",
pages = "??--??",
month = jan,
year = "2001",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Wed Feb 20 12:01:01 2002",
bibsource = "http://www.crlpublishing.co.uk/cssecont01.htm;
https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Wu:2001:DSM,
author = "T.-C. Wu",
title = "Digital signature\slash multisignature schemes giving
public key verification and message recovery
simultaneously",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "16",
number = "6",
pages = "??--??",
month = nov,
year = "2001",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Sat Jan 03 19:15:31 2004",
bibsource = "http://www.crlpublishing.co.uk/cssecont00.htm;
http://www.crlpublishing.co.uk/cssecont01.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Wu:2001:FED,
author = "Chuan-Kun Wu and Vijay Varadharajan",
title = "Fair Exchange of Digital Signatures with Offline
Trusted Third Party",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "466--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290466.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290466.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Xu:2001:CPW,
author = "Changsheng Xu and David Dagan Feng and Yongwei Zhu",
title = "Copyright Protection for {WAV}-Table Synthesis Audio
Using Digital Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2195",
pages = "772--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:38 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2195.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2195/21950772.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2195/21950772.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Xu:2001:EIE,
author = "Sheng-Bo Xu and Lejla Batina",
title = "Efficient Implementation of Elliptic Curve
Cryptosystems on an {ARM7} with Hardware Accelerator",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2200",
pages = "266--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:44 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2200.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2200/22000266.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2200/22000266.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yamamoto:2001:PKB,
author = "Hideo Yamamoto and Tetsutaro Kobayashi and Masahiro
Morita and Ryuji Yamada",
title = "Public-Key-Based High-Speed Payment (Electronic Money)
System Using Contact-Less Smart Cards",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2140",
pages = "242--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2140/21400242.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2140/21400242.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yamamura:2001:EDA,
author = "Akihiro Yamamura and Hirokazu Ishizuka",
title = "Error Detection and Authentication in Quantum Key
Distribution",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "260--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190260.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190260.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yang:2001:EEA,
author = "Jong-Phil Yang and Weon Shin and Kyung-Hyune Rhee",
title = "An End-to-End Authentication Protocol in Wireless
Application Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "247--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190247.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190247.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Ye:2001:ATD,
author = "Dingfeng Ye and Junhui Yang and Zongduo Dai and Haiwen
Ou",
title = "Attacks on Two Digital Signature Schemes Based on
Error Correcting Codes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "84--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290084.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290084.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yin:2001:RMW,
author = "Kangkang Yin and Zhigeng Pan and Jiaoying Shi and
David Zhang",
title = "Robust mesh watermarking based on multiresolution
processing",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "25",
number = "3",
pages = "409--420",
month = jun,
year = "2001",
CODEN = "COGRD2",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Tue Jul 17 08:15:19 MDT 2001",
bibsource = "http://www.elsevier.com/locate/issn/00978493;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/13/20/57/32/32/abstract.html;
http://www.elsevier.nl/gej-ng/10/13/20/57/32/32/article.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computers and Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Yoshiura:2001:AWB,
author = "Hiroshi Yoshiura and Takaaki Shigematsu and Seiichi
Susaki and Tsukasa Saitoh and Hisashi Toyoshima and
Chikako Kurita and Satoru Tezuka and Ryoichi Sasaki",
title = "Authenticating {Web}-Based Virtual Shops Using
Signature-Embedded Marks --- {A} Practical Analysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2133",
pages = "238--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:35 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2133/21330238.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2133/21330238.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{You:2001:GEC,
author = "Lin You and Yi Xian Yang and Chun Qi Zhang",
title = "Generalization of Elliptic Curve Digital Signature
Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "246--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290246.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290246.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Young:2001:BOK,
author = "A. Young and M. Yung",
title = "Bandwidth-Optimal Kleptographic Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2162",
pages = "235--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:06:06 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2162/21620235.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2162/21620235.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Young:2001:RP,
author = "John Young and Deborah Natsios",
title = "Reversing the Panopticon",
year = "2001",
bibdate = "Tue Oct 15 16:52:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, Tenth USENIX Security
Symposium, August 13--17, 2001, Washington, DC, USA.",
abstract = "Cryptome welcomes documents for publication that are
prohibited by governments worldwide--in particular,
material on cryptology; dual-use technologies; and
national security and intelligence open, secret, and
classified documents. Cartome, a newly inaugurated
companion site to Cryptome, is an archive of spatial
and geographic documents on privacy, cryptography,
dual-use technologies, and national security and
intelligence communicated by imagery systems:
cartography, photography, photogrammetry,
steganography, climatography, seismography, geography,
camouflage, maps, images, drawings, charts, diagrams,
imagery intelligence (IMINT), and their
reverse-panopticon and counter-deception potential.",
acknowledgement = ack-nhfb,
}
@Article{Youssef:2001:CAF,
author = "A. M. Youssef",
booktitle = "Selected areas in cryptography (Waterloo, ON, 2000)",
title = "Cryptanalysis of the {``Augmented Family of
Cryptographic Parity Circuits''} Proposed at {ISW'97}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2012",
pages = "29--38",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
MRclass = "94A60",
MRnumber = "1 895 580",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2012/20120029.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2012/20120029.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Youssef:2001:CIM,
author = "A. Youssef and G. Gong",
title = "Cryptanalysis of {Imai} and {Matsumoto} Scheme {B}
Asymmetric Cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2247",
pages = "214--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:31 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2247/22470214.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2247/22470214.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Youssef:2001:CPK,
author = "Amr Youssef and Guang Gong",
title = "Cryptanalysis of a Public Key Cryptosystem Proposed at
{ACISP 2000}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "15--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190015.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190015.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Youssef:2001:IAB,
author = "A. M. Youssef and G. Gong",
title = "On the Interpolation Attacks on Block Ciphers",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "109--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780109.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780109.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yu:2001:TCB,
author = "Heather Yu and Xiangyang Kong and Wayne Wolf",
title = "Techniques for Content-Based Graph Authentication",
journal = j-IEEE-MULTIMEDIA,
volume = "8",
number = "4",
pages = "38--45",
month = oct,
year = "2001",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/93.959101",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Feb 23 11:55:59 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/mu/books/mu2001/pdf/u4038.pdf;
http://www.computer.org/multimedia/mu2001/u4038abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Yue:2001:GNN,
author = "Tai-Wen Yue and Suchen Chiang",
title = "The General Neural-Network Paradigm for Visual
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2084",
pages = "196--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:04:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2084.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2084/20840196.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2084/20840196.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zane:2001:EWD,
author = "Francis Zane",
title = "Efficient Watermark Detection and Collusion Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1962",
pages = "21--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:02:55 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1962/19620021.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1962/19620021.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zeng:2001:CHR,
author = "Kencheng Zeng and Chung-Huang Yang and T. R. N. Rao",
title = "Cryptanalysis of the {Hwang-Rao} Secret
Error-Correcting Code Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "419--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290419.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290419.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zenner:2001:ICS,
author = "Erik Zenner and Matthias Krause and Stefan Lucks",
title = "Improved Cryptanalysis of the Self-Shrinking
Generator",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2119",
pages = "21--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:05:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2119.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2119/21190021.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2119/21190021.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2001:ASE,
author = "Long Jun Zhang and Jun Yi Shen and Lin Zhao",
title = "An approach to the security of elliptic curve
cryptosystems",
journal = "Xi'an Jiaotong Daxue Xuebao",
volume = "35",
number = "10",
pages = "1038--1041, 1058",
year = "2001",
CODEN = "HCTPDW",
ISSN = "0253-987X",
MRclass = "94A60 (14G50)",
MRnumber = "2002k:94030",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Xi'an Jiaotong Daxue Xuebao. Journal of Xi'an Jiaotong
University",
}
@Article{Zhang:2001:CIS,
author = "Xian-Mo Zhang and Josef Pieprzyk",
title = "Cheating Immune Secret Sharing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2229",
pages = "144--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:07:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2229.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2229/22290144.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2229/22290144.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2001:QKD,
author = "Yong-Sheng Zhang and Chuan-Feng Li and Guang-Can Guo",
title = "Quantum key distribution via quantum encryption",
journal = j-PHYS-REV-A,
volume = "64",
number = "2",
pages = "024302, 4",
year = "2001",
CODEN = "PLRAAN",
ISSN = "1050-2947 (print), 1094-1622, 1538-4446, 1538-4519",
ISSN-L = "1050-2947",
MRclass = "81P68 (94A62)",
MRnumber = "2002i:81064",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Physical Review. A. Third Series",
journal-URL = "http://pra.aps.org/browse",
}
@Article{Zhang:2001:SOS,
author = "Muxiang Zhang and Christopher Carroll and Agnes Chan",
title = "The Software-Oriented Stream Cipher {SSC2}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1978",
pages = "31--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:00 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1978/19780031.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1978/19780031.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2001:USC,
author = "Yuqing Zhang and Chunling Wang and Jianping Wu and
Xing Li",
title = "Using {SMV} for cryptographic protocol analysis: a
case study",
journal = j-OPER-SYS-REV,
volume = "35",
number = "2",
pages = "43--50",
month = apr,
year = "2001",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Zheng:2001:ISS,
author = "Yuliang Zheng",
title = "Identification, Signature and Signcryption Using High
Order Residues Modulo an {RSA} Composite",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1992",
pages = "48--??",
year = "2001",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Feb 2 13:03:11 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1992/19920048.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1992/19920048.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zolman:2001:SEM,
author = "Leor Zolman",
title = "An {STL} Error Message Decryptor for {Visual C++}",
journal = j-CCCUJ,
volume = "19",
number = "7",
pages = "24--??",
month = jul,
year = "2001",
CODEN = "CCUJEX",
ISSN = "1075-2838",
bibdate = "Tue May 14 18:09:32 MDT 2002",
bibsource = "http://www.cuj.com/articles/2001/0107/0107toc.htm?topic=articles;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Believe it or not, there's helpful information buried
in those template error messages. It just takes a
little Perl to dig it out.",
acknowledgement = ack-nhfb,
fjournal = "C/C++ Users Journal",
}
@Article{Abe:2002:KES,
author = "Masayuki Abe and Masayuki Kanda",
title = "A Key Escrow Scheme with Time-Limited Monitoring for
One-way Communication",
journal = j-COMP-J,
volume = "45",
number = "6",
pages = "661--671",
month = "????",
year = "2002",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Nov 6 11:21:54 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/450661.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/pdf/450661.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Abe:2002:SVK,
author = "Masayuki Abe and Miyako Ohkubo and Koutarou Suzuki",
title = "1-out-of-n Signatures from a Variety of Keys",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "415--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010415.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010415.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Adcock:2002:QGL,
author = "Mark Adcock and Richard Cleve",
title = "A Quantum {Goldreich--Levin} Theorem with
Cryptographic Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2285",
pages = "323--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:12 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2285.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2285/22850323.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2285/22850323.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Agrawal:2002:PP,
author = "Manindra Agrawal and Neeraj Kayal and Nitin Saxena",
title = "{PRIMES} is in {P}",
type = "Report",
institution = "Department of Computer Science and Engineering, Indian
Institute of Technology Kanpur",
address = "Kanpur-208016, India",
day = "6",
month = aug,
year = "2002",
bibdate = "Tue Sep 10 06:16:25 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cse.iitk.ac.in/news/primality.pdf",
abstract = "We present a deterministic polynomial-time algorithm
that determines whether an input number $n$ is prime or
composite.",
acknowledgement = ack-nhfb,
annote = "From the paper: ``The ultimate goal of this line of
research is, of course, to obtain an unconditional
deterministic polynomial-time algorithm for primality
testing. Despite the impressive progress made in
primality testing so far, this goal has remained
elusive. In this paper, we achieve this. We give a
deterministic, $ \tilde {O}((l o g n)^12) $ time
algorithm for testing if a number is prime.
Heuristically, our algorithm does much better: under a
widely believed conjecture on the density of Sophie
Germain primes (primes $p$ such that $ 2 p + 1 $ is
also prime), the algorithm takes only $ \tilde {O}((l o
g n)^6) $ steps.''",
}
@InProceedings{Agrawal:2002:WRD,
author = "Rakesh Agrawal and Jerry Kiernan",
title = "Watermarking Relational Databases",
crossref = "Bernstein:2002:VPT",
pages = "155--166",
year = "2002",
bibdate = "Mon Dec 22 18:34:16 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb2002.html",
URL = "http://www.vldb.org/conf/2002/S05P03.pdf",
acknowledgement = ack-nhfb,
annote = "link",
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/a/Agrawal:Rakesh.html;
http://www.vldb.org/dblp/db/indices/a-tree/k/Kiernan:Jerry.html",
}
@InProceedings{Algesheimer:2002:ECM,
author = "Joy Algesheimer and Jan Camenisch and Victor Shoup",
title = "Efficient Computation Modulo a Shared Secret with
Application to the Generation of Shared Safe-Prime
Products",
crossref = "Yung:2002:ACC",
pages = "417--432",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420417.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420417.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Amadio:2002:SRP,
author = "Roberto M. Amadio and Denis Lugiez and Vincent
Vanack{\`e}re",
title = "On the symbolic reduction of processes with
cryptographic functions",
journal = j-THEOR-COMP-SCI,
volume = "290",
number = "1",
pages = "695--740",
month = oct,
year = "2002",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 20 18:15:29 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{An:2002:SJS,
author = "Jee Hea An and Yevgeniy Dodis and Tal Rabin",
title = "On the Security of Joint Signature and Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "83--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320083.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320083.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Anonymous:2002:DEC,
author = "Anonymous",
title = "Data encryption and cryptography",
publisher = "Academia Sinica",
address = "Institute of Information Science, Taipei",
pages = "i--ii, 349--391",
year = "2002",
ISSN = "1016-2364",
MRclass = "94-06",
MRnumber = "1 917 115",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
note = "JISE J. Inf. Sci. Eng. {\bf 18} (2002), no. 3",
}
@Article{Anonymous:2002:IHB,
author = "Anonymous",
title = "The Importance of Hardware-based Cryptography for
Added Security",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "3",
pages = "5--5",
day = "31",
month = mar,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)00306-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:28 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802003069",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2002:NSD,
author = "Anonymous",
title = "{NASA} secret data hacked",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "9",
pages = "2--3",
day = "1",
month = sep,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)09002-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:36 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802090025",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2002:PFQ,
author = "Anonymous",
title = "Promise From the Future --- Quantum Cryptography",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "9",
pages = "6--6",
day = "1",
month = sep,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)09007-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:36 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802090074",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2002:PPD,
author = "Anonymous",
title = "Products: {Palm Digital Media}'s {eBook} Publishing
Tools; {Veridicom}'s Fingerprint Authentication Module;
High-Speed Debugging Tool for {Macraigor Systems};
{QNX} Launches {IDE} for Embedded Programming; {Extreme
Networks}' Network Management Tools; {Parascript}'s
Handwriting Recognition {SDK}; System Debugger Tool
from {Compuware}",
journal = j-COMPUTER,
volume = "35",
number = "8",
pages = "74--??",
month = aug,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:53:31 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2002/08/r8074.htm;
http://csdl.computer.org/dl/mags/co/2002/08/r8074.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Anonymous:2002:PSS,
author = "Anonymous",
title = "Products: {SOISIC} Ships Design Kit for {SOI}
Structures; Systems and Software Development Tools from
{Telelogic}; {RSA Security}'s {Web} Access Management
System; {Altera}'s Free Embedded Processor Portfolio;
Signal Integrity Measurement Tools from {Tektronix};
{Oracle} Upgrades {Java} Development Tool; {Xilinx}
Delivers {EDK} for {FPGA} Processor; {Westbridge}'s
Tool to Sniff Unauthorized {XML}; {SpeechStudio}'s
Telephony Development Tools",
journal = j-COMPUTER,
volume = "35",
number = "12",
pages = "118--119",
month = dec,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:53:37 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2002/12/rz118.htm;
http://csdl.computer.org/dl/mags/co/2002/12/rz118.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Anonymous:2002:QCR,
author = "Anonymous",
title = "Quantum Cryptography Revisited",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "8",
pages = "14--16",
day = "1",
month = aug,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)08012-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:34 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802080121",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2002:RUB,
author = "Anonymous",
title = "Review of {US} Bombes",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "24",
number = "3",
pages = "85--87",
month = jul # "--" # sep,
year = "2002",
CODEN = "IAHCEX",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Fri Nov 1 10:13:04 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://computer.org/annals/an2002/a3letter_web/a3lettertoeditor_web.htm;
http://dlib.computer.org/an/books/an2002/pdf/a3085.pdf;
http://www.computer.org/annals/an2002/a3085abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Araki:2002:NRS,
author = "Shunsuke Araki",
title = "A {Nyberg--Rueppel} Signature for Multiple Messages
and Its Batch Verification",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "220--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330220.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330220.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Armington:2002:BAI,
author = "John Armington and Purdy Ho and Paul Koznek and
Richard Martinez",
title = "Biometric Authentication in Infrastructure Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2437",
pages = "1--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2437.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2437/24370001.htm;
http://link.springer.de/link/service/series/0558/papers/2437/24370001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Asenjo:2002:AES,
author = "Juan C. Asenjo",
title = "The {Advanced Encryption Standard} --- Implementation
and Transition to a New Cryptographic Benchmark",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "7",
pages = "7--9",
day = "1",
month = jul,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)07008-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:33 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802070083",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Backes:2002:DCS,
author = "Michael Backes and Christian Jacobi and Birgit
Pfitzmann",
title = "Deriving Cryptographically Sound Implementations Using
Composition and Formally Verified Bisimulation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2391",
pages = "310--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:10 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2391.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2391/23910310.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2391/23910310.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bagnulo:2002:PAA,
author = "Marcelo Bagnulo and Bernardo Alarcos and Mar{\'\i}a
Calder{\'o}n and Marifeli Sedano",
title = "Providing Authentication {\&} Authorization Mechanisms
for Active Service Charging",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2511",
pages = "337--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:49 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2511.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2511/25110337.htm;
http://link.springer.de/link/service/series/0558/papers/2511/25110337.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Bamford:2002:BSA,
author = "James Bamford",
title = "Body of secrets: anatomy of the ultra-secret {National
Security Agency}",
publisher = "Anchor Books",
address = "New York, NY, USA",
pages = "763",
year = "2002",
ISBN = "0-385-49908-6",
ISBN-13 = "978-0-385-49908-8",
LCCN = "UB256.U6 B36 2002",
bibdate = "Thu Jan 19 12:30:30 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/random051/2002284054.html;
http://www.loc.gov/catdir/description/random043/2002284054.html;
http://www.loc.gov/catdir/samples/random041/2002284054.html",
acknowledgement = ack-nhfb,
subject = "Electronic intelligence; United States; History;
Cryptography",
}
@Article{Banks:2002:NSR,
author = "William D. Banks and Igor E. Shparlinski",
title = "On the number of sparse {RSA} exponents",
journal = j-J-NUMBER-THEORY,
volume = "95",
number = "2",
pages = "340--350",
month = aug,
year = "2002",
CODEN = "JNUTA9",
DOI = "https://doi.org/10.1006/jnth.2001.2775",
ISSN = "0022-314X (print), 1096-1658 (electronic)",
ISSN-L = "0022-314X",
bibdate = "Wed Jul 15 08:47:58 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnumbertheory2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022314X01927751",
acknowledgement = ack-nhfb,
ajournal = "J. Number Theory",
fjournal = "Journal of Number Theory",
journal-URL = "http://www.sciencedirect.com/science/journal/0022314X",
}
@Article{Barkan:2002:HMW,
author = "Elad Barkan and Eli Biham",
title = "In How Many Ways Can You Write Rijndael?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "160--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010160.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010160.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Barnum:2002:AQM,
author = "H. Barnum and C. Crepeau and D. Gottesman and A. Smith
and A. Tapp",
title = "Authentication of quantum messages",
crossref = "IEEE:2002:PAI",
pages = "449--458",
year = "2002",
bibdate = "Fri Jul 15 16:13:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8411/26517/01181969.pdf?isnumber=26517&prod=CNF&arnumber=1181969&arSt=+449&ared=+458&arAuthor=Barnum%2C+H.%3B+Crepeau%2C+C.%3B+Gottesman%2C+D.%3B+Smith%2C+A.%3B+Tapp%2C+A.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=26517&arnumber=1181969&count=82&index=45",
acknowledgement = ack-nhfb,
}
@Book{Barr:2002:IC,
author = "Thomas H. Barr",
title = "Invitation to Cryptology",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xii + 396",
year = "2002",
ISBN = "0-13-088976-8",
ISBN-13 = "978-0-13-088976-8",
LCCN = "Z103 .B34 2002",
bibdate = "Tue Feb 15 17:29:10 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
tableofcontents = "Origins, examples, and ideas in cryptology \\
Classical cryptographic techniques \\
Symmetric computer-based cryptology \\
Public-key cryptography \\
Case studies and issues",
}
@InProceedings{Barreto:2002:EAP,
author = "Paulo S. L. M. Barreto and Hae Y. Kim and Ben Lynn and
Michael Scott",
title = "Efficient Algorithms for Pairing-Based Cryptosystems",
crossref = "Yung:2002:ACC",
pages = "354--368",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420354.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420354.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Book{Bauer:2002:DSM,
author = "Friedrich Ludwig Bauer",
title = "Decrypted secrets: methods and maxims of cryptology",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Third",
pages = "xii + 473",
year = "2002",
ISBN = "3-540-42674-4",
ISBN-13 = "978-3-540-42674-5",
LCCN = "QA76.9.A25 B38513 2002",
bibdate = "Sat Dec 17 17:13:00 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
}
@Article{Bauer:2002:PPB,
author = "Mick Bauer",
title = "Paranoid Penguin: {BestCrypt}: Cross-Platform
Filesystem Encryption",
journal = j-LINUX-J,
volume = "98",
pages = "??--??",
month = jun,
year = "2002",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Apr 12 06:59:06 MDT 2003",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue98/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.linuxjournal.com/article.php?sid=5938",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Book{Beckman:2002:CAB,
author = "Bengt Beckman",
title = "Codebreakers: {Arne Beurling} and the {Swedish} crypto
program during {World War II}",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "xviii + 259",
year = "2002",
ISBN = "0-8218-2889-4",
ISBN-13 = "978-0-8218-2889-2",
LCCN = "D810.C88 B413 2002",
bibdate = "Tue Dec 20 12:46:33 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "World War, 1939--1945; Cryptography; World War,
1939--1945; Electronic intelligence; Sweden; Beurling,
Arne",
}
@Article{Behrmann:2002:UIS,
author = "Gerd Behrmann and Johan Bengtsson and Alexandre David
and Kim G. Larsen and Paul Pettersson and Wang Yi",
title = "{UPPAAL} Implementation Secrets",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2469",
pages = "3--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:34 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2469.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2469/24690003.htm;
http://link.springer.de/link/service/series/0558/papers/2469/24690003.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Bellare:2002:GSI,
author = "Mihir Bellare and Adriana Palacio",
title = "{GQ} and {Schnorr} Identification Schemes: Proofs of
Security against Impersonation under Active and
Concurrent Attacks",
crossref = "Yung:2002:ACC",
pages = "162--177",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Bellare:2002:PRI,
author = "Mihir Bellare and Chanathip Namprempre and David
Pointcheval and Michael Semanko",
title = "The Power of {RSA} Inversion Oracles and the Security
of Chaum's {RSA}-Based Blind Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2339",
pages = "319--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:40 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2339.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2339/23390319.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2339/23390319.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bellare:2002:TSB,
author = "Mihir Bellare and Gregory Neven",
title = "Transitive Signatures Based on Factoring and {RSA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "397--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010397.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010397.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bellavista:2002:JLD,
author = "Paolo Bellavista and Antonio Corradi and Cesare
Stefanelli",
title = "{Java} for On-line Distributed Monitoring of
Heterogeneous Systems and Services",
journal = j-COMP-J,
volume = "45",
number = "6",
pages = "595--607",
month = "????",
year = "2002",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Nov 6 11:21:54 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/450595.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/pdf/450595.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Book{Benantar:2002:IPK,
author = "Messaoud Benantar",
title = "Introduction to the {Public Key Infrastructure} for
the {Internet}",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "xii + 254",
year = "2002",
ISBN = "0-13-060927-7",
ISBN-13 = "978-0-13-060927-4",
LCCN = "QA76.9.A25 B45 2002",
bibdate = "Mon Apr 29 11:50:37 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$54.99",
URL = "http://www.phptr.com/ptrbooks/ptr_0130609277.html",
acknowledgement = ack-nhfb,
keywords = "computer security; Internet --- access control;
Internet --- security measures",
}
@Article{Benerecetti:2002:VST,
author = "Massimo Benerecetti and Maurizio Panti and Luca
Spalazzi and Simone Tacconi",
title = "Verification of the {SSL\slash TLS} Protocol Using a
Model Checkable Logic of Belief and Time",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2434",
pages = "126--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:23 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2434.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2434/24340126.htm;
http://link.springer.de/link/service/series/0558/papers/2434/24340126.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bennett:2002:ESE,
author = "Krista Bennett and Christian Grothoff and Tzvetan
Horozov and Ioana Patrascu",
title = "Efficient Sharing of Encrypted Data",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "107--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840107.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840107.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bergadano:2002:IAM,
author = "F. Bergadano and D. Cavagnino and B. Crispo",
title = "Individual Authentication in Multiparty
Communications",
journal = j-COMPUT-SECUR,
volume = "21",
number = "8",
pages = "719--735",
month = nov,
year = "2002",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802008131",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Bergadano:2002:UAT,
author = "Francesco Bergadano and Daniele Gunetti and Claudia
Picardi",
title = "User authentication through keystroke dynamics",
journal = j-TISSEC,
volume = "5",
number = "4",
pages = "367--397",
month = nov,
year = "2002",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Aug 7 09:02:36 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Biehl:2002:NDP,
author = "Ingrid Biehl and Tsuyoshi Takagi",
title = "A New Distributed Primality Test for Shared {RSA} Keys
Using Quadratic Fields",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "1--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biham:2002:DCQ,
author = "Eli Biham and Vladimir Furman and Michal Misztal and
Vincent Rijmen",
title = "Differential Cryptanalysis of {Q}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "174--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550174.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550174.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biham:2002:EDL,
author = "Eli Biham and Orr Dunkelman and Nathan Keller",
title = "Enhancing Differential-Linear Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "254--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010254.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010254.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biham:2002:HDE,
author = "Eli Biham",
title = "How to decrypt or even substitute {DES}-encrypted
messages in $ 2^{28} $ steps",
journal = j-INFO-PROC-LETT,
volume = "84",
number = "3",
pages = "117--124",
day = "15",
month = nov,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Biham:2002:LCR,
author = "Eli Biham and Orr Dunkelman and Nathan Keller",
title = "Linear Cryptanalysis of Reduced Round Serpent",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "16--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550016.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550016.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Biham:2002:SQK,
author = "Eli Biham and Michel Boyer and Gilles Brassard and
Jeroen van de Graaf and Tal Mor",
title = "Security of Quantum Key Distribution against All
Collective Attacks",
journal = j-ALGORITHMICA,
volume = "34",
number = "4",
pages = "372--388",
month = nov,
year = "2002",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-002-0973-6",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "94A60 (68Q05 81P68 94A62)",
MRnumber = "MR1943513 (2003k:94022)",
MRreviewer = "Hoi-Kwong Lo",
bibdate = "Fri Jan 6 11:38:16 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=34&issue=4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Quantum computation and quantum cryptography",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=34&issue=4&spage=372",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
remark = "Special issue on Quantum Algorithms and
Cryptography.",
}
@InProceedings{Black:2002:BBA,
author = "John Black and Phillip Rogaway and Thomas Shrimpton",
title = "Black-Box Analysis of the Block-Cipher-Based
Hash-Function Constructions from {PGV}",
crossref = "Yung:2002:ACC",
pages = "320--335",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420320.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420320.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Black:2002:BCM,
author = "John Black and Phillip Rogaway",
title = "A Block-Cipher Mode of Operation for Parallelizable
Message Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "384--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320384.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320384.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Black:2002:SCA,
author = "John Black and Hector Urtubia",
title = "Side-Channel Attacks on Symmetric Encryption Schemes:
The Case for Authenticated Encryption",
crossref = "USENIX:2002:PUS",
pages = "327--338",
year = "2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec02/black.html",
}
@Misc{Blake-Wilson:2002:RUE,
author = "S. Blake-Wilson and D. Brown and P. Lambert",
title = "{RFC 3278}: Use of {Elliptic Curve Cryptography (ECC)}
Algorithms in {Cryptographic Message Syntax (CMS)}",
month = apr,
year = "2002",
bibdate = "Wed Apr 20 12:01:15 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "ftp://ftp.internic.net/rfc/rfc3278.txt;
https://www.math.utah.edu/pub/rfc/rfc3278.txt",
acknowledgement = ack-nhfb,
}
@Article{Blanchet:2002:SAS,
author = "Bruno Blanchet",
title = "From Secrecy to Authenticity in Security Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2477",
pages = "342--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:11:24 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2477.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2477/24770342.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2477/24770342.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Blaser:2002:PCC,
author = "Markus Bl{\"a}ser and Andreas Jakoby and Maciej
Liskiewicz and Bodo Siebert",
title = "Private Computation --- $k$-Connected versus
1-Connected Networks",
crossref = "Yung:2002:ACC",
pages = "194--209",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Blaze:2002:CI,
author = "Matt Blaze",
title = "Cryptography and Insecurity",
crossref = "USENIX:2002:PBF",
year = "2002",
bibdate = "Tue Oct 15 12:37:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished invited talk, BSDCON2002: Growing the BSD
Community, February 11--14, 2002, Cathedral Hill Hotel,
San Francisco, CA",
URL = "http://www.usenix.org/publications/library/proceedings/bsdcon02/tech.html",
abstract = "Cryptography sounds just wonderful. With a few simple
algorithms, it is possible to separate the security of
messages from the security of the media over which they
are carried; public-key techniques even make it
possible to have secure communication over completely
public channels without advance arrangements. Now that
crypto export restrictions have been relaxed, vendors
are actually implementing it--the world has finally
gotten serious about security, it seems.\par
And yet Internet attacks have become a far greater
problem than they were in the bad old days before
widely deployed cryptography. This talk will try to
figure out who is to blame for this situation.",
acknowledgement = ack-nhfb,
}
@Article{Blumenthal:2002:SAD,
author = "Uri Blumenthal and Milind M. Buddhikot and Juan A.
Garay and Scott C. Miller and Sarvar Patel and Luca
Salgarelli and Dorothy Stanley",
title = "A scheme for authentication and dynamic key exchange
in wireless networks",
journal = j-BELL-LABS-TECH-J,
volume = "7",
number = "2",
pages = "37--48",
month = "Summer",
year = "2002",
CODEN = "BLTJFD",
DOI = "https://doi.org/10.1002/bltj.10004",
ISSN = "1089-7089 (print), 1538-7305 (electronic)",
ISSN-L = "1089-7089",
bibdate = "Fri Nov 26 17:31:31 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
onlinedate = "2 Dec 2002",
}
@Article{Bodei:2002:FLD,
author = "C. Bodei and P. Degano and F. Nielson and H. Riis
Nielson",
title = "Flow logic for {Dolev--Yao} secrecy in cryptographic
processes",
journal = j-FUT-GEN-COMP-SYS,
volume = "18",
number = "6",
pages = "747--756",
month = may,
year = "2002",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Jan 10 10:03:27 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Bodei:2002:PAP,
author = "Chiara Bodei and Pierpaolo Degano and Riccardo Focardi
and Corrado Priami",
title = "Primitives for authentication in process algebras",
journal = j-THEOR-COMP-SCI,
volume = "283",
number = "2",
pages = "271--304",
month = jun,
year = "2002",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 20 18:08:57 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@TechReport{Bollinger:2002:UFO,
author = "Terry Bollinger",
title = "Use of {Free and Open-Source Software} ({FOSS}) in the
{U.S. Department of Defense}: Version: 1.2",
type = "Mitre report",
number = "MP 02 W0000101",
institution = "MITRE Corporation",
pages = "160",
day = "28",
month = oct,
year = "2002",
bibdate = "Wed Oct 30 08:48:57 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.egovos.org/pdf/dodfoss.pdf",
acknowledgement = ack-nhfb,
annote = "About 100 pages of this report are devoted to exhibits
of the licenses of the various open source packages
discussed in the report.",
keywords = "ACE; ACE ORB (TAO); ACID; AMANDA; Apache; Autoconf;
Automake; bash; Bastille; BIND; C++ Boost; CIS
Benchmarks; Colt; Condor; COPS; Crack; CVS; CVW;
Cygwin; DDD; DjVuLibre; EADSIM; Emacs; eTrust; Expect;
FreeBSD; GateD; gawk (awk); GCC; GDB; Ghostscript;
GNAT; GnuPG; gnuplot; grep; h2n; HOSTS; ImageMagick;
JADE; Jakarta; Jaxen; JBoss; JDOM; Jikes; jSIP; Kaffe;
LaTeX; Linux; Linux (Red Hat); Linux firewalls; Lsof;
m4; Majordomo; make; Maxima; MIMEsweeper; MRTG; MTR;
MySQL; Nessus; NetBSD; NetSaint; nload; Nmap; ntop;
NTP; Octave; OpenBSD; OpenMap; OpenOffice; OpenSSH;
OpenSSL; Perl; Perl CGI scripts; PerLDAP; PHP;
PingScan; Procmail; Qmail; R; RealSecure; RRDtool;
RTLinux; RWhois; RXVT; Samba; SARA; SATAN; Saxon; SCA;
sed; SELinux; Sendmail; SNARE; Snort; Squid; Tcl/Tk;
TCP Wrappers; Tomcat; Top; Tripwire; VisAD; VOCAL; VTK;
Webmin; WebTAS; Weka; WU-FTPD; Xalan; Xerces; XFree86;
XGobi; Xpatch; zlib; Zope",
}
@Article{Boreale:2002:PTC,
author = "Michele Boreale and Rocco {De Nicola} and Rosario
Pugliese",
title = "Proof Techniques for Cryptographic Processes",
journal = j-SIAM-J-COMPUT,
volume = "31",
number = "3",
pages = "947--986",
month = jun,
year = "2002",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539700377864",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Sat Feb 23 11:36:25 MST 2002",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/31/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/37786",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Borselius:2002:PAU,
author = "Niklas Borselius and Chris J. Mitchell and Aaron
Wilson",
title = "A pragmatic alternative to undetachable signatures",
journal = j-OPER-SYS-REV,
volume = "36",
number = "2",
pages = "6--11",
month = apr,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Borselius:2002:VTS,
author = "Niklas Borselius and Chris J. Mitchell and Aaron
Wilson",
title = "On the value of threshold signatures",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "30--35",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Bounkong:2002:ICA,
author = "St{\'e}phane Bounkong and David Saad and David Lowe",
title = "Independent Component Analysis for Domain Independent
Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2415",
pages = "510--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:20 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2415.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2415/24150510.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2415/24150510.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Boyce:2002:IAM,
author = "Joseph G. Boyce and Dan W. Jennings",
title = "Information assurance: managing organizational {IT}
security risks",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xxi + 261",
year = "2002",
ISBN = "0-7506-7327-3",
ISBN-13 = "978-0-7506-7327-3",
LCCN = "QA76.9.A25 B69 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.95",
acknowledgement = ack-nhfb,
}
@Article{Boyer:2002:LDS,
author = "John Boyer and Andrew D. Todd and Jason Trenough and
Doug Farrell",
title = "Letters: Defective Sign-and-Encrypt and Healthcare
Woes and {J2EE} Cache and Pool and {Regex++}",
journal = j-DDJ,
volume = "27",
number = "2",
pages = "10--10",
month = feb,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:41 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Bresson:2002:DGD,
author = "Emmanuel Bresson and Olivier Chevassut and David
Pointcheval",
title = "Dynamic Group {Diffie--Hellman} Key Exchange under
Standard Assumptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "321--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320321.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320321.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Bresson:2002:GDH,
author = "Emmanuel Bresson and Olivier Chevassut and David
Pointcheval",
title = "Group {Diffie--Hellman} Key Exchange Secure against
Dictionary Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "497--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010497.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010497.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Bresson:2002:TRS,
author = "Emmanuel Bresson and Jacques Stern and Michael
Szydlo",
title = "Threshold Ring Signatures and Applications to Ad-hoc
Groups",
crossref = "Yung:2002:ACC",
pages = "465--480",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420465.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420465.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Breunesse:2002:SVD,
author = "Cees-Bart Breunesse and Bart Jacobs and Joachim van
den Berg",
title = "Specifying and Verifying a Decimal Representation in
{Java} for {Smart Cards}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2422",
pages = "304--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:23 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2422.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2422/24220304.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2422/24220304.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Broadfoot:2002:ASA,
author = "Philippa Broadfoot and Gavin Lowe",
title = "Analysing a Stream Authentication Protocol Using Model
Checking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2502",
pages = "146--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:43 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2502.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2502/25020146.htm;
http://link.springer.de/link/service/series/0558/papers/2502/25020146.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Buchmann:2002:ICP,
author = "Johannes Buchmann and Kouichi Sakurai and Tsuyoshi
Takagi",
title = "An {IND-CCA2} Public-Key Cryptosystem with Fast
Decryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "51--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880051.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880051.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Budiansky:2002:BWC,
author = "Stephen Budiansky",
title = "Battle of wits: the complete story of codebreaking in
{World War II}",
publisher = pub-SIMON-SCHUSTER,
address = pub-SIMON-SCHUSTER:adr,
pages = "436 + 16",
year = "2002",
ISBN = "0-7432-1734-9 (paperback)",
ISBN-13 = "978-0-7432-1734-7 (paperback)",
LCCN = "????",
bibdate = "Tue Jan 17 21:40:22 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
sirsi.library.utoronto.ca:2200/UNICORN",
price = "US\$16.00",
acknowledgement = ack-nhfb,
subject = "World War, 1939-1945; Cryptography; Military
intelligence",
}
@Article{Buonanno:2002:IUE,
author = "Enrico Buonanno and Jonathan Katz and Moti Yung",
title = "Incremental Unforgeable Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "109--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550109.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550109.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Burke:2002:IWA,
author = "Colin B. Burke",
title = "It wasn't all magic: the early struggle to automate
cryptanalysis, 1930s--1960s",
volume = "6",
publisher = "Center for Cryptologic History, National Security
Agency",
address = "Fort George G. Meade, MD, USA",
pages = "344",
year = "2002",
LCCN = "Z103.4. U6",
bibdate = "Wed Dec 21 12:27:13 MST 2016",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "United States cryptologic history special series",
URL = "http://archive.org/details/NSA-WasntAllMagic_2002;
http://purl.fdlp.gov/GPO/gpo40404;
http://purl.stanford.edu/jj264fh4943;
http://www.nsa.gov/public_info/_files/cryptologic_histories/magic.pdf",
acknowledgement = ack-nhfb,
author-dates = "1936--",
subject = "Cryptography; United States; Automation; History",
}
@InProceedings{Camenisch:2002:DAA,
author = "Jan Camenisch and Anna Lysyanskaya",
title = "Dynamic Accumulators and Application to Efficient
Revocation of Anonymous Credentials",
crossref = "Yung:2002:ACC",
pages = "61--76",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Canetti:2002:SAI,
author = "Ran Canetti and Hugo Krawczyk",
title = "Security Analysis of {IKE}'s Signature-Based
Key-Exchange Protocol",
crossref = "Yung:2002:ACC",
pages = "143--161",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420143.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420143.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Canetti:2002:UCN,
author = "Ran Canetti and Hugo Krawczyk",
title = "Universally Composable Notions of Key Exchange and
Secure Channels",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "337--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320337.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320337.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Canetti:2002:UCT,
author = "Ran Canetti and Yehuda Lindell and Rafail Ostrovsky
and Amit Sahai",
title = "Universally composable two-party and multi-party
secure computation",
crossref = "ACM:2002:PTF",
pages = "494--503",
year = "2002",
bibdate = "Tue Jan 13 06:21:05 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Canovas:2002:DSB,
author = "{\'O}scar C{\'a}novas and Antonio F. G{\'o}mez and
Humberto Mart{\'\i}nez and Gregorio Mart{\'\i}nez",
title = "Different {Smartcard}-Based Approaches to Physical
Access Control",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2437",
pages = "214--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2437.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2437/24370214.htm;
http://link.springer.de/link/service/series/0558/papers/2437/24370214.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Canteaut:2002:DCH,
author = "Anne Canteaut and Marion Videau",
title = "Degree of Composition of Highly Nonlinear Functions
and Applications to Higher Order Differential
Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "518--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320518.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320518.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cao:2002:TKE,
author = "Zhen Fu Cao and Ji Guo Li",
title = "A threshold key escrow scheme based on {ElGamal}
public key cryptosystem",
journal = j-CHIN-J-COMPUTERS,
volume = "25",
number = "4",
pages = "346--350",
year = "2002",
CODEN = "JIXUDT",
ISSN = "0254-4164",
MRclass = "94A60",
MRnumber = "1 919 051",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Chinese Journal of Computers. Jisuanji Xuebao",
}
@InProceedings{Carlet:2002:LCC,
author = "Claude Carlet",
title = "A Larger Class of Cryptographic {Boolean} Functions
via a Study of the {Maiorana--McFarland} Construction",
crossref = "Yung:2002:ACC",
pages = "549--564",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420549.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420549.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Carline:2002:NWT,
author = "Dylan Carline and Paul Coulton",
title = "A Novel Watermarking Technique for {LUT} Based {FPGA}
Designs",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "1152--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24381152.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24381152.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Carrington:2002:EDS,
editor = "Charles Carrington and others",
title = "Enterprise directory and security implementation
guide: designing and implementing directories in your
organization",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xxvi + 238",
year = "2002",
ISBN = "0-12-160452-7",
ISBN-13 = "978-0-12-160452-3",
LCCN = "HD9696.25.A2 E58 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
}
@Book{Casey:2002:HCC,
editor = "Eoghan Casey",
title = "Handbook of computer crime investigation: forensic
tools and technology",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xiv + 448",
year = "2002",
ISBN = "0-12-163103-6",
ISBN-13 = "978-0-12-163103-1",
LCCN = "HV8079.C65 H36 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
acknowledgement = ack-nhfb,
}
@Article{Catalano:2002:HHL,
author = "Dario Catalano and Phong Q. Nguyen and Jacques Stern",
title = "The Hardness of {Hensel} Lifting: The Case of {RSA}
and Discrete Logarithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "299--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010299.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010299.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chan:2002:SLI,
author = "Chi-Kwong Chan and L. M. Cheng",
title = "Security of {Lin}'s image watermarking system",
journal = j-J-SYST-SOFTW,
volume = "62",
number = "3",
pages = "211--215",
day = "15",
month = jun,
year = "2002",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:08 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chang:2002:ATI,
author = "Fu-Chi Chang and Chia-Jiu Wang",
title = "Architectural tradeoff in implementing {RSA}
processors",
journal = j-COMP-ARCH-NEWS,
volume = "30",
number = "1",
pages = "5--11",
month = mar,
year = "2002",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Chang:2002:IBO,
author = "Yan-Cheng Chang and Chun-Yun Hsiao and Chi-Jen Lu",
title = "On the Impossibilities of Basing One-Way Permutations
on Central Cryptographic Primitives",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "110--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010110.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010110.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2002:AMT,
author = "L. Chen and K. Harrison and D. Soldera and N. P.
Smart",
title = "Applications of Multiple Trust Authorities in Pairing
Based Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2437",
pages = "260--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2437.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2437/24370260.htm;
http://link.springer.de/link/service/series/0558/papers/2437/24370260.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2002:CPK,
author = "L. Chen and K. Harrison and A. Moss and D. Soldera and
N. P. Smart",
title = "Certification of Public Keys within an Identity Based
System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "322--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330322.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330322.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chen:2002:SFS,
author = "Yangjun Chen",
title = "Signature files and signature trees",
journal = j-INFO-PROC-LETT,
volume = "82",
number = "4",
pages = "213--221",
day = "31",
month = may,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:28 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Cheon:2002:IID,
author = "Jung Hee Cheon and MunJu Kim and Kwangjo Kim and
Jung-Yeun Lee and SungWoo Kang",
title = "Improved Impossible Differential Cryptanalysis of
{Rijndael} and {Crypton}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "39--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880039.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880039.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Chien:2002:EPS,
author = "Hung-Yu Chien and Jinn-Ke Jan and Yuh-Min Tseng",
title = "An Efficient and Practical Solution to Remote
Authentication: Smart Card",
journal = j-COMPUT-SECUR,
volume = "21",
number = "4",
pages = "372--375",
day = "1",
month = aug,
year = "2002",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:48 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802004157",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Choi:2002:IPP,
author = "Dug-Hwan Choi and Seungbok Choi and Dongho Won",
title = "Improvement of Probabilistic Public Key Cryptosystems
Using Discrete Logarithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "72--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880072.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880072.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Choie:2002:ICH,
author = "Y. Choie and D. Yun",
title = "Isomorphism Classes of Hyperelliptic Curves of Genus
$2$ over $ \mathbb {F}_q $",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "190--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840190.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840190.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Churchhouse:2002:CCJ,
author = "Robert F. Churchhouse",
title = "Codes and Ciphers: {Julius Caesar}, the {Enigma}, and
the {Internet}",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "x + 240",
year = "2002",
ISBN = "0-521-81054-X (hardcover), 0-521-00890-5 (paperback)",
ISBN-13 = "978-0-521-81054-8 (hardcover), 978-0-521-00890-7
(paperback)",
LCCN = "Z103 .C48 2002",
bibdate = "Mon Apr 29 11:50:37 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$55.00 (hardcover), US\$20.00 (paperback)",
acknowledgement = ack-nhfb,
keywords = "ciphers; cryptography",
subject = "Cryptography; Ciphers",
tableofcontents = "Chapter 1. Introduction 1 \\
Some aspects of secure communication I \\
Julius Caesar's cipher 2 \\
Some basic definitions 3 \\
Three stages to decryption identification, breaking and
setting 4 \\
Codes and ciphers 5 \\
Assessing the strength of a cipher system 7 \\
Error detecting and correcting codes 8 \\
Other methods of concealing messages 9 \\
Modular arithmetic 10 \\
Modular addition and subtraction of letters 11 \\
Gender 11 \\
End matter 12 \\
Chapter 2. From Julius Caesar to simple substitution 13
\\
Julius Caesar ciphers and their solution 13 \\
Simple substitution ciphers 15 \\
How to solve a simple substitution cipher 17 \\
Letter frequencies in languages other than English 24
\\
How many letters are needed to solve a simple
substitution cipher? 26 \\
Chapter 3. Polyalphabetic systems 28 \\
Strengthening Julius Caesar Vigen{\'e}re ciphers 28 \\
How to solve a Vigen{\'e}re cipher 30 \\
Indicators 33 \\
Depths 34 \\
Recognising `depths' 34 \\
How much text do we need to solve a Vigen{\'e}re
cipher? 37 \\
Jefferson's cylinder 37 \\
Chapter 4. Jigsaw ciphers 40 \\
Transpositions 40 \\
Simple transposition 40 \\
Double transposition 44 \\
Other forms of transposition 48 \\
Assessment of the security of transposition ciphers 51
\\
Double encipherment in general 52 \\
Chapter 5. Two-letter ciphers 54 \\
Monograph to digraph 54 \\
MDTM ciphers 56 \\
Digraph to digraph 58 \\
Playfair encipherment 59 \\
Playfair decipherment 60 \\
Cryptanalytic aspects of Playfair 61 \\
Double Playfair 61 \\
Chapter 6. Codes 64 \\
Characteristics of codes 64 \\
One part and two-part codes 65 \\
Code plus additive 67 \\
Chapter 7. Ciphers for spies 72 \\
Stencil ciphers 73 \\
Book ciphers 75 \\
Letter frequencies in book ciphers 79 \\
Solving a book cipher 79 \\
Indicators 86 \\
Disastrous errors in using a book cipher 86 \\
???? ciphers 88 \\
One-time pad 92 \\
Chapter 8. Producing random numbers and letters 94 \\
Random sequences 94 \\
Producing random sequences 95 \\
Coin spinning 95 \\
Throwing dice 96 \\
Lottery type draws 97 \\
Cosmic rays 97 \\
Amplifier noise 97 \\
Pseudo-random sequences 98 \\
Linear recurrences 99 \\
Using a binary stream of key for encipherment 100 \\
Binary linear sequences as key generators 101 \\
Cryptanalysis of a linear recurrence 104 \\
Improving the security of binary keys 104 \\
Pseudo-random number generators 106 \\
The mid-square method 106 \\
Linear congruential generators 107 \\
Chapter 9. The Enigma cipher machine 110 \\
Historical background 110 \\
The original Enigma 112 \\
Encipherment using wired wheels 116 \\
Encipherment by the Enigma 118 \\
The Enigma plugboard 121 \\
The Achilles heel of the Enigma 121 \\
The indicator `chains' in the Enigma 125 \\
Aligning the chains 128 \\
Identifying RI and its setting 128 \\
Doubly-enciphered Enigma messages 132 \\
The Abwehr Enigma 132 \\
Chapter 10. The Hagelin cipher machine 133 \\
Historical background 133 \\
Structure of the Hagelin machine 134 \\
Encipherment on the Hagelin 135 \\
Choosing the cage for the Hagelin 138 \\
The theoretical `work factor' for the Hagelin 142 \\
Solving the Hagelin from a stretch of keys 143 \\
Additional features of the Hagelin machine 147 \\
The slide 147 \\
Identifying the slide in a cipher message 148 \\
Overlapping 148 \\
Solving the Hagelin from cipher texts only 150 \\
Chapter 11. Beyond the Enigma 153 \\
The SZ42: a pre-electronic machine 153 \\
Description of the 742 machine 155 \\
Encipherment on the SZ42 155 \\
Breaking and setting the 5Z42 158 \\
Modifications to the SZ42 159 \\
Chapter 12. Public key cryptography 161 \\
Historical background 161 \\
Security issues 163 \\
Protection of programs and data 163 \\
Encipherment of programs, data and messages 164 \\
The key distribution problem 166 \\
The Difie-Hellman key exchange system 166 \\
Strength of the Diffie--Hellman system 168 \\
Chapter 13. Encipherment and the Internet 170 \\
Generalisation of simple substitution 170 \\
Factorisation of large integers 171 \\
The standard method of factorisation 172 \\
Fermat's ``Little (????) Theorem'' 174 \\
The Fermat-Euler Theorem (as needed in the RSA system)
175 \\
Encipherment and decipherment keys in the RSA system
175 \\
The encipherment and decipherment processes in the RSA
system 178 \\
How does the key-owner reply to correspondents? 182 \\
The Data Encryption Standard (DES) 183 \\
Security of the DES 184 \\
Chaining 186 \\
Implementation of the DES 186 \\
Using both RSA and DES 186 \\
A salutary note 187 \\
Beyond the DES 187 \\
Authentication and signature verification 188 \\
Elliptic curve cryptography 189 \\
Appendix 190 \\
Solutions to problems 218 \\
References 230 \\
Name index 235 \\
Subject index 237.",
}
@Article{Cimato:2002:DAP,
author = "Stelvio Cimato",
title = "Design of an Authentication Protocol for {Gsm
Javacards}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "355--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880355.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880355.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Clarke:2002:ASA,
author = "N. L. Clarke and S. M. Furnell and P. M. Rodwell and
P. L. Reynolds",
title = "Acceptance of Subscriber Authentication Methods For
Mobile Telephony Devices",
journal = j-COMPUT-SECUR,
volume = "21",
number = "3",
pages = "220--228",
day = "1",
month = jun,
year = "2002",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:47 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802003048",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Clarke:2002:UCP,
author = "Dwaine Clarke and Blaise Gassend and Thomas Kotwal and
Matt Burnside and Marten van Dijk and Srinivas Devadas
and Ronald Rivest",
title = "The Untrusted Computer Problem and Camera-Based
Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2414",
pages = "114--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:20 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2414.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2414/24140114.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2414/24140114.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cochran:2002:NVSb,
author = "Shannon Cochran",
title = "News and Views: {School of Adaptive Computer
Training}; It Seems Like Yesterday\ldots{} [10th
anniversary of the first {Web} site]; Double-Gate
Transistor Breakthrough; {802.11g Standard} Proposed;
30th Anniversary of the [{Intel}] 4004; {DeCSS} Legal
Decisions",
journal = j-DDJ,
volume = "27",
number = "2",
pages = "18--18",
month = feb,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:41 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Cochran:2002:NVW,
author = "Shannon Cochran",
title = "News and Views: {WaSP} [{Web Standards Project}]
Buzzes Off; {Eclipse Project} on the Horizon;
Semiconductor Roadmap: Ramping Up, Scaling Down; {AES}
[{Advanced Encryption Standard}]: Its Finally Official;
{SMS} [{Short Message Service}] Shines On;
{Berners-Lee} Awarded {Japan Prize}",
journal = j-DDJ,
volume = "27",
number = "3",
pages = "14--14",
month = mar,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:42 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Collberg:2002:WTP,
author = "C. S. Collberg and C. Thomborson",
title = "Watermarking, tamper-proofing, and obfuscation ---
tools for software protection",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "28",
number = "8",
pages = "735--746",
month = aug,
year = "2002",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/TSE.2002.1027797",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 11:00:42 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1027797",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Article{Cook:2002:REJ,
author = "Jonathan J. Cook",
title = "Reverse Execution of {Java} Bytecode",
journal = j-COMP-J,
volume = "45",
number = "6",
pages = "608--619",
month = "????",
year = "2002",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Nov 6 11:21:54 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/450608.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/pdf/450608.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Coppersmith:2002:CSC,
author = "Don Coppersmith and Shai Halevi and Charanjit Jutla",
title = "Cryptanalysis of Stream Ciphers with Linear Masking",
crossref = "Yung:2002:ACC",
pages = "515--532",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420515.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420515.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Book{Cornea:2002:SCI,
author = "Marius Cornea and John Harrison and Ping Tak Peter
Tang",
title = "Scientific computing on {Itanium}-based systems",
publisher = pub-INTEL,
address = pub-INTEL:adr,
pages = "xvii + 406",
year = "2002",
ISBN = "0-9712887-7-1",
ISBN-13 = "978-0-9712887-7-5",
LCCN = "QA76.8.I83 C67 2002",
bibdate = "Sat Dec 06 15:02:26 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$69.95",
URL = "http://www.intel.com/intelpress/sum_scientific.htm",
abstract = "Written for professionals who need to write, port, or
maintain reliable, accurate, and efficient numerical
software for the Itanium architecture, Scientific
Computing on Itanium-based Systems shows you how to
construct key numerical infrastructure and application
programs.\par
This book describes the crucial techniques required for
stability and reliability in developing numerical
kernels and applications. Through numerous tested
examples, the authors explain how you can get the most
from the 64-bit architecture. This combination of
explanation with example helps you to make difficult
computations more easily and to increase the
performance of your numerical software.\par
This book provides examples to solve problems
encountered in scientific and engineering computations,
such as:\par
* Polynomial evaluation\\
* Complex arithmetic\\
* Quad-precision arithmetic\\
* Software pipelining, to include register rotation and
modulo-scheduled loop support\\
* SIMD instructions\\
* Interval arithmetic\\
* Fast-Fourier Transformation (FFT) algorithms\\
* Numerical linear algebra and basic linear algebra
subprograms(BLAS)\\
* Vector Math Library (VML)\\
* Cryptography",
acknowledgement = ack-nhfb,
}
@InProceedings{Coron:2002:SPP,
author = "Jean-S{\'e}bastien Coron",
title = "Security Proof for Partial-Domain Hash Signature
Schemes",
crossref = "Yung:2002:ACC",
pages = "613--626",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420613.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420613.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Coron:2002:UPS,
author = "Jean-S{\'e}bastien Coron and Marc Joye and David
Naccache and Pascal Paillier",
title = "Universal Padding Schemes for {RSA}",
crossref = "Yung:2002:ACC",
pages = "226--241",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420226.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420226.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Courtois:2002:CBC,
author = "Nicolas T. Courtois and Josef Pieprzyk",
title = "Cryptanalysis of Block Ciphers with Overdefined
Systems of Equations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "267--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eprint.iacr.org/2002/044/;
http://link.springer.de/link/service/series/0558/bibs/2501/25010267.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010267.pdf",
abstract = "Several recently proposed ciphers are built with
layers of small S-boxes, interconnected by linear
key-dependent layers. Their security relies on the
fact, that the classical methods of cryptanalysis (e.g.
linear or differential attacks) are based on
probabilistic characteristics, which makes their
security grow exponentially with the number of rounds
Nr.\par
In this paper we study the security of such ciphers
under an additional hypothesis: the S-box can be
described by an overdefined system of algebraic
equations (true with probability 1). We show that this
hypothesis is true for both Serpent (due to a small
size of S-boxes) and Rijndael (due to unexpected
algebraic properties).\par
We study general methods known for solving overdefined
systems of equations, such as XL from Eurocrypt'00, and
show their inefficiency. Then we introduce a new method
called XSL that uses the sparsity of the equations and
their specific structure.\par
The XSL attack is very powerful, but heuristic and it
is very difficult to evaluate its complexity. The XSL
attack has a parameter P, and in theory we show that P
should be a constant. The XSL attack would then be
polynomial in Nr, with a huge constant that is
double-exponential in the size of the S-box.\par
We demonstrated by computer simulations that the XSL
attack works well enough on a toy cipher. It seems
however that P will rather increase very slowly with
Nr. More simulations are needed for bigger
ciphers.\par
Our optimistic evaluation shows that the XSL attack
might be able to break Rijndael 256 bits and Serpent
for key lengths 192 and 256 bits. However if only $P$
is increased by 2 (respectively 4) the XSL attack on
Rijndael (respectively Serpent) would become slower
than the exhaustive search. At any rate, it seems that
the security of these ciphers does NOT grow
exponentially with the number of rounds.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "secret-key cryptography / block ciphers; AES;
Rijndael; Square; Serpent; Camellia; multivariate
quadratic equations; MQ problem; overdefined systems of
multivariate equations; XL algorithm; Gr{\"o}bner
bases; sparse multivariate polynomials.",
}
@Book{Cox:2002:DW,
author = "Ingemar J. Cox and Matthew L. Miller and Jeffrey A.
Bloom",
title = "Digital watermarking",
publisher = pub-MORGAN-KAUFMANN-SF,
address = pub-MORGAN-KAUFMANN-SF:adr,
pages = "xxv + 542",
year = "2002",
ISBN = "1-55860-714-5",
ISBN-13 = "978-1-55860-714-9",
LCCN = "QA76.9.A25 C69 2002",
bibdate = "Thu Jan 31 05:30:58 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Morgan Kaufmann series in multimedia information and
systems",
acknowledgement = ack-nhfb,
}
@Article{Cox:2002:FYE,
author = "Ingemar J. Cox and Matt L. Miller",
title = "The First 50 Years of Electronic Watermarking",
journal = j-EURASIP-J-APPL-SIG-PROC,
volume = "2",
number = "1",
pages = "126--132",
month = jan,
year = "2002",
ISSN = "1110-8657",
bibdate = "Mon Jun 22 15:11:54 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://delivery.acm.org/10.1145/1290000/1283114/p126-cox.pdf",
abstract = "Electronic watermarking can be traced back as far as
1954. The last 10 years has seen considerable interest
in digital watermarking, due, in large part, to
concerns about illegal piracy of copyrighted content.
In this paper, we consider the following questions: is
the interest warranted? What are the commercial
applications of the technology? What scientific
progress has been made in the last 10 years? What are
the most exciting areas for research? And where might
the next 10 years take us? In our opinion, the interest
in watermarking is appropriate. However, we expect that
copyright applications will be overshadowed by
applications such as broadcast monitoring,
authentication, and tracking content distributed within
corporations. We further see a variety of applications
emerging that add value to media, such as annotation
and linking content to the Web. These latter
applications may turn out to be the most compelling.
Considerable progress has been made toward enabling
these applications-perceptual modelling, security
threats and countermeasures, and the development of a
bag of tricks for efficient implementations. Further
progress is needed in methods for handling geometric
and temporal distortions. We expect other exciting
developments to arise from research in informed
watermarking.",
acknowledgement = ack-nhfb,
}
@InProceedings{Cox:2002:SP9,
author = "Russ Cox and Eric Grosse and Rob Pike and Dave
Presotto and Sean Quinlan",
title = "Security in {Plan 9}",
crossref = "USENIX:2002:PUS",
pages = "3--16",
year = "2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/plan9.bib",
URL = "http://plan9.bell-labs.com/sys/doc/auth.pdf;
http://www.usenix.org/publications/library/proceedings/sec02/cox.html",
abstract = "The security architecture of the Plan 9 operating
system has recently been redesigned to address some
technical shortcomings. This redesign provided an
opportunity also to make the system more convenient to
use securely. Plan 9 has thus improved in two ways not
usually seen together: it has become more secure {\em
and\/} easier to use.\par
The central component of the new architecture is a
per-user self-contained agent called {\tt factotum}.
{\tt Factotum} securely holds a copy of the user's keys
and negotiates authentication protocols, on behalf of
the user, with secure services around the network.
Concentrating security code in a single program offers
several advantages including: ease of update or repair
to broken security software and protocols; the ability
to run secure services at a lower privilege level;
uniform management of keys for all services; and an
opportunity to provide single sign on, even to
unchanged legacy applications. {\tt Factotum} has an
unusual architecture: it is implemented as a Plan 9
file server.",
annote = "Best conference paper award.",
}
@InProceedings{Cramer:2002:OBB,
author = "Ronald Cramer and Serge Fehr",
title = "Optimal Black-Box Secret Sharing over Arbitrary
{Abelian} Groups",
crossref = "Yung:2002:ACC",
pages = "272--287",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420272.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420272.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Cramer:2002:UHP,
author = "Ronald Cramer and Victor Shoup",
title = "Universal Hash Proofs and a Paradigm for Adaptive
Chosen Ciphertext Secure Public-Key Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "45--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320045.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320045.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Crawford:2002:FEE,
author = "Diane Crawford and Srinivas Nedunuri and Adrian Bowyer
and Arnd Weber and Greg A. Woods and Mark Adler",
title = "Forum: Embrace the Engineering Metaphor; Credit for
Crypto's Parallel Development; Enough {PDF}: Give me
{HTML}",
journal = j-CACM,
volume = "45",
number = "8",
pages = "11--14",
month = aug,
year = "2002",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Aug 1 07:05:19 MDT 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Crosby:2002:CHB,
author = "Scott Crosby and Ian Goldberg and Robert Johnson and
Dawn Song and David Wagner",
title = "A Cryptanalysis of the High-Bandwidth Digital Content
Protection System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2320",
pages = "192--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:30 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2320.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2320/23200192.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2320/23200192.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Crowley:2002:BLS,
author = "Paul Crowley and Stefan Lucks",
title = "Bias in the {LEVIATHAN} Stream Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "211--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550211.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550211.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Czumaj:2002:PTA,
author = "Artur Czumaj and Andrzej Lingas and Hairong Zhao",
title = "Polynomial-Time Approximation Schemes for the
{Euclidean} Survivable Network Design Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2380",
pages = "973--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:00 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2380.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2380/23800973.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2380/23800973.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Daemen:2002:AWT,
author = "Joan Daemen and Vincent Rijmen",
title = "{AES} and the Wide Trail Design Strategy",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "108--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320108.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320108.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Daemen:2002:DRA,
author = "Joan Daemen and Vincent Rijmen",
title = "The Design of {Rijndael}: {AES} -- The {Advanced
Encryption Standard}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvii + 238",
year = "2002",
DOI = "https://doi.org/10.1007/978-3-662-04722-4",
ISBN = "3-642-07646-7, 3-662-04722-5 (e-book)",
ISBN-13 = "978-3-642-07646-6, 978-3-662-04722-4 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25",
bibdate = "Sat Jun 10 08:35:19 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-662-04722-4",
abstract = "In October 2000, the US National Institute of
Standards and Technology selected the block cipher
Rijndael as the Advanced Encryption Standard (AES). AES
is expected to gradually replace the present Data
Encryption Standard (DES) as the most widely applied
data encryption technology. This book by the designers
of the block cipher presents Rijndael from scratch. The
underlying mathematics and the wide trail strategy as
the basic design idea are explained in detail and the
basics of differential and linear cryptanalysis are
reworked. Subsequent chapters review all known attacks
against the Rijndael structure and deal with
implementation and optimization issues. Finally, other
ciphers related to Rijndael are presented. This volume
is THE authoritative guide to the Rijndael algorithm
and AES. Professionals, researchers, and students
active or interested in data encryption will find it a
valuable source of information and reference.",
acknowledgement = ack-nhfb,
subject = "Advanced Encryption Standard; Data Encryption
Standard; Computer science; Computer Communication
Networks; Data protection; Data encryption (Computer
science); Computer software",
tableofcontents = "1. The Advanced Encryption Standard Process \\
2. Preliminaries \\
3. Specification of Rijndael \\
4. Implementation Aspects \\
5. Design Philosophy \\
6. The Data Encryption Standard \\
7. Correlation Matrices \\
8. Difference Propagation \\
9. The Wide Trail Strategy \\
10. Cryptanalysis \\
11. Related Block Ciphers \\
Appendices \\
A. Propagation Analysis in Galois Fields \\
A.1.1 Difference Propagation \\
A.l.2 Correlation \\
A. 1.4 Functions that are Linear over GF(2) \\
A.2.1 Difference Propagation \\
A.2.2 Correlation \\
A.2.4 Functions that are Linear over GF(2) \\
A.3.3 Dual Bases \\
A.4.2 Relationship Between Trace Patterns and Selection
Patterns \\
A.4.4 Illustration \\
A.5 Rijndael-GF \\
B. Trail Clustering \\
B.1 Transformations with Maximum Branch Number \\
B.2 Bounds for Two Rounds \\
B.2.1 Difference Propagation \\
B.2.2 Correlation \\
B.3 Bounds for Four Rounds \\
B.4 Two Case Studies \\
B.4.1 Differential Trails \\
B.4.2 Linear Trails \\
C. Substitution Tables \\
C.1 SRD \\
C.2 Other Tables \\
C.2.1 xtime \\
C.2.2 Round Constants \\
D. Test Vectors \\
D.1 KeyExpansion \\
D.2 Rijndael(128,128) \\
D.3 Other Block Lengths and Key Lengths \\
E. Reference Code",
}
@Article{Dalkilic:2002:CPF,
author = "Mehmet Emin Dalkili{\c{c}} and G{\"o}khan
Dalkili{\c{c}}",
title = "On the Cryptographic Patterns and Frequencies in
{Turkish} Language",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2457",
pages = "144--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:29 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2457.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2457/24570144.htm;
http://link.springer.de/link/service/series/0558/papers/2457/24570144.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Damgaard:2002:EPF,
author = "Ivan Damg{\aa}rd and Jesper Buus Nielsen",
title = "Expanding Pseudorandom Functions; or: From
Known-Plaintext Security to Chosen-Plaintext Security",
crossref = "Yung:2002:ACC",
pages = "449--464",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Damgaard:2002:PHP,
author = "Ivan Damg{\aa}rd and Jesper Buus Nielsen",
title = "Perfect Hiding and Perfect Binding Universally
Composable Commitment Schemes with Constant Expansion
Factor",
crossref = "Yung:2002:ACC",
pages = "581--596",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420565.htm;
http://link.springer.de/link/service/series/0558/bibs/2442/24420581.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420565.pdf;
http://link.springer.de/link/service/series/0558/papers/2442/24420581.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Danas:2002:CUS,
author = "George Danas",
title = "On a cryptosystem using simple continued fractions",
journal = "Math. Sci. Res. J.",
volume = "6",
number = "3",
pages = "168--173",
year = "2002",
ISSN = "1537-5978",
MRclass = "68P25 (11T71 14G50 94A60)",
MRnumber = "1 902 656",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Mathematical Sciences Research Journal. An
International Journal of Rapid Publication",
}
@Article{Dang:2002:EPT,
author = "Zhe Dang and Oscar H. Ibarra and Zhi-Wei Sun",
title = "On the Emptiness Problem for Two-Way {NFA} with One
Reversal-Bounded Counter",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2518",
pages = "103--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:58:01 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2518.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2518/25180103.htm;
http://link.springer.de/link/service/series/0558/papers/2518/25180103.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Debaert:2002:RRI,
author = "Christophe Debaert and Henri Gilbert",
title = "The {RIPEMD} and {RIPEMD} Improved Variants of {MD4}
Are Not Collision Free",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "52--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550052.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550052.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Delbourg:2002:JBC,
author = "D. Delbourg and G. Penillault and T. K. Tuong and M.
Decourt and N. Borome and H. Harroch and B. Lessellier
and B. Waast and J. P. Mouffron",
title = "A {Java}-based control system for the {Orsay} tandem
accelerator",
journal = j-PRAMANA,
volume = "59",
number = "6",
publisher = "Indian Academy of Sciences",
pages = "1025--1034",
year = "2002",
CODEN = "PRAMCI",
ISSN = "0304-4289",
bibdate = "Tue Jan 14 08:59:22 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "Pramana: Journal of Physics",
journal-URL = "http://www.springerlink.com/content/0304-4289",
}
@Book{Delfs:2002:ICP,
author = "Hans Delfs and Helmut Knebl",
title = "Introduction to Cryptography: Principles and
Applications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 310",
year = "2002",
DOI = "https://doi.org/10.1007/978-3-642-87126-9",
ISBN = "3-642-87126-7 (e-book), 3-642-87128-3",
ISBN-13 = "978-3-642-87126-9 (e-book), 978-3-642-87128-3",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25",
bibdate = "Sat Jun 10 08:35:18 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-642-87126-9",
abstract = "Due to the rapid growth of digital communication and
electronic data exchange, information security has
become a crucial issue in industry, business, and
administration. Modern cryptography provides essential
techniques for securing information and protecting
data. In the first part, this book covers the key
concepts of cryptography on an undergraduate level,
from encryption and digital signatures to cryptographic
protocols. Essential techniques are demonstrated in
protocols for key exchange, user identification,
electronic elections and digital cash. In the second
part, more advanced topics are addressed, such as the
bit security of one-way functions and computationally
perfect pseudorandom bit generators. The security of
cryptographic schemes is a central topic. Typical
examples of provably secure encryption and signature
schemes and their security proofs are given. Though
particular attention is given to the mathematical
foundations, no special background in mathematics is
presumed. The necessary algebra, number theory and
probability theory are included in the appendix. Each
chapter closes with a collection of exercises. The
second edition contains corrections, revisions and new
material, including a complete description of the AES,
an extended section on cryptographic hash functions, a
new section on random oracle proofs, and a new section
on public-key encryption schemes that are provably
secure against adaptively-chosen-ciphertext attacks.",
acknowledgement = ack-nhfb,
subject = "Computer science; Data encryption (Computer science);
Coding theory; Coding theory; Computer science; Data
encryption (Computer science)",
tableofcontents = "1. Introduction \\
1.1 Encryption and Secrecy \\
1.2 The Objectives of Cryptography \\
1.3 Attacks \\
1.4 Cryptographic Protocols \\
1.5 Provable Security \\
2. Symmetric-Key Encryption \\
2.1 Stream Ciphers \\
2.2 Block Ciphers \\
3. Public-Key Cryptography \\
3.1 The Concept of Public-Key Cryptography \\
3.2 Modular Arithmetic \\
3.3 RSA \\
3.4 Hash Functions \\
3.5 The Discrete Logarithm \\
3.6 Modular Squaring \\
4. Cryptographic Protocols \\
4.1 Key Exchange and Entity Authentication \\
4.2 Identification Schemes \\
4.3 Commitment Schemes \\
4.4 Electronic Elections \\
4.5 Digital Cash \\
5. Probabilistic Algorithms \\
5.1 Coin-Tossing Algorithms \\
5.2 Monte Carlo and Las Vegas Algorithms \\
6. One-Way Functions and the Basic Assumptions \\
6.1 A Notation for Probabilities \\
6.2 Discrete Exponential Function \\
6.3 Uniform Sampling Algorithms \\
6.4 Modular Powers \\
6.5 Modular Squaring \\
6.6 Quadratic Residuosity Property \\
6.7 Formal Definition of One-Way Functions \\
6.8 Hard-Core Predicates \\
7. Bit Security of One-Way Functions \\
7.1 Bit Security of the Exp Family \\
7.2 Bit Security of the RSA Family \\
7.3 Bit Security of the Square Family \\
8. One-Way Functions and Pseudorandomness \\
8.1 Computationally Perfect Pseudorandom Bit Generators
\\
8.2 Yao's Theorem \\
9. Provably Secure Encryption \\
9.1 Classical Information-Theoretic Security \\
9.2 Perfect Secrecy and Probabilistic Attacks \\
9.3 Public-Key One-Time Pads \\
9.4 Computationally Secret Encryption Schemes \\
9.5 Unconditional Security of Cryptosystems \\
10. Provably Secure Digital Signatures \\
10.1 Attacks and Levels of Security \\
10.2 Claw-Free Pairs and Collision-Resistant Hash
Functions \\
10.3 Authentication-Tree-Based Signatures \\
10.4 A State-Free Signature Scheme \\
A. Algebra and Number Theory \\
A.1 The Integers \\
A.2 Residues \\
A.3 The Chinese Remainder Theorem \\
A.4 Primitive Roots and the Discrete Logarithm \\
A.5 Quadratic Residues \\
A.6 Modular Square Roots \\
A.7 Primes and Primality Tests \\
B. Probabilities and Information Theory \\
B.1 Finite Probability Spaces and Random Variables \\
B.2 The Weak Law of Large Numbers \\
B.3 Distance Measures \\
B.4 Basic Concepts of Information Theory \\
References",
}
@Article{DeMatteis:2002:PP,
author = "A. {De Matteis} and S. Pagnutti",
title = "Pseudorandom permutation",
journal = j-J-COMPUT-APPL-MATH,
volume = "142",
number = "2",
pages = "367--375",
day = "15",
month = may,
year = "2002",
CODEN = "JCAMDI",
DOI = "https://doi.org/10.1016/S0377-0427(01)00425-3",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Tue Dec 27 06:57:58 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042701004253",
abstract = "A number-theoretical approach to the permutation of a
sequence of objects performed by means of a linear
congruential generator of pseudorandom numbers is
presented. A sufficient condition is found for
obtaining permutations with the property that each
object definitely abandons its initial position. Since
cryptography is among the possible applications, the
generator performing the inverse transformation is also
given.",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
keywords = "congruential generators; cryptography;
multiplicative-additive generators; pseudorandom
numbers; random permutation; shuffling, inverse
permutation",
}
@Article{deWeger:2002:CRS,
author = "Benne de Weger",
title = "Cryptanalysis of {RSA} with small prime difference",
journal = j-APPL-ALGEBRA-ENG-COMMUN-COMPUT,
volume = "13",
number = "1",
pages = "17--28",
year = "2002",
CODEN = "AAECEW",
ISSN = "0938-1279 (print), 1432-0622 (electronic)",
ISSN-L = "0938-1279",
MRclass = "94A60",
MRnumber = "1 895 813",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Applicable Algebra in Engineering, Communication and
Computing",
}
@Article{Ding:2002:HEE,
author = "Yan Zong Ding and Michael O. Rabin",
title = "Hyper-Encryption and Everlasting Security",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2285",
pages = "1--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:12 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2285.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2285/22850001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2285/22850001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dodis:2002:KIP,
author = "Yevgeniy Dodis and Jonathan Katz and Shouhuai Xu and
Moti Yung",
title = "Key-Insulated Public Key Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "65--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320065.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320065.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Dodis:2002:NUO,
author = "Y. Dodis and J. Spencer",
title = "On the (non)universality of the one-time pad",
crossref = "IEEE:2002:PAI",
pages = "376--385",
year = "2002",
bibdate = "Fri Jul 15 16:13:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8411/26517/01181962.pdf?isnumber=26517&prod=CNF&arnumber=1181962&arSt=+376&ared=+385&arAuthor=Dodis%2C+Y.%3B+Spencer%2C+J.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=26517&arnumber=1181962&count=82&index=38",
acknowledgement = ack-nhfb,
}
@Article{Driscoll:2002:BER,
author = "Kevin Driscoll",
title = "{BeepBeep}: Embedded Real-Time Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "164--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650164.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650164.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Ekert:2002:BTQ,
author = "Artur Ekert",
title = "{29. The Bell Theorem in quantum cryptography: Vortrag
am 14. November 2000}",
crossref = "Bertlmann:2002:QUB",
pages = "??--??",
year = "2002",
bibdate = "Thu Jun 14 06:45:11 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{England:2002:AOO,
author = "Paul England and Marcus Peinado",
title = "Authenticated Operation of Open Computing Devices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "346--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840346.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840346.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Erickson:2002:EDD,
author = "Jonathan Erickson",
title = "Editorial: Deciphering the Doors of Knowledge",
journal = j-DDJ,
volume = "27",
number = "4",
pages = "8--8",
month = apr,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Mar 5 07:08:41 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Ettinger:2002:QQC,
author = "Mark Ettinger",
title = "20 Questions, Quantum Computers, and Cryptography",
journal = j-LOS-ALAMOS-SCIENCE,
volume = "27",
pages = "46--51",
year = "2002",
CODEN = "LASCDI",
ISSN = "0273-7116",
bibdate = "Mon Apr 11 08:15:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Los Alamos Science",
keywords = "quantum cryptography",
}
@Article{Fan:2002:ETB,
author = "Lei Fan and Jian-Hua Li and Hong-Wen Zhu",
title = "An enhancement of timestamp-based password
authentication scheme",
journal = j-COMPUT-SECUR,
volume = "21",
number = "7",
pages = "665--667",
month = nov,
year = "2002",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:49 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802011185",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Feghali:2002:SAP,
author = "Wajdi Feghali and Brad Burres and Gilbert Wolrich and
Douglas Carrigan",
title = "Security: Adding Protection to the Network via the
Network Processor",
journal = j-INTEL-TECH-J,
volume = "6",
number = "3",
pages = "40--49",
day = "15",
month = aug,
year = "2002",
ISSN = "1535-766X",
bibdate = "Sun Nov 17 11:06:06 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://developer.intel.com/technology/itj/2002/volume06issue03/art02_security/p01_abstract.htm;
http://developer.intel.com/technology/itj/2002/volume06issue03/art02_security/vol6iss3_art02.pdf",
keywords = "3DES; AES; authentication; encryption; security;
SHA-1",
}
@InProceedings{Fehr:2002:LVD,
author = "Serge Fehr and Ueli Maurer",
title = "Linear {VSS} and Distributed Commitments Based on
Secret Sharing and Pairwise Checks",
crossref = "Yung:2002:ACC",
pages = "565--580",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420565.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420565.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Fernandes:2002:SAL,
author = "Savio Fernandes and KLM Reddy",
title = "Securing Applications on {Linux} with {PAM}",
journal = j-LINUX-J,
volume = "102",
pages = "??--??",
month = oct,
year = "2002",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Apr 12 06:59:06 MDT 2003",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue102/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://www.linuxjournal.com/article.php?sid=5940",
abstract = "Make your new authentication technology work with
Linux applications or add standards-based
authentication to your new application.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@TechReport{Filiol:2002:NST,
author = "Eric Filiol",
title = "A New Statistical Testing for Symmetric Ciphers and
Hash Functions",
institution = "ESAT --- Virology and Cryptology Lab",
address = "B.P. 18 35998 Rennes, FRANCE",
pages = "14",
day = "23",
month = jul,
year = "2002",
bibdate = "Mon Sep 16 06:46:47 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Cryptology ePrint Archive, Report 2002/099.",
URL = "http://eprint.iacr.org/2002/099/",
abstract = "This paper presents a new, powerful statistical
testing of symmetric ciphers and hash functions which
allowed us to detect biases in both of these systems
where previously known tests failed. We first give a
complete characterization of the Algebraic Normal Form
(ANF) of random Boolean functions by means of the
M{\"o}bius transform. Then we built a new testing based
on the comparison between the structure of the
different Boolean functions Algebraic Normal Forms
characterizing symmetric ciphers and hash functions and
those of purely random Boolean functions. Detailed
testing results on several cryptosystems are presented.
As a main result we show that AES, DES Snow and
Lili-128 fail all or part of the tests and thus present
strong biases.",
acknowledgement = ack-nhfb,
keywords = "Boolean function; statistical testing; symmetric
cipher; randomness; hash function; M{\"o}bius
transform; Walsh Transform",
}
@Article{Finley:2002:BSE,
author = "Brian Elliott Finley",
title = "{BOEL}: a Small {Embedded Linux} with {PIC}
Libraries",
journal = j-EMBEDDED-LINUX-J,
volume = "8",
pages = "44--46",
month = mar # "\slash " # apr,
year = "2002",
CODEN = "????",
ISSN = "1534-083X",
bibdate = "Thu May 09 05:32:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
URL = "http://embedded.linuxjournal.com/magazine/issue08/;
http://www.linuxdevices.com/articles/AT2829528599.html",
abstract = "Brian's single-floppy Linux reveals software-shrinking
secrets of the Linux masters.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
}
@Manual{FIPS:2002:KHM,
author = "{FIPS}",
title = "The {Keyed-Hash Message Authentication Code (HMAC)}",
volume = "198",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "vii + 13",
day = "6",
month = mar,
year = "2002",
bibdate = "Thu Aug 18 07:16:02 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "FIPS PUB",
URL = "http://csrc.nist.gov/publications/fips/fips198/fips-198a.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; HMAC; MAC",
}
@Manual{FIPS:2002:SHS,
author = "{FIPS}",
title = "{Secure Hash Standard}",
volume = "180-2",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "iv + 79",
day = "1",
month = aug,
year = "2002",
bibdate = "Thu Aug 18 07:16:02 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "FIPS PUB",
URL = "http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography",
}
@Article{Fischer:2002:NFC,
author = "Wieland Fischer and Jean-Pierre Seifert",
title = "Note on Fast Computation of Secret {RSA} Exponents",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "136--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840136.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840136.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fluhrer:2002:CMB,
author = "Scott R. Fluhrer",
title = "Cryptanalysis of the Mercy Block Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "28--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550028.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550028.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Fluhrer:2002:CSP,
author = "Scott R. Fluhrer",
title = "Cryptanalysis of the {SEAL 3.0} Pseudorandom Function
Family",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "135--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550135.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550135.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Frankel:2002:ASD,
author = "Yair Frankel and Philip MacKenzie and Moti Yung",
title = "Adaptively secure distributed public-key systems",
journal = j-THEOR-COMP-SCI,
volume = "287",
number = "2",
pages = "535--561",
month = sep,
year = "2002",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 20 18:08:58 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Frenkiel:2002:CCS,
author = "Michel Frenkiel and Paul Grison and Philippe
Laluyaux",
title = "{Clip Card}: {Smart Card} Based Traffic Tickets",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2456",
pages = "313--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:28 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2456.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2456/24560313.htm;
http://link.springer.de/link/service/series/0558/papers/2456/24560313.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@TechReport{Fuller:2002:LRA,
author = "Joanne Fuller and William Millan",
title = "On Linear Redundancy in the {AES} {S}-Box",
type = "Report",
number = "2002/111",
institution = "Cryptology ePrint Archive",
year = "2002",
bibdate = "Tue Sep 10 06:11:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eprint.iacr.org/2002/111.ps;
http://eprint.iacr.org/2002/111.ps.gz;
http://eprint.iacr.org/2002/111/",
abstract = "We show the existence of a previously unknown linear
redundancy property of the only nonlinear component of
the AES block cipher. It is demonstrated that the
outputs of the 8*8 Rijndael s-box (based on inversion
in a finite field) are all equivalent under affine
transformation. The method used to discover these
affine relations is novel and exploits a new
fundamental result on the invariance properties of
local connection structure of affine equivalence
classes. As well as increasing existing concerns about
the security of the AES, these results may also have
serious consequences for many other ciphers recently
proposed for standardisation.",
acknowledgement = ack-nhfb,
}
@Article{Furman:2002:DCN,
author = "Vladimir Furman",
title = "Differential Cryptanalysis of {Nimbus}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "187--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550187.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550187.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Furuya:2002:SAK,
author = "Soichi Furuya",
title = "Slide Attacks with a Known-Plaintext Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "214--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880214.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880214.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Galbraith:2002:PKS,
author = "S. Galbraith and J. Malone-Lee and N. P. Smart",
title = "Public key signatures in the multi-user setting",
journal = j-INFO-PROC-LETT,
volume = "83",
number = "5",
pages = "263--266",
day = "15",
month = sep,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:29 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Book{Galbreath:2002:CID,
author = "Nicholas Galbreath",
title = "Cryptography for {Internet} and database applications:
developing secret and public key techniques with
{Java}",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "400",
year = "2002",
ISBN = "0-471-21029-3",
ISBN-13 = "978-0-471-21029-0",
LCCN = "QA76.9.A25 G35 2002",
bibdate = "Tue May 6 05:26:58 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; database security;
Internet --- security measures; Java (computer program
language)",
}
@Book{Garfinkel:2002:WSP,
author = "Simson Garfinkel and Gene Spafford",
title = "{Web} Security, Privacy \& Commerce",
publisher = pub-ORA,
address = pub-ORA:adr,
edition = "Second",
pages = "xxviii + 756",
year = "2002",
ISBN = "0-596-00045-6",
ISBN-13 = "978-0-596-00045-5",
LCCN = "TK5105.59 .G37 2002 Stacks",
bibdate = "Wed Oct 30 16:15:17 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.oreilly.com/catalog/prdindex.html",
price = "US\$44.95",
URL = "http://safari.oreilly.com/0596000456;
http://www.oreilly.com/catalog/websec2",
acknowledgement = ack-nhfb,
keywords = "computer networks --- security measures; Web sites ---
security measures; World Wide Web --- security
measures",
publishersummary = "This much expanded new edition explores Web
security risks and how to minimize them. Aimed at Web
users, administrators, and content providers, Web
Security, Privacy & Commerce covers cryptography, SSL,
the Public Key Infrastructure, digital signatures,
digital certificates, privacy threats (cookies, log
files, Web logs, Web bugs), hostile mobile code, and
Web publishing (intellectual property, P3P, digital
payments, client-side digital signatures, code signing,
PICS).",
}
@Article{Gaudry:2002:CCS,
author = "Pierrick Gaudry",
title = "A Comparison and a Combination of {SST} and {AGM}
Algorithms for Counting Points of Elliptic Curves in
Characteristic $2$",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "311--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010311.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010311.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gennaro:2002:CPG,
author = "Rosario Gennaro and Daniele Micciancio",
title = "Cryptanalysis of a Pseudorandom Generator Based on
Braid Groups",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "1--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gennaro:2002:RSM,
author = "Rosario Gennaro and Yuval Ishai and Eyal Kushilevitz
and Tal Rabin",
title = "On $2$-Round Secure Multiparty Computation",
crossref = "Yung:2002:ACC",
pages = "178--193",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Gentry:2002:CRN,
author = "Craig Gentry and Mike Szydlo",
title = "Cryptanalysis of the Revised {NTRU} Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "299--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320299.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320299.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gentry:2002:HIB,
author = "Craig Gentry and Alice Silverberg",
title = "Hierarchical {ID}-Based Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "548--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010548.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010548.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gilbert:2002:CS,
author = "Henri Gilbert and Marine Minier",
title = "Cryptanalysis of {SFLASH}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "288--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320288.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320288.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gilbert:2002:NRP,
author = "Henri Gilbert and Marine Minier",
title = "New Results on the Pseudorandomness of Some
Blockcipher Constructions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "248--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550248.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550248.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gilbert:2002:SCL,
author = "Gerald Gilbert and Michael Hamrick",
title = "Secrecy, Computational Loads and Rates in Practical
Quantum Cryptography",
journal = j-ALGORITHMICA,
volume = "34",
number = "4",
pages = "314--339",
month = nov,
year = "2002",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-002-0977-2",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "94A60 (68P25 68Q05 81P68 94-02)",
MRnumber = "MR1943510 (2004a:94041)",
bibdate = "Fri Jan 6 11:38:16 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=34&issue=4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Quantum computation and quantum cryptography",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=34&issue=4&spage=314",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
remark = "Special issue on Quantum Algorithms and
Cryptography.",
}
@Article{Giles:2002:ADW,
author = "James Giles and Reiner Sailer and Dinesh Verma and
Suresh Chari",
title = "Authentication for Distributed {Web} Caches",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2502",
pages = "126--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:43 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2502.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2502/25020126.htm;
http://link.springer.de/link/service/series/0558/papers/2502/25020126.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gisin:2002:QC,
author = "Nicolas Gisin and Gr{\'e}goire Ribordy and Wolfgang
Tittel and Hugo Zbinden",
title = "Quantum cryptography",
journal = j-REV-MOD-PHYS,
volume = "74",
number = "1",
pages = "145--195",
month = jan,
year = "2002",
CODEN = "RMPHAT",
DOI = "https://doi.org/10.1103/RevModPhys.74.145",
ISSN = "0034-6861 (print), 1538-4527 (electronic), 1539-0756",
ISSN-L = "0034-6861",
bibdate = "Tue May 22 16:37:26 MDT 2012",
bibsource = "http://rmp.aps.org/toc/RMP/v74/i1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/revmodphys2000.bib",
URL = "http://link.aps.org/doi/10.1103/RevModPhys.74.145;
http://rmp.aps.org/abstract/RMP/v74/i1/p145_1",
acknowledgement = ack-nhfb,
fjournal = "Reviews of Modern Physics",
journal-URL = "http://rmp.aps.org/browse",
onlinedate = "8 March 2002",
}
@Article{Gligor:2002:FEA,
author = "Virgil D. Gligor and Pompiliu Donescu",
title = "Fast Encryption and Authentication: {XCBC} Encryption
and {XECB} Authentication Modes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "92--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550092.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550092.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Golic:2002:LCB,
author = "Jovan Dj. Goli{\'c} and Vittorio Bagini and Guglielmo
Morgari",
title = "Linear Cryptanalysis of {Bluetooth} Stream Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "238--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320238.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320238.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gomulkiewicz:2002:HWA,
author = "Marcin Gomu{\l}kiewicz and Miros{\l}aw Kuty{\l}owski",
title = "{Hamming} Weight Attacks on Cryptographic Hardware ---
Breaking Masking Defense",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2502",
pages = "90--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:43 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2502.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2502/25020090.htm;
http://link.springer.de/link/service/series/0558/papers/2502/25020090.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Goodrich:2002:EDD,
author = "Michael T. Goodrich and Roberto Tamassia and Jasminka
Hasi{\'c}",
title = "An Efficient Dynamic and Distributed Cryptographic
Accumulator",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "372--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330372.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330372.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gordon:2002:TCP,
author = "Andrew D. Gordon",
title = "Types for Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2421",
pages = "99--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:19 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2421.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2421/24210099.htm;
http://link.springer.de/link/service/series/0558/papers/2421/24210099.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Granboulan:2002:FDC,
author = "Louis Granboulan",
title = "Flaws in Differential Cryptanalysis of {Skipjack}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "328--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550328.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550328.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Granboulan:2002:SSR,
author = "Louis Granboulan",
title = "Short Signatures in the Random Oracle Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "364--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010364.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010364.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Grembowski:2002:CAH,
author = "Tim Grembowski and Roar Lien and Kris Gaj and Nghi
Nguyen and Peter Bellows and Jaroslav Flidr and Tom
Lehman and Brian Schott",
title = "Comparative Analysis of the Hardware Implementations
of Hash Functions {SHA-1} and {SHA-512}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "75--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330075.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330075.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gurgens:2002:APF,
author = "Sigrid G{\"u}rgens and Peter Ochsenschl{\"a}ger and
Carsten Rudolph",
title = "Authenticity and Provability --- {A} Formal
Framework",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2437",
pages = "227--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2437.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2437/24370227.htm;
http://link.springer.de/link/service/series/0558/papers/2437/24370227.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gutmann:2002:CFP,
author = "Peter Gutmann",
title = "Cover Feature: {PKI}: It's Not Dead, Just Resting",
journal = j-COMPUTER,
volume = "35",
number = "8",
pages = "41--49",
month = aug,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:53:31 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2002/08/r8041.htm;
http://csdl.computer.org/dl/mags/co/2002/08/r8041.pdf;
http://www.computer.org/computer/co2002/r8041abs.htm",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "PKI (public key infrastructure)",
}
@PhdThesis{Gutmann:2002:DVC,
author = "Peter Gutmann",
title = "The Design and Verification of a Cryptographic
Security Architecture",
school = "Department of Computer Science, University of
Auckland, Private Bag 92019",
address = "Auckland, New Zealand",
year = "2002",
bibdate = "Thu Apr 04 07:25:57 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Published in book form \cite{Gutmann:2004:CSA}.",
URL = "http://www.cryptoengines.com/~peter/06_random.pdf;
http://www.cs.auckland.ac.nz/~pgut001/;
http://www.cs.auckland.ac.nz/~pgut001/pubs/thesis.html",
acknowledgement = ack-nhfb,
}
@Article{Guttman:2002:ATS,
author = "Joshua D. Guttman and F. Javier Thayer",
title = "Authentication tests and the structure of bundles",
journal = j-THEOR-COMP-SCI,
volume = "283",
number = "2",
pages = "333--380",
month = jun,
year = "2002",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 20 18:08:57 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Hacigumus:2002:ESE,
author = "Hakan Hacig{\"u}m{\"u}{\c{s}} and Bala Iyer and Chen
Li and Sharad Mehrotra",
title = "Executing {SQL} over encrypted data in the
database-service-provider model",
crossref = "Franklin:2002:PAS",
pages = "216--227",
year = "2002",
bibdate = "Fri Oct 31 08:03:02 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Halevi:2002:SSE,
author = "Shai Halevi and Don Coppersmith and Charanjit Jutla",
title = "Scream: a Software-Efficient Stream Cipher",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "195--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650195.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650195.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Halevy:2002:LBE,
author = "Dani Halevy and Adi Shamir",
title = "The {LSD} Broadcast Encryption Scheme",
crossref = "Yung:2002:ACC",
pages = "47--60",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420047.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420047.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Hamalainen:2002:GPS,
author = "Antti H{\"a}m{\"a}l{\"a}inen and Matti Tommiska and
Jorma Skytt{\"a}",
title = "6.78 Gigabits per Second Implementation of the {IDEA}
Cryptographic Algorithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "760--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380760.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380760.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Han:2002:CMV,
author = "Daewan Han and Sangwoo Park and Seongtaek Chee",
title = "Cryptanalysis of the Modified Version of the Hash
Function Proposed at {PKC'98}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "252--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650252.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650252.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Han:2002:DMA,
author = "Hong Han and Xian Liang Lu and Jun Lu and Chen Bo and
Ren Li Yong",
title = "Data mining aided signature discovery in network-based
intrusion detection system",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "7--13",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Han:2002:HEF,
author = "Guo Ping Han and Kai Quan Shi",
title = "Half-encryption and full-encryption of fuzzy
recognition",
journal = "J. Fuzzy Math.",
volume = "10",
number = "2",
pages = "385--397",
year = "2002",
ISSN = "1066-8950",
MRclass = "94A60",
MRnumber = "1 908 631",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Journal of Fuzzy Mathematics",
}
@Article{Hanaoka:2002:HNI,
author = "Goichiro Hanaoka and Tsuyoshi Nishioka and Yuliang
Zheng and Hideki Imai",
title = "A Hierarchical Non-interactive Key-Sharing Scheme with
Low Memory Size and High Resistance against Collusion
Attacks",
journal = j-COMP-J,
volume = "45",
number = "3",
pages = "293--303",
month = "????",
year = "2002",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri May 10 10:12:07 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_03/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_03/450293.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_03/pdf/450293.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Hanaoka:2002:USA,
author = "Goichiro Hanaoka and Junji Shikata and Yumiko Hanaoka
and Hideki Imai",
title = "Unconditionally Secure Anonymous Encryption and Group
Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "81--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010081.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010081.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hand:2002:MPP,
author = "Steven Hand and Timothy Roscoe",
title = "{Mnemosyne}: Peer-to-Peer Steganographic Storage",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2429",
pages = "130--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:21 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2429.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2429/24290130.htm;
http://link.springer.de/link/service/series/0558/papers/2429/24290130.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Haneberg:2002:MSS,
author = "Dominik Haneberg and Wolfgang Reif and Kurt Stenzel",
title = "A Method for Secure {Smartcard} Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2422",
pages = "319--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:23 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2422.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2422/24220319.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2422/24220319.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Harbitter:2002:MAP,
author = "Alan Harbitter and Daniel A. Menasc{\'e}",
title = "A methodology for analyzing the performance of
authentication protocols",
journal = j-TISSEC,
volume = "5",
number = "4",
pages = "458--491",
month = nov,
year = "2002",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Aug 7 09:02:36 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Hassler:2002:JCP,
author = "Vesna Hassler",
title = "{Java} card for e-payment applications",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "xvii + 362",
year = "2002",
ISBN = "1-58053-291-8",
ISBN-13 = "978-1-58053-291-4",
LCCN = "QA76.73.J38 J3638 2002",
bibdate = "Mon May 6 06:26:30 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Artech House computer security series",
acknowledgement = ack-nhfb,
keywords = "Java (computer program language); smart cards",
}
@Article{He:2002:WSM,
author = "Wei-Hua He",
title = "Weaknesses in some multisignature schemes for
specified group of verifiers",
journal = j-INFO-PROC-LETT,
volume = "83",
number = "2",
pages = "95--99",
day = "31",
month = jul,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:29 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Henderson:2002:MTS,
author = "Marie Henderson and Robert Coulter and Ed Dawson and
Eiji Okamoto",
title = "Modelling Trust Structures for Public Key
Infrastructures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "56--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840056.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840056.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hernandez:2002:GCT,
author = "Julio C{\'e}sar Hern{\'a}ndez and Jos{\'e} Mar{\'\i}a
Sierra and Pedro Isasi and Arturo Ribagorda",
title = "Genetic Cryptoanalysis of Two Rounds {TEA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2331",
pages = "1024--1031",
year = "2002",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-47789-6_108",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Feb 01 16:44:05 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.springerlink.com/content/0pa8nj982jewn9ev/",
abstract = "Distinguishing the output of a cryptographic primitive
such as a block cipher or a hash function from the
output of a random mapping seriously affects the
credibility of the primitive security, and defeats it
for many cryptographic applications. However, this is
usually a quite difficult task. In a previous work [1],
a new cryptoanalytic technique was presented and proved
useful in distinguishing a block cipher from a random
permutation in a completely automatic way. This
technique is based in the selection of the worst input
patterns for the block cipher with the aid of genetic
algorithms. The objective is to find which input
patters generate a significant deviation of the
observed output from the output we would expect from a
random permutation. In [1], this technique was applied
to the case of the block cipher TEA with 1 round. The
much harder problem of breaking TEA with 2 rounds is
successfully solved in this paper, where an efficient
distinguisher is also presented.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
remark = "ICCS 2002",
}
@Article{Herzberg:2002:SX,
author = "Amir Herzberg",
title = "Securing {XML}",
journal = j-DDJ,
volume = "27",
number = "3",
pages = "56, 59--62",
month = mar,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:42 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2002/2002_03/secxml.txt",
abstract = "Amir examines several proposed XML security
mechanisms, including XML Digital Signatures and XML
Encryption. Additional resources include {\tt
secxml.txt} (listings). WORKBENCH",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Hevia:2002:PSG,
author = "Alejandro Hevia and Daniele Micciancio",
title = "The Provable Security of Graph-Based One-Time
Signatures and Extensions to Algebraic Signature
Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "379--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010379.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010379.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hitchcock:2002:NEC,
author = "Yvonne Hitchcock and Paul Montague",
title = "A New Elliptic Curve Scalar Multiplication Algorithm
to Resist Simple Power Analysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "214--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840214.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840214.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hong:2002:IDC,
author = "Deukjo Hong and Jaechul Sung and Shiho Moriai and
SangjinLee and Jongin Lim",
title = "Impossible Differential Cryptanalysis of {Zodiac}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "300--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550300.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550300.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hong:2002:PSR,
author = "Seokhie Hong and Jaechul Sung and Sangjin Lee and
Jongin Lim and Jongsu Kim",
title = "Provable security for $ 13 $ round {Skipjack}-like
structure",
journal = j-INFO-PROC-LETT,
volume = "82",
number = "5",
pages = "243--246",
day = "15",
month = jun,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:28 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Hopper:2002:PSS,
author = "Nicholas J. Hopper and John Langford and Luis von
Ahn",
title = "Provably Secure Steganography: (Extended Abstract)",
crossref = "Yung:2002:ACC",
pages = "77--92",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420077.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420077.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Horwitz:2002:THI,
author = "Jeremy Horwitz and Ben Lynn",
title = "Toward Hierarchical Identity-Based Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "466--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320466.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320466.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hsu:2002:IGT,
author = "Chien-Lung Hsu and Tzong-Sun Wu and Tzong-Chen Wu",
title = "Improvements of generalization of threshold signature
and authenticated encryption for group communications",
journal = j-INFO-PROC-LETT,
volume = "81",
number = "1",
pages = "41--45",
day = "16",
month = jan,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
MRclass = "94A60 (94A62)",
MRnumber = "1 866 812",
bibdate = "Mon Jan 26 06:35:42 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190;
MathSciNet database",
URL = "http://www.elsevier.com/gej-ng/10/23/20/85/27/33/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Hughes:2002:LAA,
author = "James Hughes",
title = "A Linear Algebraic Attack on the {AAFG1} Braid Group
Cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "176--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840176.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840176.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Humphries:2002:IC,
author = "Jeffrey W. Humphries and Martin C. Carlisle",
title = "Introduction to {Cryptography}",
journal = j-JERIC,
volume = "2",
number = "3",
pages = "2--2",
month = sep,
year = "2002",
CODEN = "????",
ISSN = "1531-4278",
bibdate = "Tue Feb 3 18:43:37 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/jeric/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Journal on Educational Resources in Computing
(JERIC)",
}
@Article{Iglesias:2002:NSB,
author = "A. Iglesias",
title = "A New Scheme Based on Semiconductor Lasers with
Phase-Conjugate Feedback for Cryptographic
Communications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2510",
pages = "135--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:47 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2510.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2510/25100135.htm;
http://link.springer.de/link/service/series/0558/papers/2510/25100135.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Inamori:2002:SPB,
author = "Hitoshi Inamori",
title = "Security of Practical {BB84} Quantum Key
Distribution",
journal = j-ALGORITHMICA,
volume = "34",
number = "4",
pages = "366--371",
month = nov,
year = "2002",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-002-0984-3",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "94A60 (68Q05 81P68 94A62)",
MRnumber = "MR1943512 (2004a:94048)",
bibdate = "Fri Jan 6 11:38:16 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=34&issue=4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Quantum computation and quantum cryptography",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=34&issue=4&spage=366",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
remark = "Special issue on Quantum Algorithms and
Cryptography.",
}
@Article{Inamori:2002:SPT,
author = "Hitoshi Inamori",
title = "Security of Practical Time-Reversed {EPR} Quantum Key
Distribution",
journal = j-ALGORITHMICA,
volume = "34",
number = "4",
pages = "340--365",
month = nov,
year = "2002",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-002-0983-4",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "94A60 (68Q05 81P68 94A62)",
MRnumber = "MR1943511 (2003k:94029)",
MRreviewer = "Hoi-Kwong Lo",
bibdate = "Fri Jan 6 11:38:16 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=34&issue=4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Quantum computation and quantum cryptography",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=34&issue=4&spage=340",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
remark = "Special issue on Quantum Algorithms and
Cryptography.",
}
@InProceedings{Itkis:2002:SSB,
author = "Gene Itkis and Leonid Reyzin",
title = "{SiBIR}: {Signer-Base Intrusion-Resilient}
Signatures",
crossref = "Yung:2002:ACC",
pages = "499--514",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420499.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420499.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Iwata:2002:NCP,
author = "Tetsu Iwata and Tomonobu Yoshino and Kaoru Kurosawa",
title = "Non-cryptographic Primitive for Pseudorandom
Permutation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "149--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650149.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650149.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jakimovski:2002:CS,
author = "Goce Jakimovski and Ljup{\v{c}}o Kocarev",
title = "Cryptanalysis of {SBLH}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "144--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550144.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550144.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jakobsson:2002:MAL,
author = "Markus Jakobsson and David Pointcheval",
title = "Mutual Authentication for Low-Power Mobile Devices",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2339",
pages = "178--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:40 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2339.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2339/23390178.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2339/23390178.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Jallad:2002:ICC,
author = "Kahil Jallad and Jonathan Katz and Bruce Schneier",
editor = "Lynn Batten and Jennifer Seberry",
booktitle = "Information security and privacy: 7th Australasian
conference, ACISP 2002, Melbourne, Australia, July
3--5, 2002: proceedings",
title = "Implementation of Chosen-Ciphertext Attacks against
{PGP} and {GnuPG}",
volume = "2384",
publisher = pub-SV,
address = pub-SV:adr,
pages = "??--??",
year = "2002",
ISBN = "3-540-43861-0",
ISBN-13 = "978-3-540-43861-8",
LCCN = "QA76.9.A25 A278 2002",
bibdate = "Thu Sep 12 16:25:57 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330090.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330090.pdf;
http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
http://www.counterpane.com/pgp-attack.html",
acknowledgement = ack-nhfb,
annote = "Not shown in table of contents at publisher Web
site.",
}
@Article{Jaulmes:2002:SHG,
author = "{\'E}liane Jaulmes and Guillaume Poupard",
title = "On the Security of Homage Group Authentication
Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2339",
pages = "106--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:40 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2339.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2339/23390106.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2339/23390106.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Jonsson:2002:FCA,
author = "Fredrik J{\"o}nsson and Thomas Johansson",
title = "A fast correlation attack on {LILI-128}",
journal = j-INFO-PROC-LETT,
volume = "81",
number = "3",
pages = "127--132",
day = "14",
month = feb,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 06:35:42 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.elsevier.com/gej-ng/10/23/20/85/34/28/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "cryptography",
}
@Article{Jonsson:2002:SRE,
author = "Jakob Jonsson and Burton S. {Kaliski Jr.}",
title = "On the Security of {RSA} Encryption in {TLS}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2442",
pages = "127--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:26 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420127.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420127.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Jonsson:2002:SRT,
author = "Jakob Jonsson and Burton S. {Kaliski, Jr.}",
title = "On the Security of {RSA} Encryption in {TLS}",
crossref = "Yung:2002:ACC",
pages = "127--142",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420017.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420017.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Joux:2002:BAA,
author = "Antoine Joux and Gwena{\"e}lle Martinet and
Fr{\'e}d{\'e}ric Valette",
title = "Blockwise-Adaptive Attackers: Revisiting the
(In)Security of Some Provably Secure Encryption Modes:
{CBC}, {GEM}, {IACBC}",
crossref = "Yung:2002:ACC",
pages = "17--30",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420017.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420017.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Joux:2002:WTP,
author = "Antoine Joux",
title = "The {Weil} and {Tate} Pairings as Building Blocks for
Public Key Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2369",
pages = "20--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:55 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2369.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2369/23690020.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2369/23690020.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Juang:2002:VMA,
author = "Wen-Shenq Juang and Chin-Laung Lei and Horng-Twu
Liaw",
title = "A Verifiable Multi-Authority Secret Election Allowing
Abstention from Voting",
journal = j-COMP-J,
volume = "45",
number = "6",
pages = "672--682",
month = "????",
year = "2002",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Nov 6 11:21:54 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/450672.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_45/Issue_06/pdf/450672.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Judge:2002:WWM,
author = "Paul Judge and Mostafa Ammar",
title = "{WHIM}: watermarking multicast video with a hierarchy
of intermediaries",
journal = j-COMP-NET-AMSTERDAM,
volume = "39",
number = "6",
pages = "699--712",
day = "21",
month = aug,
year = "2002",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Nov 9 12:48:58 MST 2002",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/15/22/96/53/27/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Kanda:2002:SCA,
author = "Masayuki Kanda and Tsutomu Matsumoto",
title = "Security of {Camellia} against Truncated Differential
Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "286--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550286.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550286.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kariya:2002:GM,
author = "S. Kariya",
title = "Getting the message",
journal = j-IEEE-SPECTRUM,
volume = "39",
number = "8",
pages = "56--57",
month = aug,
year = "2002",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2002.1021957",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "clandestine activities; cryptography; Cryptography;
Data security; defense industry; electrical engineers;
electromagnetic noncommunications transmissions;
electronic communications; electronic warfare;
Electronic warfare; encryption; foreign communication;
global eavesdropping; government policies; Governmental
factors; intelligence gathering; interception; military
communication; Military communication; missile signals;
Personnel; personnel; radar signals; security
clearance; security of data; sensitive compartmented
information; signal detection; signals intelligence;
technical challenges; technical complexities;
telecommunication security; US National Security
Agency",
}
@Article{Katz:2002:TCB,
author = "Jonathan Katz and Moti Yung",
title = "Threshold Cryptosystems Based on Factoring",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "192--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010192.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010192.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Kaufman:2002:NSP,
author = "Charlie Kaufman and Radia Perlman and Michael
Speciner",
title = "Network security: private communication in a public
world",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
edition = "Second",
pages = "xxvi + 713",
year = "2002",
ISBN = "0-13-046019-2",
ISBN-13 = "978-0-13-046019-6",
LCCN = "QA76.9.A25 K39 2002",
bibdate = "Thu Feb 2 17:19:10 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Prentice Hall series in computer networking and
distributed systems",
acknowledgement = ack-nhfb,
subject = "Computer security; Computers; Access control;
Electronic data processing departments; Security
measures; Computer networks",
tableofcontents = "Introduction \\
Introduction to cryptography \\
Secret key cryptography \\
Modes of operation \\
Hashes and message digests \\
Public key algorithms \\
Number theory \\
Math with AES and elliptic curves \\
Overview of authentication systems \\
Security handshake pitfalls \\
Strong password protocols \\
Kerberos V4 \\
Kerberos V5 \\
PKI (Public Key Infastructures) \\
Real-time communication security \\
IPsec: AH and ESP \\
IPsec: IKE \\
SSL/TLS \\
Electronic mail security \\
PEM and S/MIME \\
PGP (Pretty Good Privacy) \\
Firewalls \\
More security systems \\
Web issues \\
Folklore",
}
@Article{Kelsey:2002:CIL,
author = "John Kelsey",
title = "Compression and Information Leakage of Plaintext",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "263--276",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Feb 25 06:55:26 2003",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650263.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650263.pdf",
abstract = "Cryptosystems like AES and triple-DES are designed to
encrypt a sequence of input bytes (the plaintext) into
a sequence of output bytes (the ciphertext) in such a
way that the output carries no information about that
plaintext except its length. In recent years, concerns
have been raised about `side-channel' attacks on
various cryptosystems-attacks that make use of some
kind of leaked information about the cryptographic
operations (e.g., power consumption or timing) to
defeat them. In this paper, we describe a somewhat
different kind of side-channel provided by data
compression algorithms, yielding information about
their inputs by the size of their outputs. The
existence of some information about a compressor's
input in the size of its output is obvious; here, we
discuss ways to use this apparently very small leak of
information in surprisingly powerful ways.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Kenyon:2002:DNR,
author = "Tony Kenyon",
title = "Data Networks: Routing, Security, and Performance
Optimization",
publisher = pub-DP,
address = pub-DP:adr,
pages = "xvi + 807",
year = "2002",
ISBN = "1-55558-271-0",
ISBN-13 = "978-1-55558-271-5",
LCCN = "TK5105.543 .K46 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$59.99",
acknowledgement = ack-nhfb,
}
@Book{Kenyon:2002:HPD,
author = "Tony Kenyon",
title = "High Performance Data Network Design: Design
Techniques and Tools",
publisher = pub-DP,
address = pub-DP:adr,
pages = "xiii + 623",
year = "2002",
ISBN = "1-55558-207-9",
ISBN-13 = "978-1-55558-207-4",
LCCN = "TK5105.5 .K45 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$54.99",
acknowledgement = ack-nhfb,
}
@Article{Kerins:2002:FPE,
author = "Tim Kerins and Emanuel Popovici and William Marnane
and Patrick Fitzpatrick",
title = "Fully Parameterizable Elliptic Curve Cryptography
Processor over {GF(2)}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "750--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380750.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380750.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kiayias:2002:CHB,
author = "Aggelos Kiayias and Moti Yung",
title = "Cryptographic Hardness Based on the Decoding of
{Reed--Solomon} Codes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2380",
pages = "232--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:00 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2380.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2380/23800232.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2380/23800232.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kida:2002:PGR,
author = "Masanari Kida",
title = "Potential Good Reduction of Elliptic Curves",
journal = j-J-SYMBOLIC-COMP,
volume = "34",
number = "3",
pages = "173--180",
month = sep,
year = "2002",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Tue Dec 16 09:13:32 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171",
}
@Article{Kim:2002:ABA,
author = "Jongsung Kim and Dukjae Moon and Wonil Lee and Seokhie
Hong and Sangjin Lee and Seokwon Jung",
title = "Amplified Boomerang Attack against Reduced-Round
{SHACAL}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "243--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010243.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010243.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2002:EPS,
author = "Nam-Yeun Kim and Won-Ho Lee and Kee-Young Yoo",
title = "Efficient Power-Sum Systolic Architectures for
Public-Key Cryptosystems in {GF($ 2^m $ )}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2387",
pages = "153--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:08 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2387.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2387/23870153.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2387/23870153.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2002:IDS,
author = "Nam-Yeun Kim and Dae-Ghon Kho and Kee-Young Yoo",
title = "Inversion\slash Division Systolic Architecture for
Public-Key Cryptosystems in {GF($ 2^m $ )}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "289--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Sep 12 08:41:42 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330289.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330289.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2002:NIS,
author = "Myungsun Kim and Kwangjo Kim",
title = "A New Identification Scheme Based on the Bilinear
{Diffie--Hellman} Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "362--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840362.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840362.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2002:PAA,
author = "Hyun-Sung Kim and Kee-Young Yoo",
title = "Parallel Algorithm and Architecture for Public-Key
Cryptosystem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2510",
pages = "145--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:47 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2510.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2510/25100145.htm;
http://link.springer.de/link/service/series/0558/papers/2510/25100145.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kim:2002:SMA,
author = "Seongyeol Kim and Ilyong Chung",
title = "A Secure Mobile Agent System Applying Identity-Based
Digital Signature Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2510",
pages = "588--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:47 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2510.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2510/25100588.htm;
http://link.springer.de/link/service/series/0558/papers/2510/25100588.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{King:2002:RGI,
author = "Brian King",
title = "Requirements for Group Independent Linear Threshold
Secret Sharing Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "89--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840089.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840089.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Klimov:2002:ANC,
author = "Alexander Klimov and Anton Mityagin and Adi Shamir",
title = "Analysis of Neural Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "288--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010288.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010288.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Knill:2002:FPE,
author = "Emanuel Knill and Raymond Laflamme and Howard N.
Barnum and Diego A. Dalvit and Jacek J. Dziarmaga and
James E. Gubernatis and Leonid Gurvits and Gerardo
Ortiz and Lorenza Viola and Wojciech H. Zurek",
title = "From Factoring to Phase Estimation: a Discussion of
{Shor}'s Algorithm",
journal = j-LOS-ALAMOS-SCIENCE,
volume = "27",
pages = "38--45",
year = "2002",
CODEN = "LASCDI",
ISSN = "0273-7116",
bibdate = "Mon Apr 11 08:15:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://library.lanl.gov/cgi-bin/getfile?27-05.pdf",
acknowledgement = ack-nhfb,
fjournal = "Los Alamos Science",
keywords = "quantum cryptography",
}
@Article{Knill:2002:QIP,
author = "Emanuel Knill and Raymond Laflamme and Howard N.
Barnum and Diego A. Dalvit and Jacek J. Dziarmaga and
James E. Gubernatis and Leonid Gurvits and Gerardo
Ortiz and Lorenza Viola and Wojciech H. Zurek",
title = "Quantum Information Processing: a Hands-on Primer",
journal = j-LOS-ALAMOS-SCIENCE,
volume = "27",
pages = "2--37",
year = "2002",
CODEN = "LASCDI",
ISSN = "0273-7116",
bibdate = "Mon Apr 11 08:15:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://library.lanl.gov/cgi-bin/getfile?27-07.pdf",
acknowledgement = ack-nhfb,
fjournal = "Los Alamos Science",
keywords = "quantum cryptography",
}
@Article{Knudsen:2002:IC,
author = "Lars Knudsen and David Wagner",
title = "Integral Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "112--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650112.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650112.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Kocher:2002:IS,
author = "Paul Kocher",
booktitle = "11th USENIX Security Symposium 2002, August 5--9,
2002, San Francisco CA, Invited talk",
title = "Illusions of Security",
year = "2002",
bibdate = "Tue Oct 15 11:02:26 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Unpublished.",
URL = "http://www.usenix.org/publications/library/proceedings/sec02/tech.html",
abstract = "For years, the standard yardstick for measuring
cryptographic security has been key length.
Unfortunately, real adversaries lack the propriety to
limit themselves to tidy attacks such as brute force,
factoring, and differential cryptanalysis. Worse,
Moore's Law is driving vendors to build systems of
exponentially increasing complexity without making
security experts exponentially smarter to compensate.
The resulting products have a minuscule chance of being
extremely secure, and a large chance of being
critically flawed. This talk will review basic
engineering approaches that can improve assurance and
will show how evaluators and attackers break overly
complex, poorly tested designs.",
acknowledgement = ack-nhfb,
}
@Article{Koeune:2002:FIL,
author = "Fran{\c{c}}ois Koeune and Gael Rouvroy and
Fran{\c{c}}ois-Xavier Standaert and Jean-Jacques
Quisquater and Jean-Pierre David and Jean-Didier
Legat",
title = "An {FPGA} Implementation of the Linear Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "845--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380845.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380845.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Koga:2002:GFR,
author = "Hiroki Koga",
title = "A General Formula of the $ (t, n) $-Threshold Visual
Secret Sharing Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "328--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010328.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010328.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Konstantinou:2002:SLE,
author = "Elisavet Konstantinou and Yiannis Stamatiou and
Christos Zaroliagis",
title = "A Software Library for Elliptic Curve Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2461",
pages = "625--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:11:21 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2461.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2461/24610625.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2461/24610625.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Krause:2002:BBC,
author = "Matthias Krause",
title = "{BDD}-Based Cryptanalysis of Keystream Generators",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "222--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320222.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320222.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Krause:2002:USP,
author = "Rory Krause",
title = "Using {SSH} Port Forwarding to Print at Remote
Locations",
journal = j-LINUX-J,
volume = "94",
pages = "60--62, 64",
month = feb,
year = "2002",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Fri Feb 8 16:59:02 MST 2002",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue94/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://noframes.linuxjournal.com/lj-issues/issue94/article.php?sid=5462",
abstract = "Directly print your office documents at home.",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Ku:2002:IIB,
author = "Wei-Chi Ku",
title = "An Improved {ID}-Based Authentication and Key
Distribution Protocol",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2344",
pages = "375--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:13 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2344.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2344/23440375.htm;
http://link.springer.de/link/service/series/0558/papers/2344/23440375.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kuhn:2002:ICM,
author = "Ulrich K{\"u}hn",
title = "Improved Cryptanalysis of {MISTY1}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "61--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650061.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650061.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Kuhn:2002:OTD,
author = "Markus Kuhn",
editor = "{IEEE}",
booktitle = "Proceedings: 2002 IEEE Symposium on Security and
Privacy, 12-15 May, 2002, Berkeley, California",
title = "Optical Time-Domain Eavesdropping Risks of {CRT}
Displays",
publisher = pub-IEEE,
address = pub-IEEE:adr,
bookpages = "ix + 295",
pages = "3--18",
year = "2002",
ISBN = "0-7695-1543-6",
ISBN-13 = "978-0-7695-1543-4",
LCCN = "QA76.9.A25 I34 2002",
bibdate = "Wed Sep 25 12:29:30 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "IEEE Computer Society Order Number PR01543.",
URL = "http://www.cl.cam.ac.uk/~mgk25/ieee02-optical.pdf",
acknowledgement = ack-nhfb,
}
@Article{Kumar:2002:APS,
author = "M. V. N. Ashwin Kumar and K. Srinathan and C. Pandu
Rangan",
title = "Asynchronous Perfectly Secure Computation Tolerating
Generalized Adversaries",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "497--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840497.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840497.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kuramitsu:2002:ETC,
author = "K. Kuramitsu and K. Sakamura",
title = "Electronic Tickets on Contactless {Smartcard}
Database",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2453",
pages = "392--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:33 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2453.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2453/24530392.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2453/24530392.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kusters:2002:DCP,
author = "Ralf K{\"u}sters",
title = "On the Decidability of Cryptographic Protocols with
Open-Ended Data Structures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2421",
pages = "515--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:19 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2421.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2421/24210515.htm;
http://link.springer.de/link/service/series/0558/papers/2421/24210515.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Kwon:2002:DSA,
author = "Taekyoung Kwon",
title = "Digital signature algorithm for securing digital
identities",
journal = j-INFO-PROC-LETT,
volume = "82",
number = "5",
pages = "247--252",
day = "15",
month = jun,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:28 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
note = "See erratum \cite{Kwon:2003:EDS}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Labbe:2002:AIF,
author = "Anna Labb{\'e} and Annie P{\'e}rez",
title = "{AES} Implementation on {FPGA}: Time --- Flexibility
Tradeoff",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "836--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380836.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380836.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lange:2002:PIE,
author = "Tanja Lange and Arne Winterhof",
title = "Polynomial Interpolation of the Elliptic Curve and
{XTR} Discrete Logarithm",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2387",
pages = "137--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:08 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2387.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2387/23870137.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2387/23870137.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lee:2002:FRU,
author = "Cheng-Chi Lee and Min-Shiang Hwang and Wei-Peng Yang",
title = "A flexible remote user authentication scheme using
{Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "3",
pages = "46--52",
month = jul,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lee:2002:RUA,
author = "Cheng-Chi Lee and Li-Hua Li and Min-Shiang Hwang",
title = "A remote user authentication scheme using hash
functions",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "23--29",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lee:2002:SEC,
author = "Hyung-Woo Lee and Sung-Min Lee and Im-Yeong Lee",
title = "Secure Electronic Copyright Distribution with Public
Key Based Traitor Tracing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2455",
pages = "324--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:11:20 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2455.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2455/24550324.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2455/24550324.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lee:2002:TDC,
author = "Seonhee Lee and Seokhie Hong and Sangjin Lee and
Jongin Lim and Seonhee Yoon",
title = "Truncated Differential Cryptanalysis of {Camellia}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "32--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880032.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880032.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Leroy:2002:BVJ,
author = "Xavier Leroy",
title = "Bytecode verification on {Java} smart cards",
journal = j-SPE,
volume = "32",
number = "4",
pages = "319--340",
day = "10",
month = apr,
year = "2002",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.438",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Sat Mar 23 17:30:52 MST 2002",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.interscience.wiley.com/journalfinder.html",
URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/91016433/START;
http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=91016433&PLACEBO=IE.pdf",
acknowledgement = ack-nhfb,
fjournal = "Software---Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
}
@Article{Leveiller:2002:CNF,
author = "Sabine Leveiller and Joseph Boutros and Philippe
Guillot and Gilles Z{\'e}mor",
title = "Cryptanalysis of Nonlinear Filter Generators with $ \{
0, 1 \} $-Metric {Viterbi} Decoding",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "50--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880050.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880050.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Levy:2002:C,
author = "Stephen Levy",
title = "Crypto",
publisher = pub-PENGUIN,
address = pub-PENGUIN:adr,
pages = "368",
year = "2002",
ISBN = "0-14-024432-8",
ISBN-13 = "978-0-14-024432-8",
LCCN = "????",
bibdate = "Sat Apr 20 12:29:43 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2002:HNP,
author = "Wen-Ching W. Li and Mats N{\"a}slund and Igor E.
Shparlinski",
title = "Hidden Number Problem with the Trace and Bit Security
of {XTR} and {LUC}",
crossref = "Yung:2002:ACC",
pages = "433--448",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Lindell:2002:CAB,
author = "Yehuda Lindell and Anna Lysyanskaya and Tal Rabin",
title = "On the composition of authenticated {Byzantine}
agreement",
crossref = "ACM:2002:PTF",
pages = "514--523",
year = "2002",
bibdate = "Tue Jan 13 06:21:05 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Lingmann:2002:DSK,
author = "Thomas Lingmann",
title = "{Datenverschl{\"u}sselung: sichere Kommunikation mit
Linux und BSD: Security mit Open Source}. ({German})
[{Data} encoding: Secure communication with {Linux} and
{BSD}: {Security} with {Open Source}]",
publisher = "C \& L",
address = "B{\"o}blingen, Germany",
pages = "476 (est.)",
year = "2002",
ISBN = "3-932311-87-8 (??invalid checksum??)",
ISBN-13 = "978-3-932311-87-1",
LCCN = "????",
bibdate = "Tue Sep 17 06:16:52 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "System security and cryptography; Systemsicherheit und
Kryptographie",
language = "German",
}
@InProceedings{Liskov:2002:TBC,
author = "Moses Liskov and Ronald L. Rivest and David Wagner",
title = "Tweakable Block Ciphers",
crossref = "Yung:2002:ACC",
pages = "31--46",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420031.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420031.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Lorenz:2002:SSG,
author = "U. Lorenz and B. Monien",
title = "The Secret of Selective Game Tree Search, When Using
Random-Error Evaluations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2285",
pages = "203--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:12 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2285.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2285/22850203.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2285/22850203.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lotspiech:2002:CFB,
author = "Jeffrey Lotspiech and Stefan Nusser and Florian
Pestoni",
title = "Cover Feature: Broadcast Encryption's Bright Future",
journal = j-COMPUTER,
volume = "35",
number = "8",
pages = "57--63",
month = aug,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:53:31 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2002/08/r8057.htm;
http://csdl.computer.org/dl/mags/co/2002/08/r8057.pdf;
http://www.computer.org/computer/co2002/r8057abs.htm",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Lou:2002:ESA,
author = "D-C Lou and T-L Yin and M-C Chang",
title = "An efficient steganographic approach",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "17",
number = "4/5",
pages = "??--??",
month = jul # "\slash " # sep,
year = "2002",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Sat Jan 03 19:15:31 2004",
bibsource = "http://www.crlpublishing.co.uk/cssecont00.htm;
http://www.crlpublishing.co.uk/cssecont02.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
}
@Article{Lou:2002:SMS,
author = "Der-Chyuan Lou and Jiang-Lung Liu",
title = "Steganographic Method for Secure Communications",
journal = j-COMPUT-SECUR,
volume = "21",
number = "5",
pages = "449--460",
day = "1",
month = oct,
year = "2002",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:48 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802005151",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Lu:2002:HEA,
author = "Chi-Jen Lu",
title = "Hyper-encryption against Space-Bounded Adversaries
from On-Line Strong Extractors",
crossref = "Yung:2002:ACC",
pages = "257--271",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420257.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420257.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Luccio:2002:AC,
author = "Fabrizio Luccio and Linda Pagli",
title = "From Algorithms to Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2286",
pages = "15--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:12 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2286.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2286/22860015.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2286/22860015.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lucks:2002:SAB,
author = "Stefan Lucks",
title = "The Saturation Attack --- {A} Bait for {Twofish}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "1--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lucks:2002:VCS,
author = "Stefan Lucks",
title = "A Variant of the {Cramer--Shoup} Cryptosystem for
Groups of Unknown Order",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "27--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010027.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010027.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lutz:2002:BBS,
author = "Michael J. Lutz",
title = "Bookshelf: Balancing Speed and Complexity with
Compilers; Advanced Cryptology Text; Computer
Architecture Basics; Mutation Testing Compendium",
journal = j-COMPUTER,
volume = "35",
number = "4",
pages = "89--89",
month = apr,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Apr 5 15:49:45 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/co/books/co2002/pdf/r4089.pdf;
http://www.computer.org/computer/co2002/r4089abs.htm",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Lysyanskaya:2002:USV,
author = "Anna Lysyanskaya",
title = "Unique Signatures and Verifiable Random Functions from
the {DH--DDH} Separation",
crossref = "Yung:2002:ACC",
pages = "597--612",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420597.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420597.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{MacKenzie:2002:TPA,
author = "Philip MacKenzie and Thomas Shrimpton and Markus
Jakobsson",
title = "Threshold Password-Authenticated Key Exchange:
(Extended Abstract)",
crossref = "Yung:2002:ACC",
pages = "385--400",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
http://link.springer-ny.com/link/service/series/0558/tocs/t2455.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2455/24550224.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2455/24550224.pdf;
http://link.springer.de/link/service/series/0558/bibs/2442/24420385.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420385.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Maggi:2002:USV,
author = "Paolo Maggi and Riccardo Sisto",
title = "Using {SPIN} to Verify Security Properties of
Cryptographic Protocols",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2318",
pages = "187--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:29 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2318.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2318/23180187.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2318/23180187.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Maitra:2002:CSB,
author = "Subhamoy Maitra and Palash Sarkar",
title = "Cryptographically significant {Boolean} functions with
five valued {Walsh} spectra",
journal = j-THEOR-COMP-SCI,
volume = "276",
number = "1--2",
pages = "133--146",
day = "6",
month = apr,
year = "2002",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Apr 25 16:46:36 MDT 2002",
bibsource = "http://www.elsevier.com/locate/issn/03043975;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/41/16/247/27/33/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Malcolm:2002:LAM,
author = "James Malcolm",
title = "Lightweight Authentication in a Mobile Network
(Transcript of Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2467",
pages = "217--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2467.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2467/24670217.htm;
http://link.springer.de/link/service/series/0558/papers/2467/24670217.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Malkhi:2002:ACE,
author = "Dahlia Malkhi and Elan Pavlov",
title = "Anonymity without `Cryptography' (Extended Abstract)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2339",
pages = "117--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:40 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2339.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2339/23390117.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2339/23390117.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mana:2002:PMD,
author = "Antonio Ma{\~n}a and Sonia Matamoros",
title = "Practical Mobile Digital Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2455",
pages = "224--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:11:20 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2455.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2455/24550224.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2455/24550224.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mann:2002:HI,
author = "Charles C. Mann",
title = "Homeland Insecurity",
journal = "The Atlantic",
volume = "??",
number = "??",
pages = "??--??",
month = sep,
year = "2002",
bibdate = "Tue Sep 10 06:40:25 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.theatlantic.com/issues/2002/09/mann.htm",
abstract = "A top expert says America's approach to protecting
itself will only make matters worse. Forget `foolproof'
technology--we need systems designed to fail smartly.",
acknowledgement = ack-nhfb,
annote = "Lengthy article about (in)security, Bruce Schneier,
and Counterplane Internet Security.",
}
@Article{Marques:2002:BSJ,
author = "Paulo Marques",
title = "Building Secure {Java RMI} Servers",
journal = j-DDJ,
volume = "27",
number = "11",
pages = "36, 38, 40--42, 44",
month = nov,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jun 12 05:46:19 MDT 2003",
bibsource = "http://www.ddj.com/articles/2002/0211/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/documents/s=7644/ddj0211d/",
abstract = "Paulo uses the proxy pattern along with the Java
Authentication and Authorization Service API to build
secure Java Remote Method Invocation servers that allow
only properly authenticated users access to systems.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Marsaglia:2002:SDP,
author = "George Marsaglia and Wai Wan Tsang",
title = "Some Difficult-to-pass Tests of Randomness",
journal = j-J-STAT-SOFT,
volume = "7",
number = "3",
pages = "1--8",
year = "2002",
CODEN = "JSSOBK",
ISSN = "????",
bibdate = "Sun Nov 17 22:35:43 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jstatsoft.org/v07/i03;
http://www.jstatsoft.org/v07/i03/tuftests.c;
http://www.jstatsoft.org/v07/i03/tuftests.pdf;
http://www.jstatsoft.org/v07/i03/updates",
abstract = "We describe three tests of randomness --- tests that
many random number generators fail. In particular, all
congruential generators --- even those based on a prime
modulus --- fail at least one of the tests, as do many
simple generators, such as shift register and lagged
Fibonacci. On the other hand, generators that pass the
three tests seem to pass all the tests in the Diehard
Battery of Tests.\par
Note that these tests concern the randomness of a
generator's output as a sequence of independent,
uniform 32-bit integers. For uses where the output is
converted to uniform variates in $ [0, 1) $, potential
flaws of the output as integers will seldom cause
problems after the conversion. Most generators seem to
be adequate for producing a set of uniform reals in $
[0, 1) $, but several important applications. notably
in cryptography and number theory --- for example,
establishing probable primes, complexity of factoring
algorithms, random partitions of large integers --- may
require satisfactory performance on the kinds of tests
we describe here.",
acknowledgement = ack-nhfb,
fjournal = "Journal of Statistical Software",
journal-URL = "http://www.jstatsoft.org/",
}
@Article{Martinelli:2002:SSA,
author = "Fabio Martinelli",
title = "Symbolic Semantics and Analysis for Crypto-{CCS} with
(Almost) Generic Inference Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2420",
pages = "519--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:18 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2420.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2420/24200519.htm;
http://link.springer.de/link/service/series/0558/papers/2420/24200519.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Martinez-Nadal:2002:CUM,
author = "Apol{\textperiodcentered}l{\`o}nia Mart{\'\i}nez-Nadal
and Josep Llu{\'\i}s Ferrer-Gomila",
title = "Comments to the {UNCITRAL} Model Law on Electronic
Signatures",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "229--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330229.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330229.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Masuda:2002:CDC,
author = "Naoki Masuda and Kazuyuki Aihara",
title = "Cryptosystems with discretized chaotic maps",
journal = "IEEE Trans. Circuits Systems I Fund. Theory Appl.",
volume = "49",
number = "1",
pages = "28--40",
year = "2002",
CODEN = "ITCAEX",
ISSN = "1057-7122 (print), 1558-1268 (electronic)",
MRclass = "94A60 (37E05 37N99 82C05)",
MRnumber = "1 874 225",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "IEEE Transactions on Circuits and Systems. I.
Fundamental Theory and Applications",
}
@InProceedings{Matsumoto:2002:IAG,
author = "T. Matsumoto and H. Matsumoto and K. Yamada and S.
Hoshino",
booktitle = "Proceedings of SPIE: Optical Security and Counterfeit
Deterrence Techniques IV, 2002",
title = "Impact of Artificial Gummy Fingers on Fingerprint
Systems",
volume = "4677",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "??--??",
year = "2002",
bibdate = "Thu May 16 08:43:04 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.itu.int/itudoc/itu-t/workshop/security/present/s5p4.pdf",
acknowledgement = ack-nhfb,
annote = "Shows how biometric fingerprint identification systems
can be easily fooled. See commentary by Bruce Schneier
in CRYPTO-GRAM newsletter of 15-May-2002.",
}
@InProceedings{May:2002:CUR,
author = "Alexander May",
title = "Cryptanalysis of Unbalanced {RSA} with Small
{CRT}-Exponent",
crossref = "Yung:2002:ACC",
pages = "242--256",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420242.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420242.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{May:2002:SKS,
author = "Lauren May and Matt Henricksen and William Millan and
Gary Carter and Ed Dawson",
title = "Strengthening the Key Schedule of the {AES}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "226--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840226.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840226.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Micciancio:2002:GCK,
author = "D. Micciancio",
title = "Generalized compact knapsacks, cyclic lattices, and
efficient one-way functions from worst-case complexity
assumptions",
crossref = "IEEE:2002:PAI",
pages = "356--365",
year = "2002",
bibdate = "Fri Jul 15 16:13:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8411/26517/01181960.pdf?isnumber=26517&prod=CNF&arnumber=1181960&arSt=+356&ared=+365&arAuthor=Micciancio%2C+D.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=26517&arnumber=1181960&count=82&index=36",
acknowledgement = ack-nhfb,
}
@InProceedings{Micciancio:2002:ICH,
author = "Daniele Micciancio",
title = "Improved cryptographic hash functions with
worst-case\slash average-case connection",
crossref = "ACM:2002:PTF",
pages = "609--618",
year = "2002",
bibdate = "Tue Jan 13 06:21:05 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Mironov:2002:RSO,
author = "Ilya Mironov",
title = "(Not So) Random Shuffles of {RC4}",
crossref = "Yung:2002:ACC",
pages = "304--319",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Book{Mitnick:2002:ADC,
author = "Kevin D. (Kevin David) Mitnick and William L. Simon",
title = "The art of deception: controlling the human element of
security",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xvi + 352",
year = "2002",
ISBN = "0-471-23712-4, 0-7645-4280-X (paperback)",
ISBN-13 = "978-0-471-23712-9, 978-0-7645-4280-0 (paperback)",
LCCN = "QA76.9.A25 M585 2002",
bibdate = "Sat Dec 24 07:29:58 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/wiley043/2002512977.html;
http://www.loc.gov/catdir/description/wiley036/2002512977.html;
http://www.loc.gov/catdir/toc/wiley031/2002512977.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Information technology; Social
aspects; Computer hackers",
}
@Article{Mitra:2002:TAD,
author = "Ananda Mitra",
title = "Trust, authenticity, and discursive power in
cyberspace",
journal = j-CACM,
volume = "45",
number = "3",
pages = "27--29",
month = mar,
year = "2002",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Mar 12 16:19:59 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Mitrakas:2002:CCI,
author = "Andreas Mitrakas",
title = "Citizen Centric Identity Management: Chip Tricks?",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "7",
pages = "15--16",
day = "1",
month = jul,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)07010-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:33 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802070101",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Moller:2002:PEC,
author = "Bodo M{\"o}ller",
title = "Parallelizable Elliptic Curve Point Multiplication
Method with Resistance against Side-Channel Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "402--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330402.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330402.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Monrose:2002:TSG,
author = "Fabian Monrose and Michael Reiter and Qi Li and Daniel
P. Lopresti and Chilin Shih",
title = "Toward Speech-Generated Cryptographic Keys on
Resource-Constrained Devices",
crossref = "USENIX:2002:PUS",
pages = "283--296",
year = "2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec02/monrose.html",
}
@Article{Moon:2002:IDC,
author = "Dukjae Moon and Kyungdeok Hwang and Wonil Lee and
Sangjin Lee and Jongin Lim",
title = "Impossible Differential Cryptanalysis of Reduced Round
{XTEA} and {TEA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "49--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650049.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650049.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Moreira:2002:RCE,
author = "Emmanuel A. Moreira and Paul L. McAlpine and Simon D.
Haynes",
title = "{Rijndael} Cryptographic Engine on the {UltraSONIC}
Reconfigurable Platform",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "770--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380770.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380770.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Morelos-Zaragoza:2002:AEC,
author = "Robert Morelos-Zaragoza",
title = "The Art of Error Correcting Coding",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xvi + 221",
year = "2002",
ISBN = "0-471-49581-6",
ISBN-13 = "978-0-471-49581-9",
LCCN = "????",
bibdate = "Sat Apr 20 11:49:43 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 45.00, US\$95.00",
URL = "http://www.loc.gov/catdir/description/wiley035/2002280749.html;
http://www.loc.gov/catdir/toc/wiley023/2002280749.html",
acknowledgement = ack-nhfb,
subject = "Error-correcting codes (Information theory)",
}
@Article{Mukherjee:2002:CAB,
author = "Monalisa Mukherjee and Niloy Ganguly and P. Pal
Chaudhuri",
title = "Cellular Automata Based Authentication {(CAA)}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2493",
pages = "259--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:07 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2493.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2493/24930259.htm;
http://link.springer.de/link/service/series/0558/papers/2493/24930259.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Mullins:2002:MUC,
author = "J. Mullins",
title = "Making unbreakable code",
journal = j-IEEE-SPECTRUM,
volume = "39",
number = "5",
pages = "40--45",
month = may,
year = "2002",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/6.999793",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "ciphers; codebreakers; codemakers; cryptographers;
Decoding; Detectors; eavesdroppers; Finishing; message
encryption; optical fiber communication; Optical
fibers; optical fibre communication; photons; Physics;
Polarization; Public key; Public key cryptography;
quantum cryptography; Quantum mechanics; quantum
mechanics laws; quantum optics; quantum properties;
secure reception; Telegraphy; unbreakable code",
}
@TechReport{Murphy:2002:EASa,
author = "S. Murphy and M. J. B. Robshaw",
title = "Essential Algebraic Structure Within the {AES}",
type = "Report",
institution = "Information Security Group, Royal Holloway, University
of London",
address = "Egham, Surrey, TW20 0EX, UK",
pages = "16",
year = "2002",
bibdate = "Mon Sep 16 06:51:06 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.isg.rhul.ac.uk/~mrobshaw/aes-crypto.pdf",
acknowledgement = ack-nhfb,
keywords = "(Field) Conjugate; (Finite) Galois Field; Advanced
Encryption Standard; AES; Algebraic Structure; BES;
Multivariate Quadratic (MQ) Equations.; Rijndael",
}
@InProceedings{Murphy:2002:EASb,
author = "Sean Murphy and Matthew J. B. Robshaw",
title = "Essential Algebraic Structure within the {AES}",
crossref = "Yung:2002:ACC",
pages = "1--16",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420001.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420001.pdf;
http://www.isg.rhul.ac.uk/~mrobshaw/aes-crypto.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Murray:2002:IYP,
author = "Mark R. V. Murray",
title = "An Implementation of the {Yarrow PRNG} for {FreeBSD}",
crossref = "USENIX:2002:PBF",
pages = "47--53",
year = "2002",
bibdate = "Tue Oct 15 12:37:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/bsdcon02/murray.html",
acknowledgement = ack-nhfb,
keywords = "pseudo-random number generator",
}
@Article{Muthukrishnan:2002:IAS,
author = "S. Muthukrishnan and S. Cenk Sahinalp",
title = "An Improved Algorithm for Sequence Comparison with
Block Reversals",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2286",
pages = "319--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:12 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2286.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2286/22860319.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2286/22860319.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Namprempre:2002:SCB,
author = "Chanathip Namprempre",
title = "Secure Channels Based on Authenticated Encryption
Schemes: a Simple Characterization",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "515--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010515.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010515.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Naor:2002:DRA,
author = "Moni Naor",
title = "Deniable Ring Authentication",
crossref = "Yung:2002:ACC",
pages = "481--498",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420210.htm;
http://link.springer.de/link/service/series/0558/bibs/2442/24420481.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420210.pdf;
http://link.springer.de/link/service/series/0558/papers/2442/24420481.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Nazario:2002:RYS,
author = "Jose Nazario",
title = "A Rough Year for {SSH}",
journal = j-LINUX-J,
volume = "95",
pages = "??--??",
month = mar,
year = "2002",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Feb 14 06:30:28 MST 2002",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue95/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Web only.",
URL = "http://noframes.linuxjournal.com/lj-issues/issue95/article.php?sid=5672",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Nguyen:2002:AIN,
author = "Phong Q. Nguyen and David Pointcheval",
title = "Analysis and Improvements of {NTRU} Encryption
Paddings",
crossref = "Yung:2002:ACC",
pages = "210--225",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420210.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420210.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Niederreiter:2002:BRC,
author = "Harald Niederreiter",
title = "Book review: {{\em Cryptography and computational
number theory}}",
journal = j-MATH-COMPUT,
volume = "71",
number = "239",
pages = "??--??",
month = jul,
year = "2002",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Fri Nov 22 10:22:22 MST 2002",
bibsource = "http://www.ams.org/mcom/2002-71-239;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/mcom/2002-71-239/S0025-5718-02-01454-0/bookrev-S0025-5718-02-01454-0.html;
http://www.ams.org/mcom/2002-71-239/S0025-5718-02-01454-0/S0025-5718-02-01454-0.dvi;
http://www.ams.org/mcom/2002-71-239/S0025-5718-02-01454-0/S0025-5718-02-01454-0.pdf;
http://www.ams.org/mcom/2002-71-239/S0025-5718-02-01454-0/S0025-5718-02-01454-0.ps;
http://www.ams.org/mcom/2002-71-239/S0025-5718-02-01454-0/S0025-5718-02-01454-0.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@InProceedings{Nielsen:2002:SRO,
author = "Jesper Buus Nielsen",
title = "Separating Random Oracle Proofs from Complexity
Theoretic Proofs: The Non-committing Encryption Case",
crossref = "Yung:2002:ACC",
pages = "111--126",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420111.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420111.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@InProceedings{Nielsen:2002:TPF,
author = "Jesper Buus Nielsen",
title = "A Threshold Pseudorandom Function Construction and Its
Applications",
crossref = "Yung:2002:ACC",
pages = "401--416",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Book{Nievergelt:2002:FLM,
author = "Yves Nievergelt",
title = "Foundations of Logic and Mathematics: Applications to
Computer Science and Cryptography",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "xvi + 415",
year = "2002",
ISBN = "0-8176-4249-8 , 3-7643-4249-8",
ISBN-13 = "978-0-8176-4249-5, 978-3-7643-4249-4",
LCCN = "QA9 .N53 2002",
bibdate = "Fri Mar 23 19:09:42 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0812/2001052551-d.html;
http://www.loc.gov/catdir/enhancements/fy0812/2001052551-t.html",
acknowledgement = ack-nhfb,
subject = "Logic, Symbolic and mathematical; Set theory; Number
theory; Computer science; Mathematics",
zz-isbn = "0-8176-4249-8, 3-7643-4249-8",
}
@Article{Nikander:2002:DSAa,
author = "Pekka Nikander",
title = "Denial-of-Service, Address Ownership, and Early
Authentication in the {IPv6} World",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2467",
pages = "12--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2467.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2467/24670012.htm;
http://link.springer.de/link/service/series/0558/papers/2467/24670012.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nikander:2002:DSAb,
author = "Pekka Nikander",
title = "Denial of Service, Address Ownership, and Early
Authentication in the {IPv6} World (Transcript of
Discussion)",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2467",
pages = "22--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:33 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2467.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2467/24670022.htm;
http://link.springer.de/link/service/series/0558/papers/2467/24670022.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nishioka:2002:DAF,
author = "Mototsugu Nishioka and Hisayoshi Satoh and Kouichi
Sakurai",
title = "Design and Analysis of Fast Provably Secure Public-Key
Cryptosystems Based on a Modular Squaring",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "81--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880081.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880081.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Nordholt:2002:NFC,
author = "Jane E. Nordholt and Richard J. Hughes",
title = "A New Face for Cryptography",
journal = j-LOS-ALAMOS-SCIENCE,
volume = "27",
pages = "68--85",
year = "2002",
CODEN = "LASCDI",
ISSN = "0273-7116",
bibdate = "Mon Apr 11 08:15:55 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://library.lanl.gov/cgi-bin/getfile?27-08.pdf",
acknowledgement = ack-nhfb,
fjournal = "Los Alamos Science",
keywords = "quantum cryptography",
}
@Book{Northcutt:2002:NID,
author = "Stephen Northcutt and Judy Novak",
title = "Network intrusion detection",
publisher = pub-NEW-RIDERS,
address = pub-NEW-RIDERS:adr,
edition = "Third",
pages = "xvii + 490",
year = "2002",
ISBN = "0-7357-1265-4",
ISBN-13 = "978-0-7357-1265-2",
LCCN = "TK5105.59 .N475 2003",
bibdate = "Sat Dec 17 17:13:02 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Internet;
Security measures; Computer security",
}
@Article{Ohbuchi:2002:FDA,
author = "Ryutarou Ohbuchi and Akio Mukaiyama and Shigeo
Takahashi",
title = "A Frequency-Domain Approach to Watermarking {$3$D}
Shapes",
journal = j-CGF,
volume = "21",
number = "3",
pages = "373--382",
month = sep,
year = "2002",
CODEN = "CGFODY",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat Jan 10 08:23:48 MST 2004",
bibsource = "http://www.blackwellpublishing.com/journal.asp?ref=0167-7055;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
}
@Article{Ohzahata:2002:FAM,
author = "Satoshi Ohzahata and Shigetomo Kimura and Yoshihiko
Ebihara",
title = "A Fast Authentication Method for Secure and Seamless
Handoff",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2344",
pages = "243--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:13 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2344.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2344/23440243.htm;
http://link.springer.de/link/service/series/0558/papers/2344/23440243.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Padro:2002:LBI,
author = "Carles Padr{\'o} and Germ{\'a}n S{\'a}ez",
title = "Lower bounds on the information rate of secret sharing
schemes with homogeneous access structure",
journal = j-INFO-PROC-LETT,
volume = "83",
number = "6",
pages = "345--351",
day = "30",
month = sep,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:29 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Palmer:2002:TMQ,
author = "Chlo{\"e} Palmer",
title = "{Toshiba} makes Quantum Crypto Breakthrough",
journal = j-NETWORK-SECURITY,
volume = "2002",
number = "1",
pages = "6--6",
day = "1",
month = jan,
year = "2002",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(02)00115-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:25 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485802001150",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Park:2002:SRL,
author = "Sangwoo Park and Soo Hak Sung and Seongtaek Chee and
E-Joong Yoon and Jongin Lim",
title = "On the Security of {Rijndael}-Like Structures against
Differential and Linear Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "176--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010176.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010176.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Park:2002:XQP,
author = "Sangwon Park and Yoonra Choi and Hyoung-Joo Kim",
title = "{XML} Query Processing Using Signature and {DTD}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2455",
pages = "162--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:11:20 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2455.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2455/24550162.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2455/24550162.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Patiyoot:2002:MSE,
author = "D. Patiyoot",
title = "Migration \slash evolution of security towards
wireless {ATM}",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "23--30",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Patiyoot:2002:SIW,
author = "Danai Patiyoot",
title = "Security issues for wireless {ATM} networks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "1",
pages = "31--57",
month = jan,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Paulson:2002:NBPb,
author = "Linda Dailey Paulson",
title = "News Briefs: Project promises accessible technology
for the disabled; Two efforts aim to upgrade mobile
memory; New Haptics Approach Lets Parents-to-Be
``Touch'' their Unborn Children; Prime breakthrough may
improve encryption",
journal = j-COMPUTER,
volume = "35",
number = "10",
pages = "26--26",
month = oct,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:31:52 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2002/10/rx026.htm;
http://csdl.computer.org/dl/mags/co/2002/10/rx026.pdf;
http://www.cse.iitk.ac.in/news/primality.html",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "Manindra Agrawal; Neeraj Kayal; Nitin Saxena",
}
@Article{Paulson:2002:NBR,
author = "Linda Dailey Paulson",
title = "News Briefs: Researchers upgrade {Smart Card}
technology; New optical clock could synchronize chips;
Blind, deaf engineer develops computerized {Braille}
machine",
journal = j-COMPUTER,
volume = "35",
number = "12",
pages = "25--27",
month = dec,
year = "2002",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:31:54 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2002/12/rz025.htm;
http://csdl.computer.org/dl/mags/co/2002/12/rz025.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Pieprzyk:2002:CCI,
author = "Josef Pieprzyk and Xian-Mo Zhang",
title = "Constructions of Cheating Immune Secret Sharing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "226--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880226.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880226.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pieprzyk:2002:CPL,
author = "Josef Pieprzyk and Xian-Mo Zhang",
title = "Cheating Prevention in Linear Secret Sharing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "121--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840121.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840121.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pinkas:2002:CTP,
author = "Benny Pinkas",
title = "Cryptographic techniques for privacy-preserving data
mining",
journal = j-SIGKDD,
volume = "4",
number = "2",
pages = "12--19",
month = dec,
year = "2002",
CODEN = "????",
DOI = "https://doi.org/10.1145/772862.772865",
ISSN = "1931-0145 (print), 1931-0153 (electronic)",
ISSN-L = "1931-0145",
bibdate = "Sat Sep 17 11:06:15 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Research in secure distributed computation, which was
done as part of a larger body of research in the theory
of cryptography, has achieved remarkable results. It
was shown that non-trusting parties can jointly compute
functions of their different inputs while ensuring that
no party learns anything but the defined output of the
function. These results were shown using generic
constructions that can be applied to any function that
has an efficient representation as a circuit. We
describe these results, discuss their efficiency, and
demonstrate their relevance to privacy preserving
computation of data mining algorithms. We also show
examples of secure computation of data mining
algorithms that use these generic constructions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGKDD Explorations Newsletter",
}
@Book{Piper:2002:CVS,
author = "Fred Piper and Sean Murphy",
title = "Cryptography: a Very Short Introduction",
volume = "68",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "142",
year = "2002",
ISBN = "0-19-280315-8",
ISBN-13 = "978-0-19-280315-3",
LCCN = "Z103 .P56 2002",
bibdate = "Wed Jan 16 09:35:04 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 6.99",
series = "Very short introductions",
acknowledgement = ack-nhfb,
}
@Article{Piva:2002:MCW,
author = "Alessandro Piva and Franco Bartolini and Mauro Barni",
title = "Managing Copyright: Watermark and Cryptography
Algorithms",
journal = j-IEEE-DISTRIB-SYST-ONLINE,
volume = "3",
number = "5",
pages = "??--??",
year = "2002",
CODEN = "????",
ISSN = "1541-4922 (print), 1558-1683 (electronic)",
ISSN-L = "1541-4922",
bibdate = "Wed Oct 23 17:47:56 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dsonline.computer.org/0205/features/w3piva.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Distributed Systems Online",
}
@Article{Pointcheval:2002:PSP,
author = "David Pointcheval",
title = "Practical Security in Public-Key Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "1--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880001.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880001.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Pomerance:2002:SOC,
author = "Carl Pomerance and Igor E. Shparlinski",
title = "Smooth Orders and Cryptographic Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2369",
pages = "338--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:55 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2369.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2369/23690338.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2369/23690338.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Preneel:2002:NEA,
author = "Bart Preneel",
title = "{NESSIE}: a {European} Approach to Evaluate
Cryptographic Algorithms",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "267--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550267.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550267.pdf;
https://www.cosic.esat.kuleuven.be/publications/article-82.ps",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "NESSIE (New European Schemes for Signature, Integrity
and Encryption)",
}
@TechReport{Preneel:2002:NPT,
author = "Bart Preneel",
title = "The {NESSIE Project}: Towards New Cryptographic
Algorithms",
type = "Report",
number = "??",
institution = "Katholieke Univ. Leuven, Dept. Electrical
Engineering-ESAT, Kasteelpark Arenberg 10",
address = "B-3001 Leuven-Heverlee, Belgium",
day = "25",
month = nov,
year = "2002",
bibdate = "Fri Sep 23 06:29:35 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.stork.eu.org/papers/03_nessiev2.pdf",
abstract = "In spite of more than 25 years of open research on
cryptographic algorithms, many applications still use
insecure cryptography. This paper attempts to explain
this problem and tries to motivate why continuous
research in this area is required. It also discusses
the status of the NESSIE project. NESSIE (New European
Schemes for Signature, Integrity and Encryption) is a
40-month research project (2000--2003) which intends to
put forward a new generation of strong cryptographic
algorithms, which have been obtained after an open call
and an open evaluation process.",
acknowledgement = ack-nhfb,
keywords = "NESSIE (New European Schemes for Signature, Integrity
and Encryption)",
}
@Article{Quisquater:2002:CTM,
author = "Jean-Jacques Quisquater and Fran{\c{c}}ois-Xavier
Standaert and Gael Rouvroy and Jean-Pierre David and
Jean-Didier Legat",
title = "A Cryptanalytic Time-Memory Tradeoff: First {FPGA}
Implementation",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "780--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380780.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380780.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Reddy:2002:AAM,
author = "Prakash Reddy and Venky Krishnan and Kan Zhang and
Devaraj Das",
title = "Authentication and Authorization of Mobile Clients in
Public Data Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2437",
pages = "115--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2437.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2437/24370115.htm;
http://link.springer.de/link/service/series/0558/papers/2437/24370115.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Reyzin:2002:BTB,
author = "Leonid Reyzin and Natan Reyzin",
title = "Better than {BiBa}: Short One-Time Signatures with
Fast Signing and Verifying",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "144--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840144.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840144.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Riedl:2002:FSH,
author = "Reinhard Riedl and Nico Maibaum",
title = "{FASME} --- From {Smartcards} to Holistic
{IT}-Architectures for Interstate e-Government",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2456",
pages = "173--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:28 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2456.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2456/24560173.htm;
http://link.springer.de/link/service/series/0558/papers/2456/24560173.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Rila:2002:DAB,
author = "Luciano Rila",
title = "Denial of Access in Biometrics-Based Authentication
Systems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2437",
pages = "19--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:24 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2437.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2437/24370019.htm;
http://link.springer.de/link/service/series/0558/papers/2437/24370019.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Riley:2002:CBR,
author = "K. Jonathan Riley and John P. Eakins",
title = "Content-Based Retrieval of Historical Watermark
Images: {I}-tracings",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2383",
pages = "253--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2383.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2383/23830253.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2383/23830253.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Robinson:2002:LLE,
author = "Andrew Robinson",
title = "Lost languages: the enigma of the world's undeciphered
scripts",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
pages = "352",
year = "2002",
ISBN = "0-07-135743-2 (hardcover)",
ISBN-13 = "978-0-07-135743-2 (hardcover)",
LCCN = "P211 .R59 2002",
bibdate = "Sat Dec 17 17:34:43 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/mh041/2001051412.html;
http://www.loc.gov/catdir/description/mh021/2001051412.html;
http://www.loc.gov/catdir/toc/fy022/2001051412.html",
acknowledgement = ack-nhfb,
remark = "A Peter N. Nevraumont book.",
subject = "Writing; History; Extinct languages",
tableofcontents = "Acknowledgements 8\par
Introduction: Writing Systems, Coded Civilizations and
Undeciphered Scripts 10\par
Part I: Three Great Decipherments\par
I. Voices of the Pharaohs: Egyptian Hieroglyphs (Egypt)
50\par
II. The Labyrinth of Minos: LINEAR B (GREECE)
74\par
III. Bishop de Landa's Inquisition: Mayan Glyphs
(Central America) 104\par
Part II: Undeciphered Scripts\par
IV: Voices of the Black Pharaohs: The Meroitic Script
(Sudan) 140\par
V: Greek but not Greek: The Etruscan Alphabet (Italy)
156\par
VI: A Mediterranean Mystery: Linear A (the Aegean)
182\par
VII: Secrets of the Ancient Ledgers: The Proto-Elamite
Script (Iran) 200\par
VIII: Birdmen of Rapanui: Rongorongo (Easter Island)
218\par
IX: The New World Begins to Write: The Zapotec and
Isthmian Scripts (Mexico) 244\par
X: At the Sign of the Unicorn: The Indus Script
(Pakistan/India) 264\par
XI: Sir Arthur's ``Chaunt of Victory'': The Phaistos
Disc (Crete) 296\par
Conclusion\par
XII: The Urge to Decipher 316\par
Notes and References 324\par
Further Reading 334\par
Bibliography 335\par
Illustration Credits 341\par
Index 344.",
}
@Article{Roscoe:2002:TBC,
author = "Timothy Roscoe and Steven Hand",
title = "Transaction-Based Charging in Mnemosyne: a
Peer-to-Peer Steganographic Storage System",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2376",
pages = "335--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:15 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2376.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2376/23760335.htm;
http://link.springer.de/link/service/series/0558/papers/2376/23760335.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Roth:2002:JSA,
author = "Volker Roth",
title = "{Java} Security Architecture And Extensions",
journal = j-DDJ,
volume = "27",
number = "4",
pages = "34, 36--38",
month = apr,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Mar 5 07:08:41 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/ftp/2002/2002_04/jca.txt;
http://www.ddj.com/ftp/2002/2002_04/jca.zip",
abstract = "The Java Cryptography Architecture is a framework that
attempts to provide a common interface for accessing
basic cryptographic primitives. Additional resources
include jca.txt (listings) and jca.zip (source code).",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Rothe:2002:SFC,
author = "J{\"o}rg Rothe",
title = "Some facets of complexity theory and cryptography: a
five-lecture tutorial",
journal = j-COMP-SURV,
volume = "34",
number = "4",
pages = "504--549",
month = dec,
year = "2002",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/592642.592646",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:18:33 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this tutorial, selected topics of cryptology and of
computational complexity theory are presented. We give
a brief overview of the history and the foundations of
classical cryptography, and then move on to modern
public-key cryptography. Particular attention is paid
to cryptographic protocols and the problem of
constructing key components of protocols such as
one-way functions. A function is one-way if it is easy
to compute, but hard to invert. We discuss the notion
of one-way functions both in a cryptographic and in a
complexity-theoretic setting. We also consider
interactive proof systems and present some interesting
zero-knowledge protocols. In a zero-knowledge protocol,
one party can convince the other party of knowing some
secret information without disclosing any bit of this
information. Motivated by these protocols, we survey
some complexity-theoretic results on interactive proof
systems and related complexity classes.",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Complexity theory; interactive proof systems; one-way
functions; public-key cryptography; zero-knowledge
protocols",
}
@Manual{RSA:2002:PVR,
author = "{RSA Laboratories}",
title = "{PKCS \#1 v2.1}: {RSA} Cryptography Standard",
organization = pub-RSA,
address = pub-RSA:adr,
pages = "61",
day = "14",
month = jun,
year = "2002",
bibdate = "Mon Dec 08 08:16:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-1/index.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Rubin:2002:SAV,
author = "Karl Rubin and Alice Silverberg",
title = "Supersingular {Abelian} Varieties in Cryptology",
crossref = "Yung:2002:ACC",
pages = "336--353",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420336.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420336.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Russell:2002:HFU,
author = "Alexander Russell and Hong Wang",
title = "How to Fool an Unbounded Adversary with a Short Key",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "133--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320133.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320133.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Saeednia:2002:IBS,
author = "Shahrokh Saeednia",
title = "An identity-based society oriented signature scheme
with anonymous signers",
journal = j-INFO-PROC-LETT,
volume = "83",
number = "6",
pages = "295--299",
day = "30",
month = sep,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:29 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Saini:2002:JMD,
author = "S. P. Saini and F. Ahmad",
title = "{Java} Model of {DSA} ({Digital Signature
Algorithm})",
journal = j-IETE-TECH-REV,
volume = "19",
number = "4",
publisher = "Institute of Electronics \& Telecommunication",
pages = "189--194",
year = "2002",
CODEN = "ITREEI",
ISSN = "0256-4602",
ISSN-L = "0256-4602",
bibdate = "Tue Nov 19 09:39:05 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "IETE Technical Review",
}
@Article{Sakurai:2002:SMP,
author = "Kouichi Sakurai and Tsuyoshi Takagi",
title = "On the Security of a Modified {Paillier} Public-Key
Primitive",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "436--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840436.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840436.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Sarkar:2002:FCM,
author = "Palash Sarkar",
title = "The Filter-Combiner Model for Memoryless Synchronous
Stream Ciphers",
crossref = "Yung:2002:ACC",
pages = "533--548",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420533.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420533.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Satoh:2002:SHS,
author = "Akashi Satoh and Sumio Morioka",
title = "Small and High-Speed Hardware Architectures for the
{3GPP} Standard Cipher {KASUMI}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "48--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330048.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330048.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Schultz:2002:GBC,
author = "E. Eugene Schultz",
title = "The gap between cryptography and information
security",
journal = j-COMPUT-SECUR,
volume = "21",
number = "8",
pages = "674--676",
month = nov,
year = "2002",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404802008015",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Shahruz:2002:DNC,
author = "S. M. Shahruz and A. K. Pradeep and R. Gurumoorthy",
title = "Design of a novel cryptosystem based on chaotic
oscillators and feedback inversion",
journal = j-J-SOUND-VIB,
volume = "250",
number = "4",
pages = "762--771",
year = "2002",
CODEN = "JSVIAG",
ISSN = "0022-460X",
ISSN-L = "0022-460X",
MRclass = "94A60 (34C28 37N99)",
MRnumber = "1 893 980",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Journal of Sound and Vibration",
}
@InProceedings{Shapiro:2002:CCM,
author = "Jonathan S. Shapiro",
title = "{CPCMS}: a Configuration Management System Based on
Cryptographic Names",
crossref = "USENIX:2002:PFT",
pages = "??--??",
year = "2002",
bibdate = "Tue Oct 15 11:37:49 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix02/tech/freenix/shapiro.html",
acknowledgement = ack-nhfb,
}
@Article{Shelfer:2002:SCE,
author = "Katherine M. Shelfer and J. Drew Procaccino",
title = "Smart card evolution",
journal = j-CACM,
volume = "45",
number = "7",
pages = "83--88",
month = jul,
year = "2002",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Aug 1 07:05:18 MDT 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Shen:2002:NDW,
author = "Kuan-Ting Shen and Ling-Hwei Chen",
title = "A New Digital Watermarking Technique for Video",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2314",
pages = "269--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2314.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2314/23140269.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2314/23140269.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shigetomi:2002:ALS,
author = "Rie Shigetomi and Akira Otsuka and Takahide Ogawa and
Hideki Imai",
title = "An Anonymous Loan System Based on Group Signature
Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "244--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330244.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330244.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shimoyama:2002:BCS,
author = "Takeshi Shimoyama and Hitoshi Yanami and Kazuhiro
Yokoyama and Masahiko Takenaka and Kouichi Itoh and Jun
Yajima and Naoya Torii and Hidema Tanaka",
title = "The Block Cipher {SC2000}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2355",
pages = "312--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:48 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2355/23550312.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2355/23550312.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shimoyama:2002:MLC,
author = "Takeshi Shimoyama and Masahiko Takenaka and Takeshi
Koshiba",
title = "Multiple Linear Cryptanalysis of a Reduced Round
{RC6}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "76--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650076.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650076.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Shparlinski:2002:SMS,
author = "Igor E. Shparlinski",
title = "Security of most significant bits of $ g^{x^2} $",
journal = j-INFO-PROC-LETT,
volume = "83",
number = "2",
pages = "109--113",
day = "31",
month = jul,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:29 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "bit security; cryptography; Diffie--Hellman;
exponential sums; hidden number problem",
}
@Article{Shyamasundar:2002:ACP,
author = "R. K. Shyamasundar",
title = "Analyzing Cryptographic Protocols in a Reactive
Framework",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2294",
pages = "46--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:17 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2294.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2294/22940046.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2294/22940046.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Simon:2002:CRE,
author = "Denis Simon",
title = "Computing the rank of elliptic curves over number
fields",
journal = j-LMS-J-COMPUT-MATH,
volume = "5",
pages = "7--17",
year = "2002",
CODEN = "????",
ISSN = "1461-1570",
MRclass = "11Dxx (11Rxx 11Yxx)",
MRnumber = "1 916 919",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.lms.ac.uk/jcm/5/lms2000-006/",
fjournal = "LMS Journal of Computation and Mathematics",
}
@Book{Singh:2002:CBH,
author = "Simon Singh",
title = "The Code Book: How to Make It, Break It, Hack It, or
Crack It",
publisher = "Delacorte Press",
address = "New York, NY, USA",
pages = "263 (est.)",
year = "2002",
ISBN = "0-385-72913-8",
ISBN-13 = "978-0-385-72913-0",
LCCN = "TK5102.92 .S56 2002",
bibdate = "Sat Apr 20 12:33:48 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography",
tableofcontents = "1 The Cipher of Mary Queen of Scots 5\par
The birth of cryptography, the substitution cipher and
the invention of codebreaking by frequency
analysis\par
2 The Anonymous Codebreaker 51\par
The Vigen{\`e}re cipher, why cryptographers seldom get
credit for their breakthroughs and a tale of buried
treasure\par
3 The Mechanization of Secrecy 95\par
The Zimmermann telegram, the Enigma machine and how
cryptography changed the courses of World Wars I and
II\par
4 The Language Barrier 152\par
The impenetrability of unknown languages, the Navajo
code talkers of World War II and the decipherment of
Egyptian hieroglyphs\par
5 Alice and Bob Go Public 180\par
Modern cryptography, the solution to the so-called
key-distribution problem and the secret history of
nonsecret encryption\par
6 Pretty Good Privacy 221\par
The politics of privacy, the future of cryptography ---
and the quest for an uncrackable code.",
xxnote = "Check year: some catalogs have 2001, others 2002. See
also \cite{Singh:1999:CBE,Singh:2000:CBE}.",
}
@Article{Smeraldi:2002:SVF,
author = "Fabrizio Smeraldi and Josef Bigun and Wulfram
Gerstner",
title = "Support Vector Features and the Role of Dimensionality
in Face Authentication",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2388",
pages = "249--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:09 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2388.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2388/23880249.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2388/23880249.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Smith:2002:OAP,
author = "Sean W. Smith",
title = "Outbound Authentication for Programmable Secure
Coprocessors",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2502",
pages = "72--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:43 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2502.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2502/25020072.htm;
http://link.springer.de/link/service/series/0558/papers/2502/25020072.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Speed:2002:PIS,
author = "Timothy Speed and Juanita Ellis and Steffano Korper",
title = "The Personal {Internet} Security Guidebook: Keeping
Hackers and Crackers out of Your Home",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "xxiv + 202",
year = "2002",
ISBN = "0-12-656561-9",
ISBN-13 = "978-0-12-656561-4",
LCCN = "TK5105.59 .S6423 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.95",
series = "The Korper and Ellis e-commerce books series",
acknowledgement = ack-nhfb,
subject = "Internet; Security measures",
}
@Article{Srinathan:2002:ASC,
author = "K. Srinathan and M. V. N. Ashwin Kumar and C. Pandu
Rangan",
title = "Asynchronous Secure Communication Tolerating Mixed
Adversaries",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "224--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010224.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010224.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{Stallings:2002:CNS,
author = "William Stallings",
title = "Cryptography and network security: principles and
practice",
publisher = pub-PH,
address = pub-PH:adr,
edition = "Third",
pages = "696 (est.)",
year = "2002",
ISBN = "0-13-091429-0",
ISBN-13 = "978-0-13-091429-3",
LCCN = "",
bibdate = "Mon Oct 16 10:05:17 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "coding theory; computer networks --- security
measures; computer security; data encryption (computer
science)",
}
@Article{Standboge:2002:ENO,
author = "James Standboge",
title = "Encrypted {NFS} with {OpenSSH} and {Linux}",
journal = j-SYS-ADMIN,
volume = "11",
number = "3",
pages = "30, 32--34",
month = mar,
year = "2002",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Fri Feb 22 14:32:38 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.samag.com/",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Book{Stefanek:2002:ISB,
author = "George L. Stefanek",
title = "Information security best practices: 205 basic rules",
publisher = pub-NEWNES,
address = pub-NEWNES:adr,
pages = "xii + 194",
year = "2002",
ISBN = "1-878707-96-5",
ISBN-13 = "978-1-878707-96-3",
LCCN = "QA76.9.A25S744 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$29.95",
acknowledgement = ack-nhfb,
}
@Article{Steinfeld:2002:NSA,
author = "Ron Steinfeld and Joonsang Baek and Yuliang Zheng",
title = "On the Necessity of Strong Assumptions for the
Security of a Class of Asymmetric Encryption Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "241--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840241.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840241.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Stern:2002:FAP,
author = "Jacques Stern and David Pointcheval and John
Malone-Lee and Nigel P. Smart",
title = "Flaws in Applying Proof Methodologies to Signature
Schemes",
crossref = "Yung:2002:ACC",
pages = "93--110",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420093.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420093.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Book{Stinson:2002:CTP,
author = "Douglas R. (Douglas Robert) Stinson",
title = "Cryptography: theory and practice",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Second",
pages = "339",
year = "2002",
ISBN = "1-58488-206-9",
ISBN-13 = "978-1-58488-206-0",
LCCN = "QA268 .S75 2002",
bibdate = "Fri Mar 23 11:28:34 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "The CRC Press series on discrete mathematics and its
applications.",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography",
}
@Article{Stoll:2002:MMC,
author = "Michael Stoll and John E. Cremona",
title = "Minimal models for $2$-coverings of elliptic curves",
journal = j-LMS-J-COMPUT-MATH,
volume = "5",
pages = "220--??",
year = "2002",
CODEN = "????",
ISSN = "1461-1570",
bibdate = "Thu Jan 15 06:08:29 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.lms.ac.uk/jcm/5/lms2002-013/",
acknowledgement = ack-nhfb,
fjournal = "LMS Journal of Computation and Mathematics",
}
@Article{Strubinger:2002:HBS,
author = "Ray Strubinger",
title = "A Homegrown Backup Solution Utilizing {RSA} Keys,
{SSH}, and {\tt tar}",
journal = j-SYS-ADMIN,
volume = "11",
number = "4",
pages = "37--38",
month = apr,
year = "2002",
CODEN = "SYADE7",
ISSN = "1061-2688",
bibdate = "Tue Mar 19 18:37:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.samag.com/",
acknowledgement = ack-nhfb,
fjournal = "Sys admin: the journal for UNIX system
administrators",
}
@Article{Stubblebine:2002:ALF,
author = "S. G. Stubblebine and R. N. Wright",
title = "An authentication logic with formal semantics
supporting synchronization, revocation, and recency",
journal = j-IEEE-TRANS-SOFTW-ENG,
volume = "28",
number = "3",
pages = "256--285",
month = mar,
year = "2002",
CODEN = "IESEDJ",
DOI = "https://doi.org/10.1109/32.991320",
ISSN = "0098-5589 (print), 1939-3520 (electronic)",
ISSN-L = "0098-5589",
bibdate = "Thu Feb 1 11:00:42 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=991320",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Software Engineering",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32",
}
@Article{Sun:2002:IIR,
author = "Hung-Min Sun",
title = "Improving the information rate of a private-key
cryptosystem based on product codes",
journal = "Informatica (Vilnius)",
volume = "13",
number = "1",
pages = "105--110",
year = "2002",
ISSN = "0868-4952",
MRclass = "94A62",
MRnumber = "1 898 177",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Lithuanian Academy of Sciences. Informatica
(Vilnius)",
}
@Article{Sun:2002:NAD,
author = "Qi Sun and Qi Fan Zhang and Guo Hua Peng",
title = "A new algorithm for the {Dickson} polynomial {$ g_e(x,
1) $} public key cryptosystem",
journal = "Sichuan Daxue Xuebao",
volume = "39",
number = "1",
pages = "18--23",
year = "2002",
CODEN = "SCTHAO",
ISSN = "0490-6756",
MRclass = "94A60",
MRnumber = "2002k:94028",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Journal of Sichuan University. Natural Science
Edition. Sichuan Daxue Xuebao. Ziran Kexue Ban",
}
@Article{Sun:2002:WDC,
author = "Hung-Min Sun and Bor-Liang Chen",
title = "Weighted decomposition construction for perfect secret
sharing schemes",
journal = j-COMPUT-MATH-APPL,
volume = "43",
number = "6--7",
pages = "877--887",
month = mar # "\slash " # apr,
year = "2002",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122101003285",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Tada:2002:OSM,
author = "Mitsuru Tada",
title = "An Order-Specified Multisignature Scheme Secure
against Active Insider Attacks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "328--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840328.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840328.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Thien:2002:TSS,
author = "Chih-Ching Thien and Ja-Chen Lin",
title = "Technical Section: Secret image sharing",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "26",
number = "5",
pages = "765--770",
day = "??",
month = oct,
year = "2002",
CODEN = "COGRD2",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Fri Nov 22 09:29:36 MST 2002",
bibsource = "http://www.elsevier.com/locate/issn/00978493;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.elsevier.com/gej-ng/10/13/20/68/56/39/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Computers and Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Ting:2002:FBS,
author = "Kurt K. Ting and Steve C. L. Yuen and K. H. Lee and
Philip H. W. Leong",
title = "An {FPGA} Based {SHA}-256 Processor",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2438",
pages = "577--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:28 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24380577.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2438/24380577.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Topham:2002:BRJ,
author = "Jon Topham",
title = "Book Review: {James A. Secord, Victorian Sensation:
The Extraordinary Publication, Reception, and Secret
Authorship of Vestiges of the Natural History of
Creation. Chicago and London: University of Chicago
Press, 2001. Pp. xix + 624. ISBN 0-226-74410-8. \pounds
22.50, \$35.00 (hardcover)}",
journal = j-BRITISH-J-HIST-SCI,
volume = "35",
number = "3",
pages = "347--379",
month = sep,
year = "2002",
CODEN = "BJHSAT",
DOI = "https://doi.org/10.1017/S0007087402304783",
ISSN = "0007-0874 (print), 1474-001X (electronic)",
ISSN-L = "0007-0874",
bibdate = "Thu Sep 23 07:34:43 MDT 2010",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=BJH;
https://www.math.utah.edu/pub/tex/bib/bjhs2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "British Journal for the History of Science",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=BJH",
}
@Book{Trappe:2002:ICC,
author = "Wade Trappe and Lawrence C. Washington",
title = "Introduction to Cryptography with Coding Theory",
publisher = pub-PH,
address = pub-PH:adr,
pages = "xiii + 490",
year = "2002",
ISBN = "0-13-061814-4",
ISBN-13 = "978-0-13-061814-6",
LCCN = "QA268 .T73 2002",
bibdate = "Wed Jan 16 09:11:10 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 29.99",
acknowledgement = ack-nhfb,
keywords = "coding theory; cryptography",
}
@Article{Tsai:2002:SMS,
author = "Chwei-Shyong Tsai and Chin-Chen Chang and Tung-Shou
Chen",
title = "Sharing multiple secrets in digital images",
journal = j-J-SYST-SOFTW,
volume = "64",
number = "2",
pages = "163--170",
day = "15",
month = nov,
year = "2002",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:10 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Utami:2002:FID,
author = "Dewi Utami and Hadi Suwastio and Bambang Sumadjudin",
title = "{FPGA} Implementation of Digital Chaotic
Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2510",
pages = "239--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:47 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2510.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2510/25100239.htm;
http://link.springer.de/link/service/series/0558/papers/2510/25100239.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Vaudenay:2002:SFI,
author = "Serge Vaudenay",
title = "Security Flaws Induced by {CBC} Padding ---
Applications to {SSL}, {IPSEC}, {WTLS} \ldots{}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "534--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320534.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320534.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Vercauteren:2002:CZF,
author = "Frederik Vercauteren",
title = "Computing Zeta Functions of Hyperelliptic Curves over
Finite Fields of Characteristic $2$",
crossref = "Yung:2002:ACC",
pages = "369--384",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2442/24420369.htm;
http://link.springer.de/link/service/series/0558/papers/2442/24420369.pdf",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Book{Viega:2002:NSO,
author = "John Viega and Matt Messier and Pravir Chandra",
title = "Network Security with {OpenSSL}: Cryptography for
Secure Communications",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xiv + 367",
year = "2002",
ISBN = "0-596-00270-X",
ISBN-13 = "978-0-596-00270-1",
LCCN = "TK5105.59 .V54 2002",
bibdate = "Wed Oct 30 16:15:17 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.oreilly.com/catalog/prdindex.html",
price = "US\$39.95",
URL = "http://safari.oreilly.com/059600270X;
http://www.oreilly.com/catalog/openssl",
acknowledgement = ack-nhfb,
keywords = "computer network protocols; computer networks ---
security measures; OpenSSL",
publishersummary = "OpenSSL is a popular and effective open source
version of SSL/TLS, the most widely used protocol for
secure network communications. The only guide available
on the subject, Network Security with OpenSSL details
the challenges in securing network communications, and
shows you how to use OpenSSL tools to best meet those
challenges. Focused on the practical, this book
provides only the information that is necessary to use
OpenSSL safely and effectively.",
}
@Misc{Vixie:2002:SRR,
author = "Paul A. Vixie",
title = "Spam --- Roles and Responsibilities",
year = "2002",
bibdate = "Tue Oct 15 12:37:27 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
note = "Unpublished invited talk, BSDCON2002: Growing the BSD
Community, February 11--14, 2002, Cathedral Hill Hotel,
San Francisco, CA",
URL = "http://www.usenix.org/publications/library/proceedings/bsdcon02/tech.html",
abstract = "Protocols and practices designed for computer
scientists and members of the U.S. military are not
always a perfect fit for broad commercial use. So it is
in the case of e-mail, which has no practical
authentication, auditing, rate limiting, or security.
In this invited talk, Mr. Vixie will highlight some
common abuses of the e-mail protocols and explain the
roles and responsibilities of each party to such
abuse.",
acknowledgement = ack-nhfb,
}
@InProceedings{Wagner:2002:GBP,
author = "David Wagner",
title = "A Generalized Birthday Problem: (Extended Abstract)",
crossref = "Yung:2002:ACC",
pages = "288--303",
year = "2002",
bibdate = "Tue Apr 4 09:52:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2002; cryptography",
}
@Article{Wang:2002:AAB,
author = "Lusheng Wang and Zimao Li",
title = "An approximation algorithm for a bottleneck
$k$-{Steiner} tree problem in the {Euclidean} plane",
journal = j-INFO-PROC-LETT,
volume = "81",
number = "3",
pages = "151--156",
day = "14",
month = feb,
year = "2002",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 06:35:42 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
URL = "http://www.elsevier.com/gej-ng/10/23/20/85/34/32/abstract.html",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Wang:2002:CSE,
author = "Xiang Sheng Wang and Juan Ren Gan",
title = "A chaotic sequence encryption method",
journal = j-CHIN-J-COMPUTERS,
volume = "25",
number = "4",
pages = "351--356",
year = "2002",
CODEN = "JIXUDT",
ISSN = "0254-4164",
MRclass = "94A60 (37N99)",
MRnumber = "1 919 052",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
fjournal = "Chinese Journal of Computers. Jisuanji Xuebao",
}
@Article{Wang:2002:IPD,
author = "Xinyuan Wang and Douglas S. Reeves and S. Felix Wu",
title = "Inter-Packet Delay Based Correlation for Tracing
Encrypted Connections through Stepping Stones",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2502",
pages = "244--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:43 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2502.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2502/25020244.htm;
http://link.springer.de/link/service/series/0558/papers/2502/25020244.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wang:2002:WEM,
author = "Shiuh-Jeng Wang and Kai-Sheng Yang",
title = "Watermark Embedding Mechanism Using Modulus-Based for
Intellectual Property Protection on Image Data",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2455",
pages = "333--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:11:20 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2455.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2455/24550333.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2455/24550333.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Watanabe:2002:CCD,
author = "Yuji Watanabe and Masayuki Numao",
title = "Conditional Cryptographic Delegation for {P2P} Data
Sharing",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "309--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330309.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330309.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Misc{Wayman:2002:BAT,
author = "James L. Wayman",
booktitle = "11th USENIX Security Symposium 2002, August 5--9,
2002, San Francisco CA, Invited talk",
title = "Biometric Authentication Technologies: Hype Meets the
Test Results",
year = "2002",
bibdate = "Tue Oct 15 11:02:26 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
note = "Unpublished.",
URL = "http://www.usenix.org/publications/library/proceedings/sec02/tech.html",
abstract = "Biometric authentication is automatic identification
or identity verification based on behavioral and
physiological characteristics. Its potential for
securing financial transactions and controlling
physical access has been recognized for over 40 years,
but adoption has been considerably slower than
predicted. One reason for this has been the unrealistic
performance expectations placed on the technologies by
both vendors and users. This talk will discuss
biometric technologies and applications, performance
metrics, and the results of the last 10 years of pilot
projects and independent testing. We will explore what
has worked, what hasn't, and why, with particular
emphasis on the impact of biometrics on privacy.",
acknowledgement = ack-nhfb,
}
@Book{Wayner:2002:DCI,
author = "Peter Wayner",
title = "Disappearing cryptography: information hiding:
steganography \& watermarking",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
edition = "Second",
pages = "xvii + 413",
year = "2002",
ISBN = "1-55860-769-2",
ISBN-13 = "978-1-55860-769-9",
LCCN = "TK5105.59 .W39 2002",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.95",
acknowledgement = ack-nhfb,
}
@Article{Weber:2002:ECH,
author = "Arnd Weber",
title = "Enabling crypto: how radical innovations occur",
journal = j-CACM,
volume = "45",
number = "4",
pages = "103--107",
month = apr,
year = "2002",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Apr 9 14:09:15 MDT 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Weimerskirch:2002:DLW,
author = "Andr{\'e} Weimerskirch and Gilles Thonet",
title = "A Distributed Light-Weight Authentication Model for
Ad-hoc Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "341--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880341.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880341.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wernsdorf:2002:RFR,
author = "Ralph Wernsdorf",
title = "The Round Functions of {RIJNDAEL} Generate the
Alternating Group",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "143--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650143.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650143.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wincelberg:2002:LIE,
author = "David Wincelberg and Sy Wong and Dan Leach and Paul
Keister and Robert Masta",
title = "Letters: Inside {eBook} Security; Numerical Weather
Forecasting; {FrontPage EULA}; Priority Queues; Audio
Watermarking Versus Compression",
journal = j-DDJ,
volume = "27",
number = "3",
pages = "10--10",
month = mar,
year = "2002",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Feb 12 05:21:42 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Woodruff:2002:CUC,
author = "David P. Woodruff and Marten van Dijk",
title = "Cryptography in an Unbounded Computational Model",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2332",
pages = "149--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:37 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2332/23320149.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2332/23320149.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wright:2002:EPS,
author = "R. N. Wright and S. Spalding",
title = "Experimental Performance of Shared {RSA} Modulus
Generation",
journal = j-ALGORITHMICA,
volume = "33",
number = "1",
pages = "89--103",
month = jan,
year = "2002",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-001-0106-7",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "94A62 (68W15)",
MRnumber = "MR1888542",
bibdate = "Fri Jan 6 11:38:15 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=33&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
note = "Experimental algorithms",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=33&issue=1&spage=89",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Wu:2002:CAE,
author = "Tzong-Sun Wu and Chien-Lung Hsu",
title = "Convertible authenticated encryption scheme",
journal = j-J-SYST-SOFTW,
volume = "62",
number = "3",
pages = "205--209",
day = "15",
month = jun,
year = "2002",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:08 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wu:2002:CSCa,
author = "Hongjun Wu and Feng Bao",
title = "Cryptanalysis of Stream Cipher {COS$^{(2, 128)}$ Mode
I}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "154--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840154.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840154.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2002:CSCb,
author = "Hongjun Wu",
title = "Cryptanalysis of Stream Cipher {Alpha$1$}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "169--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840169.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840169.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Wu:2002:IBM,
author = "Tzong-Sun Wu and Chien-Lung Hsu",
title = "{ID}-based multisignatures with distinguished signing
authorities for sequential and broadcasting
architectures",
journal = j-APPL-MATH-COMP,
volume = "131",
number = "2--3",
pages = "349--356",
day = "25",
month = sep,
year = "2002",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:40:42 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Wu:2002:LCN,
author = "Wenling Wu and Dengguo Feng",
title = "Linear cryptanalysis of {NUSH} block cipher",
journal = "Sci. China Ser. F",
volume = "45",
number = "1",
pages = "59--67",
year = "2002",
ISSN = "1009-2757",
MRclass = "94A60",
MRnumber = "1 909 529",
bibdate = "Sat Oct 26 10:21:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
fjournal = "Science in China (Scientia Sinica). Series F.
Information Sciences",
}
@Article{Wyant:2002:APK,
author = "Jeremy Wyant",
title = "Applicability of Public Key Cryptosystems to Digital
Rights Management Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2339",
pages = "75--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:40 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2339.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2339/23390075.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2339/23390075.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Book{XXX:2002:CC,
author = "??",
title = "Codes Ciphers",
publisher = "Bounty Books",
address = "",
pages = "",
year = "2002",
ISBN = "0-7537-0220-7",
ISBN-13 = "978-0-7537-0220-8",
LCCN = "????",
bibdate = "Wed Jan 16 09:34:14 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 7.99",
acknowledgement = ack-nhfb,
}
@Article{Yanami:2002:DLC,
author = "Hitoshi Yanami and Takeshi Shimoyama and Orr
Dunkelman",
title = "Differential and Linear Cryptanalysis of a
Reduced-Round {SC2000}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2365",
pages = "34--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:52 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2365/23650034.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2365/23650034.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yang:2002:NEC,
author = "Ching-Nung Yang",
title = "A note on efficient color visual encryption",
journal = j-J-INFO-SCI-ENG,
volume = "18",
number = "3",
pages = "367--372",
year = "2002",
CODEN = "JINEEY",
ISSN = "1016-2364",
MRclass = "94A60",
MRnumber = "1 917 117",
bibdate = "Fri Oct 25 18:39:09 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
MathSciNet database",
note = "Data encryption and cryptography",
fjournal = "JISE. Journal of Information Science and Engineering",
}
@Article{Yeh:2002:SAK,
author = "Her-Tyan Yeh and Hung-Min Sun",
title = "Simple authenticated key agreement protocol resistant
to password guessing attacks",
journal = j-OPER-SYS-REV,
volume = "36",
number = "4",
pages = "14--22",
month = oct,
year = "2002",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Yen:2002:CAO,
author = "Sung-Ming Yen and Seungjoo Kim and Seongan Lim and
Sangjae Moon",
title = "A Countermeasure against One Physical Cryptanalysis
May Benefit Another Attack",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "414--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880414.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880414.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yen:2002:RSR,
author = "Sung-Ming Yen and Seungjoo Kim and Seongan Lim and
Sangjae Moon",
title = "{RSA} Speedup with Residue Number System Immune
against Hardware Fault Cryptanalysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "397--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880397.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880397.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yoo:2002:LAU,
author = "Hyejoung Yoo and Kwangsoo Lee and Sangjin Lee and
Jongin Lim",
title = "Off-Line Authentication Using Watermarks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2288",
pages = "200--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:14 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2288/22880200.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2288/22880200.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Yung:2002:CI,
author = "Moti Yung",
title = "Crypto-integrity",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "567--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010567.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010567.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2002:CRD,
author = "Fangguo Zhang and Shengli Liu and Kwangjo Kim",
title = "Compact Representation of Domain Parameters of
Hyperelliptic Curve Cryptosystems",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "203--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840203.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840203.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhang:2002:IBB,
author = "Fangguo Zhang and Kwangjo Kim",
title = "{ID}-Based Blind Signature and Ring Signature from
Pairings",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2501",
pages = "533--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 20:57:42 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.de/link/service/series/0558/bibs/2501/25010533.htm;
http://link.springer.de/link/service/series/0558/papers/2501/25010533.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhao:2002:EII,
author = "Xianfeng Zhao and Weinong Wang and Kefei Chen",
title = "Exploiting the Intrinsic Irreversibility of Adaptive
Technologies to Enhance the Security of Digital
Watermarking",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2419",
pages = "430--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:23 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2419.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2419/24190430.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2419/24190430.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zheng:2002:NPK,
author = "Jiande Zheng",
title = "A New Public Key Cryptosystem for Constrained
Hardware",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "334--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330334.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330334.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhou:2002:MVD,
author = "Jianying Zhou",
title = "Maintaining the Validity of Digital Signatures in
{B2B} Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2384",
pages = "303--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:02 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2384.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2384/23840303.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2384/23840303.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Zhu:2002:PAK,
author = "Feng Zhu and Duncan S. Wong and Agnes H. Chan and
Robbie Ye",
title = "Password Authenticated Key Exchange Based on {RSA} for
Imbalanced Wireless Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2433",
pages = "150--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:10:26 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2433.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2433/24330150.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2433/24330150.pdf",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@PhdThesis{Aamodt:2003:CSP,
author = "Ken S. Aamodt",
title = "A cryptographically secure pseudorandom number
generator",
type = "{Ph.D.} thesis",
school = "Purdue University",
address = "West Lafayette, IN, USA",
pages = "147",
month = dec,
year = "2003",
ISBN = "0-542-33216-7",
ISBN-13 = "978-0-542-33216-6",
bibdate = "Thu Jan 19 17:01:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://catalog.lib.purdue.edu/Find/Record/1380784;
http://search.proquest.com/docview/305316022?accountid=14677",
abstract = "We investigate a cryptographically secure pseudorandom
number generator based on a Linear Feedback Shift
Register (LFSR). The statistical properties of the
generator are examined, as well as its resistance to
cryptographic analysis. LFSRs are known to produce bit
streams that have excellent statistical properties.
However, they can be predicted by monitoring their
outputs briefly. Many approaches have been tried to
modify an LFSR output to preserve its statistical
properties but make it unpredictable. These techniques
work in a `stream-wise' manner; for each bit output
from the LFSR, one bit is output from the composite
generator. All of these approaches have fallen to
cryptanalysis. The technique used in this project
processes the output of an LFSR with a hash function,
converting blocks of M bits into smaller blocks of N
bits. Since the hash function maps many input blocks
into any given output block, there is no way of
determining the LFSR state by knowing the value of an
output block. The resulting generator was analyzed
using standard statistical tests for randomness, such
as chi-square tests on the distribution of blocks of
bits, autocovariance of the output bit stream, and the
Marsaglia `Die-Hard Battery' of statistical tests. The
Lempel-Ziv data-compression algorithm was used on the
output stream to try to discover any structure. In
addition, a cryptographic analysis technique, the
Berlekamp-Massey algorithm, was used to determine the
difficulty of predicting the generator's output.",
acknowledgement = ack-nhfb,
advisor = "Mark R. Bell",
}
@Misc{Adleman:2003:TLP,
author = "Leonard M. Adleman",
title = "{Turing Lecture} on Pre {RSA} Days",
howpublished = "World-Wide Web slide presentation, video, and audio.",
year = "2003",
bibdate = "Sat Nov 19 07:46:28 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/turingawardlecture/RSA/",
acknowledgement = ack-nhfb,
}
@InProceedings{Agrawal:2003:MCA,
author = "Dakshi Agrawal and Josyula R. Rao and Pankaj Rohatgi",
title = "Multi-channel Attacks",
crossref = "Walter:2003:CHE",
pages = "2--16",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Agrawal:2003:SWR,
author = "Rakesh Agrawal and Peter J. Haas and Jerry Kiernan",
title = "A system for watermarking relational databases",
crossref = "ACM:2003:PAS",
pages = "674--674",
year = "2003",
bibdate = "Fri Oct 31 08:03:18 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Agrawal:2003:WRD,
author = "Rakesh Agrawal and Peter J. Haas and Jerry Kiernan",
title = "Watermarking relational data: framework, algorithms
and analysis",
journal = j-VLDB-J,
volume = "12",
number = "2",
pages = "157--169",
month = aug,
year = "2003",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-003-0097-x",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Jun 23 10:51:06 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We enunciate the need for watermarking database
relations to deter data piracy, identify the
characteristics of relational data that pose unique
challenges for watermarking, and delineate desirable
properties of a watermarking system for relational
data. We then present an effective watermarking
technique geared for relational data. This technique
ensures that some bit positions of some of the
attributes of some of the tuples contain specific
values. The specific bit locations and values are
algorithmically determined under the control of a
secret key known only to the owner of the data. This
bit pattern constitutes the watermark. Only if one has
access to the secret key can the watermark be detected
with high probability. Detecting the watermark requires
access neither to the original data nor the watermark,
and the watermark can be easily and efficiently
maintained in the presence of insertions, updates, and
deletions. Our analysis shows that the proposed
technique is robust against various forms of malicious
attacks as well as benign updates to the data. Using an
implementation running on DB2, we also show that the
algorithms perform well enough to be used in real-world
applications.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "database; information hiding; steganography;
watermarking",
}
@Article{Aljifri:2003:ILA,
author = "Hassan Aljifri and Diego S{\'a}nchez Navarro",
title = "International legal aspects of cryptography:
Understanding cryptography",
journal = j-COMPUT-SECUR,
volume = "22",
number = "3",
pages = "196--203",
month = apr,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:51 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803003055",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Allen:2003:EST,
author = "Daniel R. Allen",
title = "Eleven {SSH} tricks",
journal = j-LINUX-J,
volume = "2003",
number = "112",
pages = "5--5",
month = aug,
year = "2003",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:45:48 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@MastersThesis{Andem:2003:CTE,
author = "Vikram Reddy Andem",
title = "A Cryptanalysis of the {Tiny Encryption Algorithm}",
type = "Master of Science",
school = "Department of Computer Science, The University of
Alabama",
address = "Tuscaloosa, AL, USA",
pages = "viii + 60",
year = "2003",
bibdate = "Tue Dec 27 14:06:46 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.5394",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:2003:NAW,
author = "Anonymous",
title = "Network armies in a world without secrets",
journal = j-NETWORK-SECURITY,
volume = "2003",
number = "3",
pages = "14--15",
month = mar,
year = "2003",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(03)00311-8",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485803003118",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2003:NUP,
author = "Anonymous",
title = "News 2.0: Uncrackable passwords; {WebFountain} drinks
down the {Web}; Embracing open source in {India}",
journal = j-QUEUE,
volume = "1",
number = "5",
pages = "8--8",
month = jul # "\slash " # aug,
year = "2003",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Sat Aug 23 11:00:11 2003",
bibsource = "http://www.acmqueue.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Article{Anonymous:2003:SEY,
author = "Anonymous",
title = "Secret enough for you?",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "4",
pages = "9--9",
month = apr,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1191775",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computer networks; Cryptography; Engineering
profession; File servers; Government; Internet;
National security; Network servers; Satellites; Space
technology",
}
@Article{Anonymous:2003:TMC,
author = "Anonymous",
title = "For {Taiwan}'s 22 million citizens, {Java Smart Cards}
are clamping down on health-care fraud",
journal = j-PC-MAGAZINE,
volume = "22",
number = "17",
pages = "66--67",
year = "2003",
CODEN = "PCMGEP",
ISSN = "0888-8507",
ISSN-L = "0888-8507",
bibdate = "Tue Sep 30 06:17:55 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "PC Magazine",
}
@Misc{Anonymous:2003:TMP,
author = "Anonymous",
title = "Table of {Mersenne} Primes",
year = "2003",
bibdate = "Wed Feb 06 15:22:23 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Mersenne primes are primes of the form $ M(n) = 2^p -
1 $. The known members of this set in order of
increasing $p$ (not of discovery), year of discovery,
and discoverer, are:
\begin{tabular}{rrll} \hline \boldmath $n$ & $p$ & {\bf
year} & {\bf discoverer} \\
\hline 1 & 2 & unknown & unknown \\
2 & 3 & unknown & unknown \\
3 & 5 & unknown & unknown \\
4 & 7 & unknown & unknown \\
5 & 13 & 1461 & Anonymous \\[1ex] 6 & 17 & 1588 & P. A.
Cataldi \\
7 & 19 & 1588 & P. A. Cataldi \\
8 & 31 & 1750 & L. Euler \\
9 & 61 & 1883 & I. M. Pervushin \\
10 & 89 & 1911 & R. E. Powers \\[1ex] 11 & 107 & 1913 &
E. Fauquembergue \\
12 & 127 & 1876 & E. Lucas \\
13 & 521 & 1952 & R. M. Robinson \\
14 & 607 & 1952 & R. M. Robinson \\
15 & 1279 & 1952 & R. M. Robinson \\[1ex] 16 & 2203 &
1952 & R. M. Robinson \\
17 & 2281 & 1952 & R. M. Robinson \\
18 & 3217 & 1957 & H. Riesel \\
19 & 4253 & 1961 & A. Hurwitz \\
20 & 4423 & 1961 & A. Hurwitz \\[1ex] 21 & 9689 & 1963
& D. B. Gillies \\
22 & 9941 & 1963 & D. B. Gillies \\
23 & 11213 & 1963 & D. B. Gillies \\
24 & 19937 & 1971 & B. Tuckerman \\
25 & 21701 & 1978 & L. C. Noll \& L. Nickel \\[1ex] 26
& 23209 & 1979 & L. C. Noll \\
27 & 44497 & 1979 & H. Nelson \& D. Slowinski \\
28 & 86243 & 1982 & D. Slowinski \\
29 & 110503 & 1988 & W. N. Colquitt \& L. Welsch, Jr.
\\
30 & 132049 & 1983 & D. Slowinski \\[1ex] 31 & 216091 &
1985 & D. Slowinski \\
32 & 756839 & 1992 & Slowinski \& Gage \\
33 & 859433 & 1994 & Slowinski \& Gage \\
34 & 1257787 & 1996 & Slowinski \& Gage \\
35 & 1398269 & 1996 & Armengaud et al. (GIMPS)\\[1ex]
36 & 2976221 & 1997 & Spence et al. (GIMPS)\\
37 & 3021377 & 1998 & Clarkson, Woltman, Kurowski, and
Slowinski (GIMPS) \\
38 & 6972593 & 1999 & Hajratwala et al. (GIMPS) \\
39 & 13466917 & 2001 & M. Cameron (GIMPS) \\
40 & 20996011 & 2003 & M. Shafer (GIMPS) \\[1ex] 41 &
24036583 & 2004 & Josh Findley (GIMPS) \\
42 & 25964951 & 2005 & Martin Nowak (GIMPS) \\
43 & 30402457 & 2005 & Curtis Cooper \& Steven Boone
(GIMPS) \\
44 & 32582657 & 2006 & Curtis Cooper \& Steven Boone
(GIMPS) \\
45 & 37156667 & 2008 & Hans-Michael Elvenich, George
Woltman, Scott Kurowski (GIMPS) \\
46 & 42643801 & 2009 & Odd Magnar Strindmo (GIMPS) \\
47 & 43112609 & 2008 & Edson Smith, George Woltman,
Scott Kurowski (GIMPS) \\
48 & 57885161 & 2013 & Curtis Cooper, George Woltman,
Scott Kurowski, and others \\
49 & 74207281 & 2016 & Curtis Cooper (GIMPS) \\
50 & 77232917 & 2017 & Jon Pace (GIMPS) \\
51 (??) & 82589933 & 2018 & P. Laroche, G. Woltman, A. Blosser, et al. (GIMPS) \\
\hline
\end{tabular}",
URL = "http://mathworld.wolfram.com/MersennePrime.html;
http://primes.utm.edu/mersenne/;
http://primes.utm.edu/top20/page.php?id=4;
http://www.computerworld.com/s/article/9236570/Mathematician_Finding_17M_digit_prime_number_like_climbing_Everest;
http://www.mersenne.org/;
http://www.mersenne.org/prime.htm;
http://www.mersenne.org/report_milestones/;
http://www.mersenne.org/various/57885161.htm;
http://www.perfsci.com/wall-art.asp;
http://www.utm.edu/research/primes/mersenne/index.html;
http://www.utm.edu/research/primes/notes/3021377/",
acknowledgement = ack-nhfb,
keywords = "Marin Mersenne (1588--1648)",
remark = "In \cite[p. 429]{Metropolis:1980:HCT}, Harry D. Huskey
writes about the National Bureau of Standards Western
Automatic Computer (SWAC) (1950--1967): ``One of the
exciting problems in mathematics on which the SWAC
worked was the study of Mersenne numbers, that is,
numbers of the form $ 2^p - 1 $, where $p$ is a prime.
These numbers, when prime, are related to the `perfect
numbers' of the Greeks, numbers that are the sum of all
their integral divisors, excluding themselves. The list
of values of $p$ that yielded prime numbers up to that
time was $ p = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89 $,
and $ 107 $. Everyone was greatly excited when SWAC
added $ 521 $ to the list, and there was a real
celebration when $ 607 $ was added about an hour later.
In all, by June 1953, five values [$ 521, 607, 1279,
2203, 2281 $ ] had been added to the list with the use
of the SWAC as a result of systematic testing of all
primes up to $ 2297 $.'' Raphael M. Robinson's work
appears in `Mersenne and Fermat Numbers', Proc. Amer.
Math. Soc., v. 5, 1954, pp. 842--846
(http://www.ams.org/journals/proc/1954-005-05/S0002-9939-1954-0064787-4/S0002-9939-1954-0064787-4.pdf).
He reports ``At that time, the total memory of the SWAC
consisted of 256 words of 36 binary digits each,
exclusive of the sign. For the Mersenne test, half of
this memory was reserved for commands. Since successive
squarings of numbers less than the modulus $ 2^n - 1 $
are required, this modulus was restricted to 64 words,
so that the condition $ w < 64 *36 = 2304 $ was
imposed. The estimated running time for the program was
$ 0.25 n^3 + 125 n^2 $ microseconds, and the actual
time was in fair agreement with this. Thus, roughly
speaking, the testing time was a minute for the first
and an hour for the last of the five new primes. Each
minute of machine time is equivalent to more than a
year's work for a person using a desk calculator.''",
}
@Article{Anonymous:2003:UCD,
author = "Anonymous",
title = "Unravelling Crypto Developments: {Dr Nicko van
Someren}, founder and {CTO} of {nCipher}, sorts out
fact from fiction when it comes to quantum encryption",
journal = j-NETWORK-SECURITY,
volume = "2003",
number = "9",
pages = "7--8",
month = sep,
year = "2003",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(03)00906-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:50 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485803009061",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2003:YCS,
author = "Anonymous",
title = "Is your Current Security {SECURE}?: {John Jessop},
{Cryptic Software}",
journal = j-NETWORK-SECURITY,
volume = "2003",
number = "4",
pages = "3--3",
month = apr,
year = "2003",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(03)00406-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:44 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485803004069",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Armknecht:2003:AAC,
author = "Frederik Armknecht and Matthias Krause",
title = "Algebraic Attacks on Combiners with Memory",
crossref = "Boneh:2003:ACC",
pages = "162--175",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Ashburn:2003:PBA,
author = "Julian Ashburn",
title = "Practical Biometrics: From Aspiration to
Implementation",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 159",
year = "2003",
ISBN = "1-85233-774-5",
ISBN-13 = "978-1-85233-774-2",
LCCN = "TK7882.B56A84 2003",
bibdate = "Tue Jun 01 13:47:04 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
xxnote = "Check copyright year: some catalogs have 2004, but
U.S. Library of Congress say 2003.",
}
@Article{Augot:2003:PKE,
author = "Daniel Augot and Matthieu Finiasz",
title = "A Public Key Encryption Scheme Based on the Polynomial
Reconstruction Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "229--240",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_14.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Avanzi:2003:CAD,
author = "Roberto M. Avanzi",
title = "Countermeasures against Differential Power Analysis
for Hyperelliptic Curve Cryptosystems",
crossref = "Walter:2003:CHE",
pages = "366--381",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Backhouse:2003:TOT,
author = "James Backhouse and Carol Hsu and Aidan McDonnell",
title = "Technical opinion: Toward public-key infrastructure
interoperability",
journal = j-CACM,
volume = "46",
number = "6",
pages = "98--100",
month = jun,
year = "2003",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Sep 3 17:06:36 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Bajard:2003:EMG,
author = "J.-C. Bajard and L. Imbert and C. Negre and T.
Plantard",
title = "Efficient multiplication in {GF}$ (p_k) $ for Elliptic
Curve Cryptography",
crossref = "Bajard:2003:ISC",
pages = "181--187",
year = "2003",
bibdate = "Wed Nov 26 12:04:35 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Barak:2003:DC,
author = "Boaz Barak and Shien Jin Ong and Salil Vadhan",
title = "Derandomization in Cryptography",
crossref = "Boneh:2003:ACC",
pages = "299--315",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Barak:2003:TRN,
author = "Boaz Barak and Ronen Shaltiel and Eran Tromer",
title = "True Random Number Generators Secure in a Changing
Environment",
crossref = "Walter:2003:CHE",
pages = "166--180",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Barbancho:2003:CAC,
author = "A. M. Barbancho and A. Peinado",
title = "Cryptanalysis of anonymous channel protocol for
large-scale area in wireless communications",
journal = j-COMP-NET-AMSTERDAM,
volume = "43",
number = "6",
pages = "777--785",
day = "20",
month = dec,
year = "2003",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Feb 9 06:35:22 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InProceedings{Barkan:2003:ICO,
author = "Elad Barkan and Eli Biham and Nathan Keller",
title = "Instant Ciphertext-Only Cryptanalysis of {GSM}
Encrypted Communication",
crossref = "Boneh:2003:ACC",
pages = "600--616",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Barken:2003:HSY,
author = "Lee Barken",
title = "How Secure is Your Wireless Network? {Safeguarding}
Your {Wi-Fi LAN}",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "xx + 199",
year = "2003",
ISBN = "0-13-140206-4",
ISBN-13 = "978-0-13-140206-5",
LCCN = "QA76.9.A25B3775 2003",
bibdate = "Tue Nov 04 17:51:59 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$34.99",
acknowledgement = ack-nhfb,
}
@Article{Basu:2003:AC,
author = "Amit Basu and Steve Muylle",
title = "Authentication in e-commerce",
journal = j-CACM,
volume = "46",
number = "12",
pages = "159--166",
month = dec,
year = "2003",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jan 5 16:48:14 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
remark = "Web version only (not in printed issue).",
}
@Article{Bauer:2003:PPAa,
author = "Mick Bauer",
title = "Paranoid penguin: Authenticate with {LDAP}",
journal = j-LINUX-J,
volume = "2003",
number = "112",
pages = "12--12",
month = aug,
year = "2003",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:45:48 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Bauer:2003:PPAb,
author = "Mick Bauer",
title = "Paranoid penguin: Authenticate with {LDAP}, {Part
III}",
journal = j-LINUX-J,
volume = "2003",
number = "113",
pages = "13--13",
month = sep,
year = "2003",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:45:49 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Bellare:2003:FSP,
author = "Mihir Bellare and Bennet Yee",
title = "Forward-Security in Private-Key Cryptography",
crossref = "Joye:2003:TCC",
pages = "1--18",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@InProceedings{Berson:2003:CAB,
author = "Tom Berson",
title = "Cryptography after the Bubble: How to Make an Impact
on the World",
crossref = "Joye:2003:TCC",
pages = "226--226",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@InProceedings{Bertoni:2003:EAA,
author = "Guido Bertoni and Jorge Guajardo and Sandeep Kumar and
Gerardo Orlando and Christof Paar and Thomas
Wollinger",
title = "Efficient $ {GF}(p^m) $ Arithmetic Architectures for
Cryptographic Applications",
crossref = "Joye:2003:TCC",
pages = "158--175",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Bertoni:2003:EAD,
author = "G. Bertoni and L. Breveglieri and I. Koren and P.
Maistri and V. Piuri",
title = "Error analysis and detection procedures for a hardware
implementation of the advanced encryption standard",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "492--505",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190590",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:47 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190590",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Book{Bidgoli:2003:EIS,
editor = "Hossein Bidgoli",
title = "Encyclopedia of information systems",
publisher = pub-ACADEMIC,
address = pub-ACADEMIC:adr,
pages = "various",
year = "2003",
ISBN = "0-12-227240-4",
ISBN-13 = "978-0-12-227240-0",
LCCN = "QA76.15 .E516 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Four volumes.",
price = "US\$1,200.00",
acknowledgement = ack-nhfb,
}
@InProceedings{Biryukov:2003:CS,
author = "Alex Biryukov and Christophe {De Canni{\`e}re} and
Gustaf Dellkrantz",
title = "Cryptanalysis of {Safer++}",
crossref = "Boneh:2003:ACC",
pages = "195--211",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Bishop:2003:CSA,
author = "Matt Bishop",
title = "Computer Security: Art and Science",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xli + 1084",
year = "2003",
ISBN = "0-201-44099-7 (hardcover)",
ISBN-13 = "978-0-201-44099-7 (hardcover)",
LCCN = "QA76.9.A25 B56 2002",
bibdate = "Wed Dec 31 13:50:12 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
price = "US\$79.99, CAN\$120.99",
abstract = "This book has three goals. The first is to show the
importance of theory to practice and of practice to
theory. The second goal is to emphasize that computer
security and cryptography are different. Although
cryptography is an essential component of computer
security, it is by no means the only component. The
third goal is to demonstrate that computer security is
not just a science but also an art. It is an art
because no system can be considered secure without an
examination of how it is to be used. Computer security
is also a science. Its theory is based on mathematical
constructions, analyses, and proofs. Its systems are
built in accordance with the accepted practices of
engineering. The material in this book is at the
advanced undergraduate level. Throughout, [the authors]
assume that the reader is familiar with the basics of
compilers and computer architecture (such as the use of
the program stack) and operating systems. The reader
should also be comfortable with modular arithmetic (for
the material on cryptography).",
acknowledgement = ack-nhfb,
tableofcontents = "Part 1: Introduction \\
1: An overview of computer security \\
Part 2: Foundations \\
2: Access control matrix \\
3: Foundational results \\
Part 3: Policy \\
4: Security policies \\
5: Confidentiality policies \\
6: Integrity policies \\
7: Hybrid policies \\
8: Noninterference and policy composition \\
Part 4: Implementation I: cryptography \\
9: Basic cryptography \\
10: Key management \\
11: Cipher techniques \\
12: Authentication \\
Part 5: Implementation II: systems \\
13: Design principles \\
14: Representing identity \\
15: Access control mechanisms \\
16: Information flow \\
17: Confinement problem \\
Part 6: Assurance / by Elisabeth Sullivan \\
18: Introduction to assurance \\
19: Building systems with assurance \\
20: Formal methods \\
21: Evaluating systems \\
Part 7: Special topics \\
22: Malicious logic \\
23: Vulnerability analysis \\
24: Auditing \\
25: Intrusion detection \\
Part 8: Practicum \\
26: Network security \\
27: System security \\
28: User security \\
29: Program security \\
Part 9: End matter \\
30: Lattices \\
31: The extended Euclidean algorithm \\
32: Entropy and uncertainty \\
33: Virtual machines \\
34: Symbolic logic \\
35: Example academic security policy",
}
@Book{Bishop:2003:ICJ,
author = "David Bishop",
title = "Introduction to cryptography with {Java} applets",
publisher = pub-JONES-BARTLETT,
address = pub-JONES-BARTLETT:adr,
pages = "xvi + 370",
year = "2003",
ISBN = "0-7637-2207-3",
ISBN-13 = "978-0-7637-2207-4",
LCCN = "QA76.9.A25 B565 2003",
bibdate = "Tue Oct 11 05:14:14 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; Java (Computer
program language)",
}
@InProceedings{Blomer:2003:NPK,
author = "Johannes Bl{\"o}mer and Alexander May",
title = "New Partial Key Exposure Attacks on {RSA}",
crossref = "Boneh:2003:ACC",
pages = "27--43",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Blum:2003:NTL,
author = "Avrim Blum and Adam Kalai and Hal Wasserman",
title = "Noise-tolerant learning, the parity problem, and the
statistical query model",
journal = j-J-ACM,
volume = "50",
number = "4",
pages = "506--519",
month = jul,
year = "2003",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/792538.792543",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Sep 8 17:55:23 MDT 2003",
bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
abstract = "We describe a slightly subexponential time algorithm
for learning parity functions in the presence of random
classification noise, a problem closely related to
several cryptographic and coding problems. Our
algorithm runs in polynomial time for the case of
parity functions that depend on only the first $ O(\log
n \log \log n) $ bits of input, which provides the
first known instance of an efficient noise-tolerant
algorithm for a concept class that is not learnable in
the Statistical Query model of Kearns [1998]. Thus, we
demonstrate that the set of problems learnable in the
statistical query model is a strict subset of those
problems learnable in the presence of noise in the PAC
model.\par
In coding-theory terms, what we give is a poly(n)-time
algorithm for decoding linear $ k \times n $ codes in
the presence of random noise for the case of $ k = c
\log n \log \log n $ for some $ c > 0 $. (The case of $
k = O(\log n) $ is trivial since one can just
individually check each of the $ 2^k $ possible
messages and choose the one that yields the closest
codeword.)\par
A natural extension of the statistical query model is
to allow queries about statistical properties that
involve $t$-tuples of examples, as opposed to just
single examples. The second result of this article is
to show that any class of functions learnable (strongly
or weakly) with $t$-wise queries for $ t = O(\log n) $
is also weakly learnable with standard unary queries.
Hence, this natural extension to the statistical query
model does not increase the set of weakly learnable
functions.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Blundo:2003:COT,
author = "C. Blundo and P. D'Arco and A. {De Santis} and D. R.
Stinson",
title = "Contrast Optimal Threshold Visual Cryptography
Schemes",
journal = j-SIAM-J-DISCR-MATH,
volume = "16",
number = "2",
pages = "224--261",
year = "2003",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480198336683",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Wed Aug 20 06:47:26 MDT 2003",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/16/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/33668",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@Book{Bolle:2003:GB,
author = "Ruud Bolle and Jonathan Connell and Sharatchandra
Pankanti and Nalini Ratha and Andrew Senior",
title = "Guide to biometrics",
publisher = pub-SV,
address = pub-SV:adr,
pages = "335 (est.)",
year = "2003",
ISBN = "0-387-40089-3",
ISBN-13 = "978-0-387-40089-1",
LCCN = "TK7882.B56 G85 2003",
bibdate = "Fri Mar 05 18:23:51 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
}
@TechReport{Bond:2003:DTA,
author = "Mike Bond and Piotr Zieli{\'n}ski",
title = "Decimalisation table attacks for {PIN} cracking",
type = "Technical Report",
number = "560",
institution = "University of Cambridge Computer Laboratory",
address = "Cambridge, UK",
pages = "14",
month = feb,
year = "2003",
ISSN = "1476-2986",
bibdate = "Mon Mar 17 11:28:13 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-560.pdf",
acknowledgement = ack-nhfb,
}
@Article{Boneh:2003:AVE,
author = "Dan Boneh and Craig Gentry and Ben Lynn and Hovav
Shacham",
title = "Aggregate and Verifiably Encrypted Signatures from
Bilinear Maps",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "416--432",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_26",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_26.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Boneh:2003:IBE,
author = "Dan Boneh and Matthew Franklin",
title = "Identity-Based Encryption from the {Weil} Pairing",
journal = j-SIAM-J-COMPUT,
volume = "32",
number = "3",
pages = "586--615",
month = jun,
year = "2003",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539701398521",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Wed Aug 20 06:43:35 MDT 2003",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/32/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/39852",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Boneh:2003:SSS,
author = "Dan Boneh and Ilya Mironov and Victor Shoup",
title = "A Secure Signature Scheme from Bilinear Maps",
crossref = "Joye:2003:TCC",
pages = "98--110",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Bouda:2003:EQI,
author = "Jan Bouda and Vladim{\'\i}r R. Bu{\v{z}}ek",
title = "Encryption of Quantum Information",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "14",
number = "5",
pages = "741--??",
month = oct,
year = "2003",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Jan 27 08:06:53 MST 2004",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@InProceedings{Bouganim:2003:CSD,
author = "Luc Bouganim and Fran{\c{c}}ois Dang Ngoc and Philippe
Pucheral and Lilan Wu",
title = "Chip-Secured Data Access: Reconciling Access Rights
with Data Encryption",
crossref = "Freytag:2003:VPI",
pages = "1133--1136",
year = "2003",
bibdate = "Mon Dec 22 18:34:17 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb2003.html",
URL = "http://www.vldb.org/dblp/db/indices/a-tree/b/Bouganim:Luc.html",
acknowledgement = ack-nhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/b/Bouganim:Luc.html;
http://www.vldb.org/dblp/db/indices/a-tree/n/Ngoc:Fran=ccedil=ois_Dang.html;
http://www.vldb.org/dblp/db/indices/a-tree/p/Pucheral:Philippe.html;
http://www.vldb.org/dblp/db/indices/a-tree/w/Wu:Lilan.html",
}
@Article{Bourbakis:2003:SBC,
author = "Nikolaos Bourbakis and Apostolos Dollas",
title = "{SCAN}-Based Compression-Encryption-Hiding for Video
on Demand",
journal = j-IEEE-MULTIMEDIA,
volume = "10",
number = "3",
pages = "79--87",
month = jul # "--" # sep,
year = "2003",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2003.1218259",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Jan 3 12:43:03 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/mu/2003/03/u3079abs.htm;
http://csdl.computer.org/dl/mags/mu/2003/03/u3079.htm;
http://csdl.computer.org/dl/mags/mu/2003/03/u3079.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Book{Boyd:2003:PAK,
author = "Colin Boyd and Anish Mathuria",
title = "Protocols for Authentication and Key Establishment",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxiv + 323",
year = "2003",
DOI = "https://doi.org/10.1007/978-3-662-09527-0",
ISBN = "3-662-09527-0 (e-book), 3-642-07716-1",
ISBN-13 = "978-3-662-09527-0 (e-book), 978-3-642-07716-6",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25",
bibdate = "Sat Jun 10 08:35:20 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/978-3-662-09527-0",
abstract = "Protocols for authentication and key establishment are
the foundation for security of communications. The
range and diversity of these protocols is immense,
while the properties and vulnerabilities of different
protocols can vary greatly. This is the first
comprehensive and integrated treatment of these
protocols. It allows researchers and practitioners to
quickly access a protocol for their needs and become
aware of existing protocols which have been broken in
the literature. As well as a clear and uniform
presentation of the protocols this book includes a
description of all the main attack types and classifies
most protocols in terms of their properties and
resource requirements. It also includes tutorial
material suitable for graduate students.",
acknowledgement = ack-nhfb,
subject = "Authentifikation; Schl{\"u}sselverwaltung;
Kommunikationsprotokoll; Datensicherung;
Diffie--Hellman-Algorithmus; Computer science; Computer
Communication Networks; Data protection; Data
encryption (Computer science); Computer software",
tableofcontents = "A Tutorial Introduction to Authentication and Key
Establishment \\
Goals for Authentication and Key Establishment \\
Protocols Using Shared Key Cryptography.-Authentication
and Key Transport Using Public Key Cryptography \\
Key Agreement Protocols \\
Conference Key Protocols \\
Password-Based Protocols \\
Appendix A \\
Standards for Authentication and Key Establishment \\
Appendix B \\
Summary of Notation \\
References \\
Index of Protocols \\
General Index",
}
@InProceedings{Boyen:2003:MIB,
author = "Xavier Boyen",
title = "Multipurpose Identity-Based Signcryption: a {Swiss
Army} Knife for Identity-Based Cryptography",
crossref = "Boneh:2003:ACC",
pages = "383--399",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Bucci:2003:HSO,
author = "M. Bucci and L. Germani and R. Luzzi and A. Trifiletti
and M. Varanonuovo",
title = "A high-speed oscillator-based truly random number
source for cryptographic applications on a smart card
{IC}",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "403--409",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190581",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190581",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Buchbinder:2003:LUB,
author = "Niv Buchbinder and Erez Petrank",
title = "Lower and Upper Bounds on Obtaining History
Independence",
crossref = "Boneh:2003:ACC",
pages = "445--462",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Burr:2003:SAE,
author = "William E. Burr",
title = "Selecting the {Advanced Encryption Standard}",
journal = j-IEEE-SEC-PRIV,
volume = "1",
number = "2",
pages = "43--52",
month = mar # "\slash " # apr,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSECP.2003.1193210",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Apr 3 19:00:16 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/sp/books/sp2003/pdf/j2043.pdf;
http://www.computer.org/security/j2043abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@InProceedings{Camenisch:2003:PVE,
author = "Jan Camenisch and Victor Shoup",
title = "Practical Verifiable Encryption and Decryption of
Discrete Logarithms",
crossref = "Boneh:2003:ACC",
pages = "126--144",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Canetti:2003:FSP,
author = "Ran Canetti and Shai Halevi and Jonathan Katz",
title = "A Forward-Secure Public-Key Encryption Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "255--271",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_16",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_16.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Canetti:2003:RCC,
author = "Ran Canetti and Hugo Krawczyk and Jesper B. Nielsen",
title = "Relaxing Chosen-Ciphertext Security",
crossref = "Boneh:2003:ACC",
pages = "565--582",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Canetti:2003:UCJ,
author = "Ran Canetti and Tal Rabin",
title = "Universal Composition with Joint State",
crossref = "Boneh:2003:ACC",
pages = "265--281",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Canvel:2003:PIS,
author = "Brice Canvel and Alain Hiltgen and Serge Vaudenay and
Martin Vuagnoux",
title = "Password Interception in a {SSL\slash TLS} Channel",
crossref = "Boneh:2003:ACC",
pages = "583--599",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Cary:2003:MAC,
author = "Matthew Cary and Ramarathnam Venkatesan",
title = "A Message Authentication Code Based on Unimodular
Matrix Groups",
crossref = "Boneh:2003:ACC",
pages = "500--512",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Cass:2003:LES,
author = "Stephen Cass",
title = "Listening in [electronic spying]",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "4",
pages = "32--37",
month = apr,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1191772",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "bugging devices; cloak-and-dagger information
gathering; code-breaking computers; communications
systems; cryptography; Data security; data security
measures; electronic spying; fiber-optic cables;
receivers; security of data; software flaws;
telecommunication security",
}
@InProceedings{Cathalo:2003:NTT,
author = "Julien Cathalo and Fran{\c{c}}ois Koeune and
Jean-Jacques Quisquater",
title = "A New Type of Timing Attack: Application to {GPS}",
crossref = "Walter:2003:CHE",
pages = "291--303",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Chen:2003:AEY,
author = "Ke-Fei Chen and Sheng Zhong",
title = "Attacks on the (enhanced) {Yang--Shieh}
authentication",
journal = j-COMPUT-SECUR,
volume = "22",
number = "8",
pages = "725--727",
month = dec,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See erratum \cite{McKenna:2004:EAE}.",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803000129",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Cheng:2003:PPO,
author = "Qi Cheng",
title = "Primality Proving via One Round in {ECPP} and One
Iteration in {AKS}",
crossref = "Boneh:2003:ACC",
pages = "338--348",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Cheon:2003:PTA,
author = "Jung Hee Cheon and Byungheup Jun",
title = "A Polynomial Time Algorithm for the Braid
{Diffie--Hellman} Conjugacy Problem",
crossref = "Boneh:2003:ACC",
pages = "212--225",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Chevallier-Mames:2003:FDS,
author = "Beno{\^\i}t Chevallier-Mames and Marc Joye and Pascal
Paillierinst",
title = "Faster Double-Size Modular Multiplication from
{Euclidean} Multipliers",
crossref = "Walter:2003:CHE",
pages = "214--227",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Chien:2003:CMV,
author = "Hung-Yu Chien and Jinn-Ke Jan and Yuh-Min Tseng",
title = "Cryptanalysis on {Mu--Varadharajan}'s e-voting
schemes",
journal = j-APPL-MATH-COMP,
volume = "139",
number = "2--3",
pages = "525--530",
day = "15",
month = jul,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:40:58 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chien:2003:HAP,
author = "Hung-Yu Chien and Jinn-Ke Jan",
title = "A hybrid authentication protocol for large mobile
network",
journal = j-J-SYST-SOFTW,
volume = "67",
number = "2",
pages = "123--130",
day = "15",
month = aug,
year = "2003",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:15 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chien:2003:NHA,
author = "Hung-Yu Chien and Jinn-Ke Jan",
title = "New hierarchical assignment without Public Key
cryptography",
journal = j-COMPUT-SECUR,
volume = "22",
number = "6",
pages = "523--526",
month = sep,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803006138",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chien:2003:RSA,
author = "Hung-Yu Chien and Jinn-Ke Jan",
title = "Robust and Simple Authentication Protocol",
journal = j-COMP-J,
volume = "46",
number = "2",
pages = "193--201",
month = feb,
year = "2003",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 4 14:32:54 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_02/460193.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_02/pdf/460193.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Chodowiec:2003:VCF,
author = "Pawe{\l} Chodowiec and Kris Gaj",
title = "Very Compact {FPGA} Implementation of the {AES}
Algorithm",
crossref = "Walter:2003:CHE",
pages = "319--333",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Chun:2003:DLC,
author = "Kilsoo Chun and Seungjoo Kim and Sangjin Lee and Soo
Hak Sung and Seonhee Yoon",
title = "Differential and linear cryptanalysis for $2$-round
{SPNs}",
journal = j-INFO-PROC-LETT,
volume = "87",
number = "5",
pages = "277--282",
day = "15",
month = sep,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:32 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chung:2003:EPX,
author = "Yon Dohn Chung and Jong Wook Kim and Myoung Ho Kim",
title = "Efficient preprocessing of {XML} queries using
structured signatures",
journal = j-INFO-PROC-LETT,
volume = "87",
number = "5",
pages = "257--264",
day = "15",
month = sep,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:32 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Ciet:2003:PFI,
author = "M. Ciet and M. Neve and E. Peeters and J.-J.
Quisquater",
booktitle = "MWSCAS '03. Proceedings of the 46th IEEE International
Midwest Symposium on Circuits and Systems",
title = "Parallel {FPGA} implementation of {RSA} with residue
number systems --- can side-channel threats be
avoided?",
volume = "2",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "806--810",
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1109/MWSCAS.2003.1562409",
ISSN = "????",
bibdate = "Fri Nov 9 11:38:59 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "residue arithmetic; residue number system",
summary = "In this paper, the authors presented a new parallel
architecture to avoid side-channel analysis such as:
timing attack, simple/differential power analysis,
fault induction attack and simple/differential
electromagnetic analysis. Montgomery \ldots{}",
}
@InProceedings{Clulow:2003:SP,
author = "Jolyon Clulow",
title = "On the Security of {PKCS \#11}",
crossref = "Walter:2003:CHE",
pages = "411--425",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Cochran:2003:NVC,
author = "Shannon Cochran",
title = "News and Views: Cryptographers [{Ronald Rivest}, {Adi
Shamir}, and {Leonard Adleman}] Receive {Turing Award};
Computer-Science Pioneer [{John G. ``Jack'' Herriot}]
Passes Away; Programming Quantum Computers; The
Demography of the {Internet}",
journal = j-DDJ,
volume = "28",
number = "7",
pages = "14--14",
month = jul,
year = "2003",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jun 12 05:46:24 MDT 2003",
bibsource = "http://www.ddj.com/articles/2003/0307/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Cohen:2003:FOV,
author = "Ernie Cohen",
title = "First-order verification of cryptographic protocols",
journal = j-J-COMP-SECUR,
volume = "11",
number = "2",
pages = "189--216",
month = "????",
year = "2003",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2003-11203",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:06 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Book{Cole:2003:HPS,
author = "Eric Cole",
title = "Hiding in Plain Sight: Steganography and the Art of
Covert Communication",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xviii + 335",
year = "2003",
ISBN = "0-471-44449-9",
ISBN-13 = "978-0-471-44449-7",
LCCN = "QA76.9.A25 C598 2003",
bibdate = "Sat Jun 14 15:10:28 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$35.00",
acknowledgement = ack-nhfb,
}
@InProceedings{Coron:2003:NAS,
author = "Jean-S{\'e}bastien Coron and Alexei Tchulkine",
title = "A New Algorithm for Switching from Arithmetic to
{Boolean} Masking",
crossref = "Walter:2003:CHE",
pages = "89--97",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Costlow:2003:BIM,
author = "Terry Costlow",
title = "In Brief: Intelligent Mail Idea Raising Opponents'
Ire",
journal = j-IEEE-DISTRIB-SYST-ONLINE,
volume = "4",
number = "9",
year = "2003",
CODEN = "????",
ISSN = "1541-4922 (print), 1558-1683 (electronic)",
ISSN-L = "1541-4922",
bibdate = "Sat Jan 03 14:59:06 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dsonline.computer.org/0309/d/brief.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Distributed Systems Online",
}
@Article{Courtois:2003:AAS,
author = "Nicolas T. Courtois and Willi Meier",
title = "Algebraic Attacks on Stream Ciphers with Linear
Feedback",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "345--359",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_21",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_21.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Courtois:2003:AXA,
author = "Nicolas T. Courtois and Jacques Patarin",
title = "About the {XL} Algorithm over $ {GF}(2) $",
crossref = "Joye:2003:TCC",
pages = "141--157",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@InProceedings{Courtois:2003:FAA,
author = "Nicolas T. Courtois",
title = "Fast Algebraic Attacks on Stream Ciphers with Linear
Feedback",
crossref = "Boneh:2003:ACC",
pages = "176--194",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Cramer:2003:DAP,
author = "Ronald Cramer and Victor Shoup",
title = "Design and Analysis of Practical Public-Key Encryption
Schemes Secure against Adaptive Chosen Ciphertext
Attack",
journal = j-SIAM-J-COMPUT,
volume = "33",
number = "1",
pages = "167--226",
month = feb,
year = "2003",
CODEN = "SMJCAT",
DOI = "https://doi.org/10.1137/S0097539702403773",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Mon Jan 12 18:56:13 MST 2004",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/33/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/40377",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Crepeau:2003:SBR,
author = "Claude Cr{\'e}peau and Alain Slakmon",
title = "Simple Backdoors for {RSA} Key Generation",
crossref = "Joye:2003:TCC",
pages = "403--416",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@InProceedings{Damgaard:2003:UCE,
author = "Ivan Damg{\aa}rd and Jesper Buus Nielsen",
title = "Universally Composable Efficient Multiparty
Computation from Threshold Homomorphic Encryption",
crossref = "Boneh:2003:ACC",
pages = "247--264",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{DArco:2003:FTD,
author = "Paolo D'Arco and Douglas R. Stinson",
title = "Fault Tolerant and Distributed Broadcast Encryption",
crossref = "Joye:2003:TCC",
pages = "263--280",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Devanbu:2003:ADP,
author = "Premkumar Devanbu and Michael Gertz and Charles Martel
and Stuart G. Stubblebine",
title = "Authentic data publication over the {Internet}",
journal = j-J-COMP-SECUR,
volume = "11",
number = "3",
pages = "291--314",
month = "????",
year = "2003",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2003-11302",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:10 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Dhem:2003:EMR,
author = "Jean-Fran{\c{c}}ois Dhem",
title = "Efficient Modular Reduction Algorithm in and Its
Application to ``Left to Right'' Modular Multiplication
in",
crossref = "Walter:2003:CHE",
pages = "203--213",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Dichtl:2003:HPO,
author = "Markus Dichtl",
title = "How to Predict the Output of a Hardware Random Number
Generator",
crossref = "Walter:2003:CHE",
pages = "181--188",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{DiCrescenzo:2003:SOS,
author = "Giovanni {Di Crescenzo}",
title = "Sharing one secret vs. sharing many secrets",
journal = j-THEOR-COMP-SCI,
volume = "295",
number = "1--3",
pages = "123--140",
day = "24",
month = feb,
year = "2003",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:28 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Ding:2003:SIB,
author = "Xuhua Ding and Gene Tsudik",
title = "Simple Identity-Based Cryptography with Mediated
{RSA}",
crossref = "Joye:2003:TCC",
pages = "193--210",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{DiRaimondo:2003:PST,
author = "Mario {Di Raimondo} and Rosario Gennaro",
title = "Provably Secure Threshold Password-Authenticated Key
Exchange",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "507--523",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_32",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_32.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Dodis:2003:CAA,
author = "Yevgeniy Dodis and Jee Hea An",
title = "Concealment and Its Applications to Authenticated
Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "312--329",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_19",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_19.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Dodis:2003:IRP,
author = "Yevgeniy Dodis and Matt Franklin and Jonathan Katz and
Atsuko Miyaji and Moti Yung",
title = "Intrusion-Resilient Public-Key Encryption",
crossref = "Joye:2003:TCC",
pages = "19--32",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Dolev:2003:NC,
author = "Danny Dolev and Cynthia Dwork and Moni Naor",
title = "Nonmalleable Cryptography",
journal = j-SIAM-REVIEW,
volume = "45",
number = "4",
pages = "727--784",
month = dec,
year = "2003",
CODEN = "SIREAD",
DOI = "https://doi.org/10.1137/S0036144503429856",
ISSN = "0036-1445 (print), 1095-7200 (electronic)",
ISSN-L = "0036-1445",
bibdate = "Fri Jan 2 07:22:46 MST 2004",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/SIREV/45/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/42985",
acknowledgement = ack-nhfb,
fjournal = "SIAM Review",
journal-URL = "http://epubs.siam.org/sirev",
}
@Article{Duwell:2003:BRB,
author = "Armond Duwell",
title = "Book Review: {{\booktitle{The physics of quantum
information: quantum cryptography, quantum
teleportation, quantum computation}}: D. Bouwmeester,
A. Ekert and A. Zeilinger (Eds.); Germany, 2000, 314pp,
US\$54, ISBN 3-540-66778-4}",
journal = j-STUD-HIST-PHILOS-MOD-PHYS,
volume = "34",
number = "2",
pages = "331--334",
month = jun,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1016/S1355-2198(03)00012-1",
ISSN = "1355-2198 (print), 1879-2502 (electronic)",
ISSN-L = "1355-2198",
bibdate = "Thu Nov 3 06:18:25 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/shps-b.bib;
http://www.sciencedirect.com/science/journal/13552198",
note = "See \cite{Bouwmeester:2001:PQI}.",
URL = "http://www.sciencedirect.com/science/article/pii/S1355219803000121",
acknowledgement = ack-nhfb,
fjournal = "Studies in History and Philosophy of Modern Physics",
journal-URL = "http://www.sciencedirect.com/science/journal/13552198",
}
@InProceedings{Dwork:2003:MBF,
author = "Cynthia Dwork and Andrew Goldberg and Moni Naor",
title = "On Memory-Bound Functions for Fighting Spam",
crossref = "Boneh:2003:ACC",
pages = "426--444",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Dwork:2003:MFM,
author = "Cynthia Dwork and Moni Naor and Omer Reingold and
Larry Stockmeyer",
title = "Magic Functions: In Memoriam: {Bernard M. Dwork}
1923--1998",
journal = j-J-ACM,
volume = "50",
number = "6",
pages = "852--921",
month = nov,
year = "2003",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/950620.950623",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Fri Nov 28 14:26:11 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We prove that three apparently unrelated fundamental
problems in distributed computing, cryptography, and
complexity theory, are essentially the same problem.
These three problems and brief descriptions of them
follow. (1) The selective decommitment problem. An
adversary is given commitments to a collection of
messages, and the adversary can ask for some subset of
the commitments to be opened. The question is whether
seeing the decommitments to these open plaintexts
allows the adversary to learn something unexpected
about the plaintexts that are unopened. (2) The power
of 3-round weak zero-knowledge arguments. The question
is what can be proved in (a possibly weakened form of)
zero-knowledge in a 3-round argument. In particular, is
there a language outside of BPP that has a 3-round
public-coin weak zero-knowledge argument? (3) The
Fiat--Shamir methodology. This is a method for
converting a 3-round public-coin argument (viewed as an
identification scheme) to a 1-round signature scheme.
The method requires what we call a ``magic function''
that the signer applies to the first-round message of
the argument to obtain a second-round message (queries
from the verifier). An open question here is whether
every 3-round public-coin argument for a language
outside of BPP has a magic function.\par
It follows easily from definitions that if a 3-round
public-coin argument system is zero-knowledge in the
standard (fairly strong) sense, then it has no magic
function. We define a weakening of zero-knowledge such
that zero-knowledge ? no-magic-function still holds.
For this weakened form of zero-knowledge, we give a
partial converse: informally, if a 3-round public-coin
argument system is not weakly zero-knowledge, then some
form of magic is possible for this argument system. We
obtain our definition of weak zero-knowledge by a
sequence of weakenings of the standard definition,
forming a hierarchy. Intermediate forms of
zero-knowledge in this hierarchy are reasonable ones,
and they may be useful in applications. Finally, we
relate the selective decommitment problem to
public-coin proof systems and arguments at an
intermediate level of the hierarchy, and obtain several
positive security results for selective decommitment.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@TechReport{Dworkin:2003:DRB,
author = "Morris Dworkin",
title = "{DRAFT} Recommendation for Block Cipher Modes of
Operation: {The} {CCM} Mode For Authentication and
Confidentiality",
type = "{NIST} Special Publication",
number = "800-38C",
institution = pub-NIST,
address = pub-NIST:adr,
month = sep,
year = "2003",
bibdate = "Mon Sep 15 07:58:33 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/publications/drafts/Draft_SP_800-38C_9-04-2003.pdf",
abstract = "This Recommendation defines a mode of operation,
called CCM, for a symmetric key block cipher algorithm.
CCM may be used to provide cryptographic protection for
sensitive, but unclassified, computer data. In
particular, CCM may be used to provide assurance of the
confidentiality and the authenticity of the data by
combining the techniques of the Counter (CTR) mode and
the Cipher Block Chaining-Message Authentication Code
(CBC-MAC) algorithm.",
acknowledgement = ack-nhfb,
keywords = "Authentication; block cipher; confidentiality;
cryptography; encryption; Federal Information
Processing Standard; IEEE 802.11i; information
security; mode of operation",
remark = "The draft specifies the CCM mode of operation of the
Advanced Encryption Standard (AES) algorithm. CCM
combines the counter authentication code (CBC-MAC)
technique for authentication and data integrity. The
specification of CCM is intended to be compatible with
the use of CCM within the draft IEEE 802.11i
standard.",
}
@Article{Ellison:2003:PKS,
author = "Carl Ellison and Steve Dohrmann",
title = "Public-key support for group collaboration",
journal = j-TISSEC,
volume = "6",
number = "4",
pages = "547--565",
month = nov,
year = "2003",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Dec 22 17:56:10 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Epstein:2003:DIT,
author = "Michael Epstein and Laszlo Hars and Raymond Krasinski
and Martin Rosner and Hao Zheng",
title = "Design and Implementation of a True Random Number
Generator Based on Digital Circuit Artifacts",
crossref = "Walter:2003:CHE",
pages = "152--165",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Book{Erickson:2003:HAE,
author = "Jon (Jon Mark) Erickson",
title = "Hacking: the art of exploitation",
publisher = pub-NO-STARCH,
address = pub-NO-STARCH:adr,
pages = "xi + 241",
year = "2003",
ISBN = "1-59327-007-0",
ISBN-13 = "978-1-59327-007-0",
LCCN = "QA76.9.A25 E75 2003",
bibdate = "Sat Dec 24 07:30:39 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip047/2003017498.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer hackers; Computer
networks; Security measures",
}
@Article{Everitt:2003:JBI,
author = "R. A. J. Everitt and P. W. McOwan",
title = "{Java}-Based {Internet} Biometric Authentication
System",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
volume = "25",
number = "9",
pages = "1166--1171",
year = "2003",
CODEN = "????",
ISSN = "0162-8828",
bibdate = "Tue Sep 30 06:17:55 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
}
@Article{Fan:2003:ILC,
author = "Chun-I Fan",
title = "Improved low-computation partially blind signatures",
journal = j-APPL-MATH-COMP,
volume = "145",
number = "2--3",
pages = "853--867",
day = "25",
month = dec,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:41:12 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Faugere:2003:ACH,
author = "Jean-Charles Faug{\`e}re and Antoine Joux",
title = "Algebraic Cryptanalysis of {Hidden Field Equation
(HFE)} Cryptosystems Using {Gr{\"o}bner} Bases",
crossref = "Boneh:2003:ACC",
pages = "44--60",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Misc{Ferguson:2003:CEI,
author = "Niels Ferguson and Bruce Schneier",
title = "A cryptographic evaluation of {IPsec}",
howpublished = "Unknown",
year = "2003",
bibdate = "Mon Mar 09 12:03:06 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.schneier.com/paper-ipsec.html",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference ]{Schneier:2015:SWC}.",
}
@Book{Ferguson:2003:PC,
author = "Niels Ferguson and Bruce Schneier",
title = "Practical Cryptography",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xx + 410",
year = "2003",
ISBN = "0-471-22894-X (hardcover), 0-471-22357-3 (paperback)",
ISBN-13 = "978-0-471-22894-3 (hardcover), 978-0-471-22357-3
(paperback)",
LCCN = "QA76.9.A25 F466 2003",
bibdate = "Mon Apr 21 16:29:39 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib",
URL = "http://www.counterpane.com/book-practical.html;
http://www.loc.gov/catdir/bios/wiley044/2003276249.html;
http://www.loc.gov/catdir/description/wiley036/2003276249.html;
http://www.loc.gov/catdir/toc/wiley032/2003276249.html",
abstract = "Security is the number one concern for businesses
worldwide. The gold standard for attaining security is
cryptography because it provides the most reliable
tools for storing or transmitting digital
information.",
acknowledgement = ack-nhfb,
tableofcontents = "1: Our design philosophy \\
2: The context of cryptography \\
3: Introduction to cryptography \\
4: Block ciphers \\
5: Block cipher modes \\
6: Hash functions \\
7: Message authentication codes \\
8: The secure channel \\
9: Implementation issues \\
10: Generating randomness \\
11: Primes \\
12: Diffie--Hellman \\
13: RSA \\
14: Introduction to cryptographic protocols \\
15: Key negotiation protocol \\
16: Implementation issues 2 \\
17: The clock \\
18: Key servers \\
19: The dream of PKI \\
20: PKI reality \\
21: PKI practicalities \\
22: Storing secrets \\
23: Standards \\
24: Patents \\
25: Involving experts",
}
@Book{Finkenzeller:2003:RHF,
author = "Klaus Finkenzeller",
title = "{RFID} handbook: fundamentals and applications in
contactless smart cards and identification",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Second",
pages = "xviii + 427",
year = "2003",
ISBN = "0-470-84402-7",
ISBN-13 = "978-0-470-84402-1",
LCCN = "TS160 .F5513 2003",
bibdate = "Thu Jun 23 18:36:11 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
http://www.loc.gov/catdir/description/wiley039/2002192439.html;
http://www.loc.gov/catdir/toc/wiley031/2002192439.html",
acknowledgement = ack-nhfb,
subject = "Inventory control; Automation; Radio frequency
identification systems; Smart cards",
}
@Article{Focardi:2003:CTA,
author = "Riccardo Focardi and Roberto Gorrieri and Fabio
Martinelli",
title = "A comparison of three authentication properties",
journal = j-THEOR-COMP-SCI,
volume = "291",
number = "3",
pages = "285--327",
day = "6",
month = jan,
year = "2003",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:19 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Fouque:2003:AUR,
author = "Pierre-Alain Fouque and Gwena{\"e}lle Martinet and
Guillaume Poupard",
title = "Attacking Unbalanced {RSA--CRT} Using {SPA}",
crossref = "Walter:2003:CHE",
pages = "254--268",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Fouque:2003:DAW,
author = "Pierre-Alain Fouque and Frederic Valette",
title = "The Doubling Attack --- Why Upwards Is Better than
Downwards",
crossref = "Walter:2003:CHE",
pages = "269--280",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Fournier:2003:SEA,
author = "Jacques J. A. Fournier and Simon Moore and Huiyun Li
and Robert Mullins and George Taylor",
title = "Security Evaluation of Asynchronous Circuits",
crossref = "Walter:2003:CHE",
pages = "137--151",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Fremberg:2003:MAP,
author = "Daniel Fremberg",
title = "The {Mithra} Authentication Protocol",
journal = j-DDJ,
volume = "28",
number = "5",
pages = "44, 46--48",
month = may,
year = "2003",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Jun 12 05:46:23 MDT 2003",
bibsource = "http://www.ddj.com/articles/2003/0305/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ddj.com/documents/s=7927/ddj0305d/",
abstract = "Mithra is an authentication protocol designed to
detect Man-in-the-Middle attacks that try to steal your
passwords.",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Gaj:2003:FME,
author = "Kris Gaj and Arkadiusz Or{\l}owski",
title = "Facts and Myths of {Enigma}: Breaking Stereotypes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "106--122",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_7.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Galbraith:2003:IAU,
author = "Steven D. Galbraith and Wenbo Mao",
title = "Invisibility and Anonymity of Undeniable and Confirmer
Signatures",
crossref = "Joye:2003:TCC",
pages = "80--97",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Gallo:2003:SST,
author = "Vince Gallo",
title = "Secret Steganography Techniques Revealed",
journal = j-NETWORK-SECURITY,
volume = "2003",
number = "2",
pages = "4--8",
month = feb,
year = "2003",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(03)00209-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485803002095",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Garfinkel:2003:EBI,
author = "Simson L. Garfinkel",
title = "Email-Based Identification and Authentication: An
Alternative to {PKI}?",
journal = j-IEEE-SEC-PRIV,
volume = "1",
number = "6",
pages = "20--26",
month = nov # "\slash " # dec,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSECP.2003.1253564",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jan 27 18:07:01 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/sp/2003/06/j6020abs.htm;
http://csdl.computer.org/dl/mags/sp/2003/06/j6020.htm;
http://csdl.computer.org/dl/mags/sp/2003/06/j6020.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Book{Garfinkel:2003:PUI,
author = "Simson Garfinkel and Gene Spafford and Alan Schwartz",
title = "Practical {Unix} \& {Internet} Security",
publisher = pub-ORA,
address = pub-ORA:adr,
edition = "Third",
pages = "xxix + 954",
year = "2003",
ISBN = "0-596-00323-4",
ISBN-13 = "978-0-596-00323-4",
LCCN = "QA76.76.O63 G38 2003",
bibdate = "Wed Oct 30 16:15:17 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.oreilly.com/catalog/prdindex.html;
z3950.loc.gov:7090/Voyager",
price = "US\$54.95",
URL = "http://www.oreilly.com/catalog/puis3",
acknowledgement = ack-nhfb,
publishersummary = "This new edition of Practical UNIX and Internet
Security provides detailed coverage of today's security
and networking issues. In addition to covering the four
most popular Unix variants today: Solaris, Linux,
FreeBSD, and Mac OS X, the authors have added far more
information about Linux, security policy, and
cryptography, and have added new sections on embedded
systems, biometrics, additional Internet protocols, new
authentication systems such as LDAP and PAM, and
anti-theft technologies.",
subject = "Operating systems (Computers); UNIX (Computer file);
Computer security; Internet; Congresses",
}
@Book{Garman:2003:KDG,
author = "Jason Garman",
title = "{Kerberos}: the definitive guide",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xiv + 253",
year = "2003",
ISBN = "0-596-00403-6",
ISBN-13 = "978-0-596-00403-3",
LCCN = "TK5105.59 .G375 2003",
bibdate = "Mon Apr 18 15:06:04 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.oreilly.com/catalog/9780596004033",
acknowledgement = ack-nhfb,
remark = "``Covers Unix and Windows'' --- cover.
``Cross-platform authentication and single-sign-on''
--- cover.",
subject = "Computer networks; Security measures; Computer
networks; Access control",
}
@Article{Geier:2003:LCC,
author = "M. J. Geier",
title = "Lights, camera, controls! [DVD copying prevention]",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "5",
pages = "28--31",
month = may,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1197474",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cameras; Cascading style sheets; content scramble
system; copyright; cryptography; digital copies;
digital versatile discs; DVD; DVD copying prevention;
encryption; History; Internet; Law; Lighting control;
Motion pictures; movie industry; Protection; Video
recording",
}
@InProceedings{Geiselmann:2003:HSS,
author = "Willi Geiselmann and Rainer Steinwandt",
title = "Hardware to Solve Sparse Systems of Linear Equations
over {$ \mathrm {GF}(2) $}",
crossref = "Walter:2003:CHE",
pages = "51--61",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Gennaro:2003:FPB,
author = "Rosario Gennaro and Yehuda Lindell",
title = "A Framework for Password-Based Authenticated Key
Exchange",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "524--543",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_33",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_33.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Gennaro:2003:LBE,
author = "Rosario Gennaro and Yael Gertner and Jonathan Katz",
title = "Lower bounds on the efficiency of encryption and
digital signature schemes",
crossref = "ACM:2003:PTF",
pages = "417--425",
year = "2003",
bibdate = "Tue Jan 13 06:21:07 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Gennaro:2003:SAP,
author = "Rosario Gennaro and Stanislaw Jarecki and Hugo
Krawczyk and Tal Rabin",
title = "Secure Applications of {Pedersen}'s Distributed Key
Generation Protocol",
crossref = "Joye:2003:TCC",
pages = "373--390",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Gentry:2003:CBE,
author = "Craig Gentry",
title = "Certificate-Based Encryption and the Certificate
Revocation Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "272--293",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_17.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Golic:2003:DNP,
author = "Jovan D. Goli{\'c}",
title = "{DeKaRT}: a New Paradigm for Key-Dependent Reversible
Circuits",
crossref = "Walter:2003:CHE",
pages = "98--112",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Goodrich:2003:ADS,
author = "Michael T. Goodrich and Roberto Tamassia and Nikos
Triandopoulos and Robert Cohen",
title = "Authenticated Data Structures for Graph and Geometric
Searching",
crossref = "Joye:2003:TCC",
pages = "295--313",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Gordon:2003:ATS,
author = "Andrew D. Gordon and Alan Jeffrey",
title = "Authenticity by typing for security protocols",
journal = j-J-COMP-SECUR,
volume = "11",
number = "4",
pages = "451--519",
month = "????",
year = "2003",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2003-11402",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:14 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Gross-Amblard:2003:QPW,
author = "David Gross-Amblard",
title = "Query-preserving watermarking of relational databases
and {XML} documents",
crossref = "ACM:2003:PTS",
pages = "191--201",
year = "2003",
bibdate = "Fri Oct 31 08:02:47 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Grossschadl:2003:ASL,
author = "Johann Gro{\ss}sch{\"a}dl",
title = "Architectural Support for Long Integer Modulo
Arithmetic on {RISC}-Based {Smart Cards}",
journal = j-IJHPCA,
volume = "17",
number = "2",
pages = "135--146",
month = "Summer",
year = "2003",
CODEN = "IHPCFL",
ISSN = "1094-3420 (print), 1741-2846 (electronic)",
ISSN-L = "1094-3420",
bibdate = "Fri Nov 28 06:52:13 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
journal-URL = "http://hpc.sagepub.com/content/by/year",
keywords = "application-specific instruct set processor (ASIP);
coarsely-integrated operand scanning (CIOS);
Diffie--Hellman; inner-loop operation; Montgomery
multiplication; processor specialization; public-key
cryptography; Rivest-Shamir-Adelman",
}
@InProceedings{Halevi:2003:TEM,
author = "Shai Halevi and Phillip Rogaway",
title = "A Tweakable Enciphering Mode",
crossref = "Boneh:2003:ACC",
pages = "482--499",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Hardy:2003:AAC,
author = "Darel W. Hardy and Carol L. Walker",
title = "Applied algebra: codes, ciphers, and discrete
algorithms",
publisher = pub-PH,
address = pub-PH:adr,
pages = "x + 420",
year = "2003",
ISBN = "0-13-067464-8",
ISBN-13 = "978-0-13-067464-7",
LCCN = "QA268 .H365 2003",
bibdate = "Tue Feb 25 07:04:05 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Haufler:2003:CVH,
author = "Hervie Haufler",
title = "Codebreakers' victory: how the {Allied} cryptographers
won {World War II}",
publisher = "New American Library",
address = "New York, NY, USA",
pages = "344",
year = "2003",
ISBN = "0-451-20979-6",
ISBN-13 = "978-0-451-20979-5",
LCCN = "D810.C88 H38 2003",
bibdate = "Thu Feb 23 07:15:55 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "From the publisher: ``For the first time ever, veteran
World War II cryptographer Hervie Haufler details how
American and British codebreakers were the decisive
factor in the Allied victory. From the Purple Machine
to the Navajo Talkers to the breaking of Japan's JN-25
Naval Code to the shadowy world of decoding units like
Hut-8 in Bletchley Park, he shows how crucial
information-often obtained by surreptitious and violent
means-was the decisive edge in the Battle of Britain,
at Midway and against the U-Boats in the North
Atlantic, and how Allied intelligence saved the Soviet
Union from almost certain defeat.
In an accessible account based on years of research,
interviews and exclusive access to previously
top-secret archives, Haufler demonstrates how
cryptography enabled Nimitz and MacArthur to persevere
in the Pacific and helped Eisenhower and Patton mount
the assaults on Normandy. In compelling detail, Haufler
shows us how it was done-as only one who was on the
frontlines of the `secret war' could tell it.
About the Author Hervie Haufler is a World War II
veteran cryptographer who participated in both English
and American codebreaking task forces.''",
subject = "World War, 1939-1945; Cryptography; United States;
History; 20th century; Great Britain",
}
@Article{Heiser:2003:BCB,
author = "Jay G. Heiser",
title = "Beyond cryptography: Bruce {Schneier}'s Beyond Fear:
thinking sensibly about security in an uncertain
world",
journal = j-COMPUT-SECUR,
volume = "22",
number = "8",
pages = "673--674",
month = dec,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803000051",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Hellekalek:2003:EEC,
author = "Peter Hellekalek and Stefan Wegenkittl",
title = "Empirical evidence concerning {AES}",
journal = j-TOMACS,
volume = "13",
number = "4",
pages = "322--333",
month = oct,
year = "2003",
CODEN = "ATMCEZ",
ISSN = "1049-3301 (print), 1558-1195 (electronic)",
ISSN-L = "1049-3301",
bibdate = "Fri Oct 31 05:50:26 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tomacs/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://random.mat.sbg.ac.at/ftp/pub/publications/peter/aes_sub.ps;
http://random.mat.sbg.ac.at/~peter/slides_YACC04.pdf",
abstract = "AES, the Advanced Encryption Standard, is one of the
most important algorithms in modern cryptography.
Certain randomness properties of AES are of vital
importance for its security. At the same time, these
properties make AES an interesting candidate for a fast
nonlinear random number generator for stochastic
simulation. In this article, we address both of these
two aspects of AES. We study the performance of AES in
a series of statistical tests that are related to
cryptographic notions like confusion and diffusion. At
the same time, these tests provide empirical evidence
for the suitability of AES in stochastic simulation. A
substantial part of this article is devoted to the
strategy behind our tests and to their relation to
other important test statistics like Maurer's Universal
Test.",
acknowledgement = ack-nhfb,
annote = "Best period is $ 2^{128} \approx 10^{38} $. From the
article: ``It appears that our test results are the
first detailed statistical results for AES in the
published literature. \ldots{}\par
AES has been evaluated using the NIST package (see NIST
[2001a]). In principle, we consider this type of
testing necessary and valuable. However, up to now, AES
has only been tested using relatively small sample
sizes. Furthermore, the exact test procedure and the
parameters that were used have not been published.
There are no refereed publications on this topic.
\ldots{} \par
4. FINDINGS\par
AES performed very well. The empirical results support
the hypothesis that AES is not only an excellent
cryptographic algorithm, but also a very interesting
nonlinear random number generator for stochastic
simulation.\par
We were unable to find any statistical weaknesses. Most
of the $p$-values were completely uncritical, no
systematic trends popped up in the tests.\par
\ldots{} \par
The results indicate that AES pseudorandom numbers are
indistinguishable from real random numbers with respect
to bit-vectors up to length 16 and with respect to the
distribution of 0's and 1's in bit-vectors up to length
256.\par
From the results for DIFF we conclude that AES is able
to compensate for an extreme lack of 1's in the
plaintext, and hence provides excellent diffusion in
this case. The results for KCOUNT provide some
confidence that the key schedule used for generating
the internal keys for the encryption rounds in AES does
a good job. Similar keys do not yield correlated output
sequences.''",
fjournal = "ACM Transactions on Modeling and Computer Simulation",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}
@InProceedings{Herzog:2003:PAK,
author = "Jonathan Herzog and Moses Liskov and Silvio Micali",
title = "Plaintext Awareness via Key Registration",
crossref = "Boneh:2003:ACC",
pages = "548--564",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Heys:2003:ASC,
author = "H. M. Heys",
title = "Analysis of the statistical cipher feedback mode of
block ciphers",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "1",
pages = "77--92",
month = jan,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1159755",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:42 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1159755",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Hoffstein:2003:NDS,
author = "Jeffrey Hoffstein and Nick Howgrave-Graham and Jill
Pipher and Joseph H. Silverman and William Whyte",
title = "{NTRUSIGN}: Digital Signatures Using the {NTRU}
Lattice",
crossref = "Joye:2003:TCC",
pages = "122--140",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; cryptology; NTRUSign; Topics in
Cryptology CT-RSA 2003",
}
@Article{Hong:2003:BBP,
author = "Hyun-Soo Hong and Ho-Kyu Lee and Hyang-Sook Lee and
Hee-Jung Lee",
title = "The better bound of private key in {RSA} with
unbalanced primes",
journal = j-APPL-MATH-COMP,
volume = "139",
number = "2--3",
pages = "351--362",
day = "15",
month = jul,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:40:58 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Horvitz:2003:WKA,
author = "Omer Horvitz and Virgil Gligor",
title = "Weak Key Authenticity and the Computational
Completeness of Formal Encryption",
crossref = "Boneh:2003:ACC",
pages = "530--547",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Howard:2003:WSC,
author = "Michael Howard and David LeBlanc",
title = "Writing secure code",
publisher = pub-MICROSOFT,
address = pub-MICROSOFT:adr,
edition = "Second",
pages = "xxviii + 768",
year = "2003",
ISBN = "0-7356-1722-8",
ISBN-13 = "978-0-7356-1722-3",
LCCN = "QA76.9.A25 H698 2003",
bibdate = "Thu Feb 23 08:02:30 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Data encryption (Computer
science)",
}
@Article{Howgrave-Graham:2003:HNP,
author = "Nick A. Howgrave-Graham and Phong Q. Nguyen and Igor
E. Shparlinski",
title = "Hidden number problem with hidden multipliers,
timed-release crypto, and noisy exponentiation",
journal = j-MATH-COMPUT,
volume = "72",
number = "243",
pages = "1473--1485",
month = jul,
year = "2003",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Nov 5 16:26:01 MST 2003",
bibsource = "http://www.ams.org/mcom/2003-72-243;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/journal-getitem?pii=S0025-5718-03-01495-9;
http://www.ams.org/mcom/2003-72-243/S0025-5718-03-01495-9/S0025-5718-03-01495-9.dvi;
http://www.ams.org/mcom/2003-72-243/S0025-5718-03-01495-9/S0025-5718-03-01495-9.pdf;
http://www.ams.org/mcom/2003-72-243/S0025-5718-03-01495-9/S0025-5718-03-01495-9.ps;
http://www.ams.org/mcom/2003-72-243/S0025-5718-03-01495-9/S0025-5718-03-01495-9.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@InProceedings{Howgrave-Graham:2003:IDF,
author = "Nick Howgrave-Graham and Phong Q. Nguyen and David
Pointcheval and John Proos and Joseph H. Silverman and
Ari Singer and William Whyte",
title = "The Impact of Decryption Failures on the Security of
{NTRU} Encryption",
crossref = "Boneh:2003:ACC",
pages = "226--246",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Hromkovic:2003:AHP,
author = "Juraj Hromkovi{\v{c}}",
title = "Algorithmics for Hard Problems: Introduction to
Combinatorial Optimization, Randomization,
Approximation, and Heuristics",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xiii + 544",
year = "2003",
ISBN = "3-540-44134-4",
ISBN-13 = "978-3-540-44134-2",
LCCN = "QA76.58 .H76 2003",
bibdate = "Fri Mar 23 11:17:51 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Texts in theoretical computer science",
URL = "http://www.loc.gov/catdir/enhancements/fy0817/2002032405-d.html;
http://www.loc.gov/catdir/enhancements/fy0817/2002032405-t.html",
acknowledgement = ack-nhfb,
subject = "Parallel processing (Electronic computers);
Computational complexity",
tableofcontents = "1: Introduction \\
2: Elementary Fundamentals \\
3: Deterministic Approaches \\
4: Approximation Algorithms \\
5: Randomized Algorithms \\
6: Heuristics \\
7: A Guide to Solving Hard Problems",
}
@Article{Hsu:2003:CIT,
author = "Chien-Lung Hsu and Tzong-Sun Wu",
title = "Cryptanalyses and improvements of two cryptographic
key assignment schemes for dynamic access control in a
user hierarchy",
journal = j-COMPUT-SECUR,
volume = "22",
number = "5",
pages = "453--456",
month = jul,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:52 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803005145",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Hsu:2003:IMA,
author = "Chien-Lung Hsu and Tzong-Sun Wu and Tzong-Chen Wu and
Chris Mitchell",
title = "Improvement of modified authenticated key agreement
protocol",
journal = j-APPL-MATH-COMP,
volume = "142",
number = "2--3",
pages = "305--308",
day = "10",
month = oct,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:41:06 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hsu:2003:ITP,
author = "Chien-Lung Hsu and Tzong-Sun Wu and Tzong-Chen Wu",
title = "Improvement of threshold proxy signature scheme",
journal = j-APPL-MATH-COMP,
volume = "136",
number = "2--3",
pages = "315--321",
day = "15",
month = mar,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:40:52 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hwang:2003:ASM,
author = "Min-Shiang Hwang and Chao-Chen Yang and Cheng-Yeh
Shiu",
title = "An authentication scheme for mobile satellite
communication systems",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "42--47",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Hwang:2003:CAL,
author = "Min-Shiang Hwang and Wei-Pang Yang",
title = "Controlling access in large partially ordered
hierarchies using cryptographic keys",
journal = j-J-SYST-SOFTW,
volume = "67",
number = "2",
pages = "99--107",
day = "15",
month = aug,
year = "2003",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:15 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Hwang:2003:TRB,
author = "Min-Shiang Hwang and Cheng-Chi Lee and Yan-Chi Lai",
title = "Traceability on {RSA}-based partially signature with
low computation",
journal = j-APPL-MATH-COMP,
volume = "145",
number = "2--3",
pages = "465--468",
day = "25",
month = dec,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:41:12 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Impagliazzo:2003:LRA,
author = "R. Impagliazzo and B. M. Kapron",
title = "Logics for reasoning about cryptographic
constructions",
crossref = "IEEE:2003:PAI",
pages = "372--383",
year = "2003",
bibdate = "Fri Jul 15 16:13:03 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8767/27770/01238211.pdf?isnumber=27770&prod=CNF&arnumber=1238211&arSt=+372&ared=+383&arAuthor=Impagliazzo%2C+R.%3B+Kapron%2C+B.M.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=27770&arnumber=1238211&count=66&index=38",
acknowledgement = ack-nhfb,
}
@Article{Imrey:2003:BRC,
author = "Lee Imrey",
title = "Book Review: {{\em The Code Book: The Science of
Secrecy from Ancient Egypt to Quantum Cryptography\/}
by Simon Singh, Delacorte Press, 2000, \$15.00, ISBN
0-385-49532-3}",
journal = j-QUEUE,
volume = "1",
number = "9",
pages = "76--76",
month = dec # "\slash " # jan,
year = "2003",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Thu Jan 29 12:03:39 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Misc{Intel:2003:IRN,
author = "{Intel Corporation}",
title = "The {Intel} Random Number Generator",
howpublished = "World-Wide Web document.",
year = "2003",
bibdate = "Mon Dec 08 09:38:29 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://developer.intel.com/design/chipsets/rng/docs.htm",
acknowledgement = ack-nhfb,
}
@Article{Irwin:2003:BRBb,
author = "Robert J. Irwin",
title = "Book Review: {{\booktitle{Coding Theory and
Cryptography: the Essentials}}, second edition, revised
and expanded by D.R. Hankerson, et al. Marcel Dekker,
2000}",
journal = j-SIGACT,
volume = "34",
number = "4",
pages = "17--21",
month = dec,
year = "2003",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/954092.954096",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:26 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Hankerson:2000:CTC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@InProceedings{Ishai:2003:EOT,
author = "Yuval Ishai and Joe Kilian and Kobbi Nissim and Erez
Petrank",
title = "Extending Oblivious Transfers Efficiently",
crossref = "Boneh:2003:ACC",
pages = "145--161",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Ishai:2003:PCS,
author = "Yuval Ishai and Amit Sahai and David Wagner",
title = "Private Circuits: Securing Hardware against Probing
Attacks",
crossref = "Boneh:2003:ACC",
pages = "463--481",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Itoh:2003:PCA,
author = "Kouichi Itoh and Tetsuya Izu and Masahiko Takenaka",
title = "A Practical Countermeasure against Address-Bit
Differential Power Analysis",
crossref = "Walter:2003:CHE",
pages = "382--396",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Iwata:2003:NCP,
author = "Tetsu Iwata and Tomonobu Yoshino and Kaoru Kurosawa",
title = "Non-cryptographic primitive for pseudorandom
permutation",
journal = j-THEOR-COMP-SCI,
volume = "306",
number = "1--3",
pages = "139--154",
day = "5",
month = sep,
year = "2003",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:46 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tcs2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Jakobsson:2003:FMT,
author = "Markus Jakobsson and Tom Leighton and Silvio Micali
and Michael Szydlo",
title = "Fractal {Merkle} Tree Representation and Traversal",
crossref = "Joye:2003:TCC",
pages = "314--326",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Joux:2003:IGN,
author = "Antoine Joux and Reynald Lercier",
title = "Improvements to the general number field sieve for
discrete logarithms in prime fields. {A} comparison
with the {Gaussian} integer method",
journal = j-MATH-COMPUT,
volume = "72",
number = "242",
pages = "953--967",
month = apr,
year = "2003",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Nov 5 16:25:58 MST 2003",
bibsource = "http://www.ams.org/mcom/2003-72-242;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/journal-getitem?pii=S0025-5718-02-01482-5;
http://www.ams.org/mcom/2003-72-242/S0025-5718-02-01482-5/S0025-5718-02-01482-5.dvi;
http://www.ams.org/mcom/2003-72-242/S0025-5718-02-01482-5/S0025-5718-02-01482-5.pdf;
http://www.ams.org/mcom/2003-72-242/S0025-5718-02-01482-5/S0025-5718-02-01482-5.ps;
http://www.ams.org/mcom/2003-72-242/S0025-5718-02-01482-5/S0025-5718-02-01482-5.tex",
abstract = "In this paper, we describe many improvements to the
number field sieve. Our main contribution consists of a
new way to compute individual logarithms with the
number field sieve without solving a very large linear
system for each logarithm. We show that, with these
improvements, the number field sieve outperforms the
Gaussian integer method in the hundred digit range. We
also illustrate our results by successfully computing
discrete logarithms with GNFS in a large prime field.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Joye:2003:CPY,
author = "Marc Joye",
title = "Cryptanalysis of a pay-as-you-watch system",
journal = j-INFO-PROC-LETT,
volume = "88",
number = "3",
pages = "119--120",
day = "15",
month = nov,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:33 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Joye:2003:GFA,
author = "Marc Joye and Pascal Paillier",
title = "{GCD}-Free Algorithms for Computing Modular Inverses",
crossref = "Walter:2003:CHE",
pages = "243--253",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Kachris:2003:RLB,
author = "C. Kachris and N. Bourbakis and A. Dollas",
title = "A Reconfigurable Logic-Based Processor for the {SCAN}
Image and Video Encryption Algorithm",
journal = j-INT-J-PARALLEL-PROG,
volume = "31",
number = "6",
pages = "489--506",
month = dec,
year = "2003",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1023/B:IJPP.0000004512.53221.ff",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Wed Jul 6 16:40:02 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=31&issue=6;
http://www.kluweronline.com/issn/0885-7458;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ipsapp007.kluweronline.com/content/getfile/4773/37/6/abstract.htm;
http://ipsapp007.kluweronline.com/content/getfile/4773/37/6/fulltext.pdf;
http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=31&issue=6&spage=489",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel Programming",
journal-URL = "http://link.springer.com/journal/10766",
}
@TechReport{Kaliski:2003:TRK,
author = "Burton S. Kaliski",
title = "{TWIRL} and {RSA} Key Size",
type = "Web report",
institution = pub-RSA,
address = pub-RSA:adr,
day = "6",
month = may,
year = "2003",
bibdate = "Thu Apr 11 14:33:30 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://web.archive.org/web/20170417095741/https://www.emc.com/emc-plus/rsa-labs/historical/twirl-and-rsa-key-size.htm",
abstract = "The popular 1024-bit key size for RSA keys is becoming
the next horizon for researchers in integer
factorization, as demonstrated by the innovative TWIRL
design recently proposed by Adi Shamir and Eran Tromer.
The design confirms that the traditional assumption
that a 1024-bit RSA key provides comparable strength to
an 80-bit symmetric key has been a reasonable one.
Thus, if the 80-bit security level is appropriate for a
given application, then TWIRL itself has no immediate
effect. Many details remain to be worked out, however,
and the cost estimates are inconclusive. TWIRL provides
an opportunity for review of key sizes in practice; RSA
Laboratories revised recommendations are given in Table
1 below.",
acknowledgement = ack-nhfb,
remark = "The report has disappeared from the RSA Web site, but
is archived as noted in the URL. The short table
referred to in the abstract says for the symmetric keys
of length 80, 112, and 128 bits, respectively, for
security to 2010, 2030, and beyond, the corresponding
RSA key size is 1024, 2048, and 3072 bits,
respectively.",
}
@InProceedings{Kamp:2003:DEB,
author = "J. Kamp and D. Zuckerman",
title = "Deterministic extractors for bit-fixing sources and
exposure-resilient cryptography",
crossref = "IEEE:2003:PAI",
pages = "92--101",
year = "2003",
bibdate = "Fri Jul 15 16:13:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8767/27770/01238184.pdf?isnumber=27770&prod=CNF&arnumber=1238184&arSt=+92&ared=+101&arAuthor=Kamp%2C+J.%3B+Zuckerman%2C+D.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=27770&arnumber=1238184&count=66&index=11",
acknowledgement = ack-nhfb,
}
@InProceedings{Karlof:2003:HMM,
author = "Chris Karlof and David Wagner",
title = "Hidden {Markov} Model Cryptanalysis",
crossref = "Walter:2003:CHE",
pages = "17--34",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Karri:2003:PBC,
author = "Ramesh Karri and Grigori Kuznetsov and Michael
Goessel",
title = "Parity-Based Concurrent Error Detection of
Substitution-Permutation Network Block Ciphers",
crossref = "Walter:2003:CHE",
pages = "113--124",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Katz:2003:SPA,
author = "Jonathan Katz and Moti Yung",
title = "Scalable Protocols for Authenticated Group Key
Exchange",
crossref = "Boneh:2003:ACC",
pages = "110--125",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Kim:2003:IBP,
author = "Hyun-Sung Kim and Sung-Woon Lee and Kee-Young Yoo",
title = "{ID}-based password authentication scheme using smart
cards and fingerprints",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "32--41",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@InProceedings{Kim:2003:RCC,
author = "Seungjoo Kim and Masahiro Mambo and Yuliang Zheng",
title = "Rethinking Chosen-Ciphertext Security under
{Kerckhoffs}' Assumption",
crossref = "Joye:2003:TCC",
pages = "227--243",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Klein:2003:FOW,
author = "Andreas Klein and Martin Kutrib",
title = "Fast one-way cellular automata",
journal = j-THEOR-COMP-SCI,
volume = "295",
number = "1--3",
pages = "233--250",
day = "24",
month = feb,
year = "2003",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:28 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Klima:2003:ARB,
author = "Vlastimil Kl{\'\i}ma and Ondrej Pokorn{\'y} and
Tom{\'a}{\v{s}} Rosa",
title = "Attacking {RSA}-Based Sessions in {SSL\slash TLS}",
crossref = "Walter:2003:CHE",
pages = "426--440",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Koc:2003:GEI,
author = "C. K. Koc and C. Paar",
title = "Guest editors' introduction to the special section on
cryptographic hardware and embedded systems",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "401--402",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190580",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190580",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Komano:2003:EUP,
author = "Yuichi Komano and Kazuo Ohta",
title = "Efficient Universal Padding Techniques for
Multiplicative Trapdoor One-Way Permutation",
crossref = "Boneh:2003:ACC",
pages = "366--382",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Kovacich:2003:ISS,
author = "Gerald L. Kovacich",
title = "The information systems security officer's guide:
establishing and managing an information protection
program",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
edition = "Second",
pages = "xxviii + 361",
year = "2003",
ISBN = "0-7506-7656-6",
ISBN-13 = "978-0-7506-7656-4",
LCCN = "QA76.9.A25 K68 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
acknowledgement = ack-nhfb,
}
@Book{Kovacich:2003:MHC,
author = "Gerald L. Kovacich and Edward P. Halibozek",
title = "The manager's handbook for corporate security:
establishing and managing a successful assets
protection program",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xxi + 463",
year = "2003",
ISBN = "0-7506-7487-3",
ISBN-13 = "978-0-7506-7487-4",
LCCN = "HV8290 .K68 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
}
@Article{Krause:2003:DOC,
author = "Matthias Krause and Hans Ulrich Simon",
title = "Determining the Optimal Contrast for Secret Sharing
Schemes in Visual Cryptography",
journal = j-COMBIN-PROBAB-COMPUT,
volume = "12",
number = "3",
pages = "285--299",
month = may,
year = "2003",
CODEN = "CPCOFG",
DOI = "https://doi.org/10.1017/S096354830200559X",
ISSN = "0963-5483 (print), 1469-2163 (electronic)",
ISSN-L = "0963-5483",
MRclass = "94A60 (94A08)",
MRnumber = "MR1988978 (2004f:94065)",
bibdate = "Mon Jul 7 15:38:14 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Combinatorics, probability and computing (Oberwolfach,
2001)",
URL = "http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=12&issueId=03",
acknowledgement = ack-nhfb,
fjournal = "Combinatorics, Probability and Computing",
}
@InProceedings{Krawczy:2003:SSM,
author = "Hugo Krawczy",
title = "{SIGMA}: The ``{SIGn-and-MAc}'' Approach to
Authenticated {Diffie--Hellman} and Its Use in the
{IKE} Protocols",
crossref = "Boneh:2003:ACC",
pages = "400--425",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Krishna:2003:BUP,
author = "Shankara Narayanan Krishna and Raghavan Rama",
title = "Breaking {DES} using {P} systems",
journal = j-THEOR-COMP-SCI,
volume = "299",
number = "1--3",
pages = "495--508",
day = "18",
month = apr,
year = "2003",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:36 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Ku:2003:TSA,
author = "Wei-Chi Ku and Hao-Chuan Tsai and Shuai-Min Chen",
title = "Two simple attacks on {Lin--Shen--Hwang}'s
strong-password authentication protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "26--31",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Ku:2003:WLL,
author = "Wei-Chi Ku and Chien-Ming Chen and Hui-Lung Lee",
title = "Weaknesses of {Lee--Li--Hwang}'s hash-based password
authentication scheme",
journal = j-OPER-SYS-REV,
volume = "37",
number = "4",
pages = "19--25",
month = oct,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@InProceedings{Kurosawa:2003:TTK,
author = "Kaoru Kurosawa and Tetsu Iwata",
title = "{TMAC}: Two-Key {CBC MAC}",
crossref = "Joye:2003:TCC",
pages = "33--49",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Kwok:2003:WBC,
author = "Sai Ho Kwok",
title = "Watermark-based copyright protection system security",
journal = j-CACM,
volume = "46",
number = "10",
pages = "98--101",
month = oct,
year = "2003",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Oct 28 14:25:08 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Kwon:2003:EDS,
author = "Taekyoung Kwon",
title = "Erratum to: {``Digital signature algorithm for
securing digital identities'': [Inform. Process. Lett.
{\bf 82} (2002) 247--252]}",
journal = j-INFO-PROC-LETT,
volume = "88",
number = "4",
pages = "201--202",
day = "30",
month = nov,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:33 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
note = "See \cite{Kwon:2002:DSA}.",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Kwon:2003:EEC,
author = "Soonhak Kwon and Chang Hoon Kim and Chun Pyo Hong",
title = "Efficient Exponentiation for a Class of Finite Fields
{$ \mathrm {GF}(2^n) $} Determined by {Gauss} Periods",
crossref = "Walter:2003:CHE",
pages = "228--242",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Laih:2003:COP,
author = "C. S. Laih and S. Y. Chiou",
title = "Cryptanalysis of an optimized protocol for mobile
network authentication and security",
journal = j-INFO-PROC-LETT,
volume = "85",
number = "6",
pages = "339--341",
day = "31",
month = mar,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:31 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Lee:2003:APS,
author = "Jung-Yeun Lee and Jung Hee Cheon and Seungjoo Kim",
title = "An Analysis of Proxy Signatures: Is a Secure Channel
Necessary?",
crossref = "Joye:2003:TCC",
pages = "68--79",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Lee:2003:BRBa,
author = "Andrew C. Lee",
title = "Book Review: {{\booktitle{Introduction to
Cryptography}}, by Johannes A. Buchmann. Springer
Verlag, 2001}",
journal = j-SIGACT,
volume = "34",
number = "4",
pages = "15--17",
month = dec,
year = "2003",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/954092.954095",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:26 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Buchmann:2001:IC,Buchmann:2004:IC}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Lee:2003:BRBb,
author = "Andrew C. Lee",
title = "Book Review: {{\booktitle{Modern Cryptography,
Probabilistic Proofs and Pseudorandomness Algorithms
and Combinatorics}}, vol 17, by Oded Goldreich.
Springer Verlag, 1999}",
journal = j-SIGACT,
volume = "34",
number = "4",
pages = "32--34",
month = dec,
year = "2003",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/954092.954099",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:26 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Goldreich:1999:MCP}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Lee:2003:CPK,
author = "Eonkyung Lee and Je Hong Park",
title = "Cryptanalysis of the Public-Key Encryption Based on
Braid Groups",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "477--490",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_30",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_30.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@MastersThesis{Lee:2003:CS,
author = "Michael Lee",
title = "Cryptanalysis of the {SIGABA}",
type = "{Master of Science in Computer Science}",
school = "Department of Computer Science, University of
California, Santa Barbara",
address = "Santa Barbara, CA, USA",
pages = "viii + 49",
month = jun,
year = "2003",
bibdate = "Mon Sep 15 11:52:44 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "ucsb.curby.net/broadcast/thesis/thesis.pdf",
acknowledgement = ack-nhfb,
remark = "From the last lines of the conclusion: ``The
cryptosystem model used for the cryptanalysis is
general enough that defeating it not only defeats the
SIGABA, but also defeats any cryptosystem where the
rotors move according to any pseudorandom source.
Lastly, methods that can be used to extend these
attacks were considered. As a result of this work, the
SIGABA and related rotor-based cryptosystems can be
considered compromised.''",
}
@Article{Lee:2003:NKA,
author = "Cheng-Chi Lee and Min-Shiang Hwang and Li-Hua Li",
title = "A new key authentication scheme based on discrete
logarithms",
journal = j-APPL-MATH-COMP,
volume = "139",
number = "2--3",
pages = "343--349",
day = "15",
month = jul,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:40:58 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2003:PKB,
author = "M. C. Lee and Chun-Kan Fung",
title = "A public-key based authentication and key
establishment protocol coupled with a client puzzle",
journal = j-J-AM-SOC-INF-SCI-TECHNOL,
volume = "54",
number = "9",
pages = "810--823",
month = jul,
year = "2003",
CODEN = "JASIEF",
DOI = "https://doi.org/10.1002/asi.10253",
ISSN = "1532-2882 (print), 1532-2890 (electronic)",
ISSN-L = "1532-2882",
bibdate = "Fri Sep 11 10:42:13 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jasist.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science and Technology: JASIST",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1532-2890",
onlinedate = "7 May 2003",
}
@Article{Lee:2003:PSAa,
author = "Sung-Woon Lee and Woo-Hun Kim and Hyun-Sung Kim and
Kee-Young Yoo",
title = "Parallizable simple authenticated key agreement
protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "13--18",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lee:2003:PSAb,
author = "Sung-Woon Lee and Woo-Hun Kim and Hyun-Sung Kim and
Kee-Young Yoo",
title = "Parallizable simple authenticated key agreement
protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "17--22",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Li:2003:SCE,
author = "Shujun Li and Xuanqin Mou and Yuanlong Cai and Zhen Ji
and Jihong Zhang",
title = "On the security of a chaotic encryption scheme:
problems with computerized chaos in finite computing
precision",
journal = j-COMP-PHYS-COMM,
volume = "153",
number = "1",
pages = "52--58",
day = "1",
month = jun,
year = "2003",
CODEN = "CPHCBZ",
DOI = "https://doi.org/10.1016/S0010-4655(02)00875-5",
ISSN = "0010-4655 (print), 1879-2944 (electronic)",
ISSN-L = "0010-4655",
bibdate = "Tue Feb 14 07:56:28 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0010465502008755",
acknowledgement = ack-nhfb,
fjournal = "Computer Physics Communications",
journal-URL = "http://www.sciencedirect.com/science/journal/00104655",
}
@Article{Lin:2003:DBI,
author = "S. D. Lin and S. C. Shie and C. F. Chen",
title = "A {DCT}-Based Image Watermarking With Threshold
Embedding",
journal = j-INT-J-COMPUT-APPL,
volume = "25",
number = "2",
pages = "130--135",
year = "2003",
DOI = "https://doi.org/10.1080/1206212X.2003.11441694",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:20:50 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2003.11441694",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Lin:2003:NRU,
author = "Iuon-Chang Lin and Min-Shiang Hwang and Li-Hua Li",
title = "A new remote user authentication scheme for
multi-server architecture",
journal = j-FUT-GEN-COMP-SYS,
volume = "19",
number = "1",
pages = "13--22",
month = jan,
year = "2003",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Jan 10 10:03:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Lin:2003:PAS,
author = "Chun-Li Lin and Tzonelih Hwang",
title = "A password authentication scheme with secure password
updating",
journal = j-COMPUT-SECUR,
volume = "22",
number = "1",
pages = "68--72",
month = jan,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803001147",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lin:2003:SEOa,
author = "Chih-Wei Lin and Jau-Ji Shen and Min-Shiang Hwang",
title = "Security enhancement for {Optimal Strong-Password
Authentication} protocol",
journal = j-OPER-SYS-REV,
volume = "37",
number = "2",
pages = "7--12",
month = apr,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lin:2003:SEOb,
author = "Chih-Wei Lin and Jau-Ji Shen and Min-Shiang Hwang",
title = "Security enhancement for {Optimal Strong-Password
Authentication Protocol}",
journal = j-OPER-SYS-REV,
volume = "37",
number = "3",
pages = "12--16",
month = jul,
year = "2003",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lindell:2003:SCC,
author = "Yehuda Lindell",
title = "A Simpler Construction of {CCA2}-Secure Public-Key
Encryption under General Assumptions",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "241--254",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_15",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:24 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_15.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lutz:2003:BLF,
author = "Michael J. Lutz",
title = "Bookshelf: Laying the Foundation for Pervasive
Computing [{Pervasive Computing}]; Integrated Approach
to Data Handling [{Exploratory Data Mining and Data
Cleaning}]; Making Theory Practical [{Modern
Cryptography: Theory and Practice}]; Detailed Look at
Systems Testing [{Testing of Digital Systems}]",
journal = j-COMPUTER,
volume = "36",
number = "10",
pages = "102--102",
month = oct,
year = "2003",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:53:58 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2003/10/rx102.htm;
http://www.computer.org/computer/co2003/rx102.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{MacDonald:2003:CDS,
author = "Matthew MacDonald and Erik Johansson",
title = "{C\#} data security handbook",
publisher = pub-WROX,
address = pub-WROX:adr,
pages = "vii + 356",
year = "2003",
ISBN = "1-86100-801-5 (paperback)",
ISBN-13 = "978-1-86100-801-5 (paperback)",
LCCN = "????",
bibdate = "Tue Mar 14 09:53:08 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.nls.uk:7290/voyager",
acknowledgement = ack-nhfb,
subject = "C\# [C-sharp] (computer programming language);
Cryptography; Computer security",
}
@InProceedings{Malone-Lee:2003:TBO,
author = "John Malone-Lee and Wenbo Mao",
title = "Two Birds One Stone: Signcryption Using {RSA}",
crossref = "Joye:2003:TCC",
pages = "211--225",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Book{Maltoni:2003:HFR,
author = "Davide Maltoni and Dario Maio and Anil K. Jain and
Salil Prabhakar",
title = "Handbook of fingerprint recognition",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 348",
year = "2003",
ISBN = "0-387-95431-7",
ISBN-13 = "978-0-387-95431-8",
LCCN = "HV6074 .H25 2003",
bibdate = "Fri Mar 05 18:47:40 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Includes DVD-ROM.",
price = "US\$59.95",
series = "Springer professional computing",
acknowledgement = ack-nhfb,
subject = "Fingerprints; Identification; Classification",
}
@Article{Markowitch:2003:CWV,
author = "Olivier Markowitch and Shahrokh Saeednia",
title = "Cryptanalysis of the {Wu--Varadhrajan} fair exchange
protocol",
journal = j-INFO-PROC-LETT,
volume = "87",
number = "3",
pages = "169--171",
day = "16",
month = aug,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:32 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Matyas:2003:TRU,
author = "V{\'a}clav {Maty{\'a}s, Jr.} and Zdenek Riha",
title = "Toward Reliable User Authentication through
Biometrics",
journal = j-IEEE-SEC-PRIV,
volume = "1",
number = "3",
pages = "45--49",
month = may # "\slash " # jun,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSECP.2003.1203221",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Jun 14 14:56:19 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/sp/books/sp2003/pdf/j3045.pdf;
http://www.computer.org/security/j3045abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Maurer:2003:SMR,
author = "Ueli Maurer and Krzysztof Pietrzak",
title = "The Security of Many-Round {Luby--Rackoff}
Pseudo-Random Permutations",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "544--561",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_34",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_34.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@Book{McClure:2003:HEN,
author = "Stuart McClure and Joel Scambray and George Kurtz",
title = "Hacking exposed: network security secrets and
solutions",
publisher = pub-OSBORNE-MCGRAW-HILL,
address = pub-OSBORNE-MCGRAW-HILL:adr,
edition = "Fourth",
pages = "xxiv + 737",
year = "2003",
ISBN = "0-07-222742-7",
ISBN-13 = "978-0-07-222742-0",
LCCN = "TK5105359 .M48 2003",
bibdate = "Thu Jun 23 18:36:06 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/queue.bib;
z3950.loc.gov:7090/Voyager",
URL = "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
http://www.loc.gov/catdir/bios/mh051/2004351501.html;
http://www.loc.gov/catdir/description/mh051/2004351501.html;
http://www.loc.gov/catdir/toc/mh051/2004351501.html",
acknowledgement = ack-nhfb,
remark = "Previous ed.: 2001. Casing the establishment ---
System hacking --- Network hacking --- Software hacking
--- Appendixes.",
subject = "Computer networks; Security measures; Data protection;
Computer security",
}
@Article{McNichol:2003:HTM,
author = "Tom McNichol",
title = "How two math geeks with a lava lamp and a webcam are
about to unleash chaos on the {Internet}",
journal = j-WIRED,
volume = "11",
number = "8",
pages = "??--??",
month = aug,
year = "2003",
CODEN = "WREDEM",
ISSN = "1059-1028 (print), 1078-3148 (electronic)",
ISSN-L = "1059-1028",
bibdate = "Sat Aug 23 07:53:02 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.lavarnd.org;
http://www.wired.com/wired/archive/11.08/random.html",
acknowledgement = ack-nhfb,
fjournal = "Wired",
keywords = "lavarand (US Patent 5,732,138: Method for seeding a
pseudo-random number generator with a cryptographic
hash of a digitization of a chaotic system); LavaRnd",
}
@Book{Mena:2003:IDM,
author = "Jes{\'u}s Mena",
title = "Investigative data mining for security and criminal
detection",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xvi + 452",
year = "2003",
ISBN = "0-7506-7613-2",
ISBN-13 = "978-0-7506-7613-7",
LCCN = "QA76.9.D343 M44 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
}
@Article{Mercuri:2003:IRS,
author = "Rebecca T. Mercuri and Peter G. Neumann",
title = "Inside risks: Security by obscurity",
journal = j-CACM,
volume = "46",
number = "11",
pages = "160--160",
month = nov,
year = "2003",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Oct 28 14:25:09 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Micciancio:2003:SZK,
author = "Daniele Micciancio and Salil P. Vadhan",
title = "Statistical Zero-Knowledge Proofs with Efficient
Provers: Lattice Problems and More",
crossref = "Boneh:2003:ACC",
pages = "282--298",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Miklau:2003:CAP,
author = "Gerome Miklau and Dan Suciu",
title = "Controlling Access to Published Data Using
Cryptography",
crossref = "Freytag:2003:VPI",
pages = "898--909",
year = "2003",
bibdate = "Mon Dec 22 18:34:17 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.vldb.org/dblp/db/conf/vldb/vldb2003.html",
URL = "http://www.vldb.org/dblp/db/indices/a-tree/m/Miklau:Gerome.html",
acknowledgement = ack-nhfb,
authorurl = "http://www.vldb.org/dblp/db/indices/a-tree/m/Miklau:Gerome.html;
http://www.vldb.org/dblp/db/indices/a-tree/s/Suciu:Dan.html",
}
@Article{Millen:2003:FD,
author = "Jonathan Millen",
title = "On the freedom of decryption",
journal = j-INFO-PROC-LETT,
volume = "86",
number = "6",
pages = "329--333",
day = "30",
month = jun,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:32 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Minkel:2003:CTT,
author = "J. R. Minkel",
title = "Could trapping tiny ions crack the toughest codes?",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "3",
pages = "31--32",
month = mar,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1184445",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Calcium; Concrete; Deutsch-Jozsa algorithm; Electron
traps; encrypted data; encryption systems; Energy
states; gigantic numbers factoring; Inductors;
ion-trapping technique; large-scale quantum computing;
Large-scale systems; Light scattering; Optical pulses;
particle traps; quantum algorithm; quantum
calculations; quantum computing; Quantum computing;
quantum cryptography; quantum mechanics; Quantum
mechanics; qubits; tuned laser pulses; very cold
calcium ion",
}
@Book{Mohay:2003:CIF,
editor = "George M. Mohay and Alison Anderson and Byron Collie
and Olivier de Vel and Rod McKemmish",
title = "Computer and intrusion forensics",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "xxi + 395",
year = "2003",
ISBN = "1-58053-369-8",
ISBN-13 = "978-1-58053-369-0",
LCCN = "QA76.9.A25 C628 2003",
bibdate = "Thu Jun 23 18:36:10 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Artech House computer security series",
acknowledgement = ack-nhfb,
subject = "Computer security; Data protection; Forensic
sciences",
}
@InProceedings{Moller:2003:PSP,
author = "Bodo M{\"o}ller",
title = "Provably Secure Public-Key Encryption for
Length-Preserving {Chaumian} Mixes",
crossref = "Joye:2003:TCC",
pages = "244--262",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Book{Mollin:2003:RPK,
author = "Richard A. Mollin",
title = "{RSA} and Public-Key Cryptography",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xii + 291",
year = "2003",
ISBN = "1-58488-338-3",
ISBN-13 = "978-1-58488-338-8",
LCCN = "QA268 .M655 2003",
bibdate = "Wed Aug 11 08:37:57 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$79.95",
acknowledgement = ack-nhfb,
}
@Article{Monniaux:2003:ACP,
author = "David Monniaux",
title = "Abstracting cryptographic protocols with tree
automata",
journal = j-SCI-COMPUT-PROGRAM,
volume = "47",
number = "2--3",
pages = "177--202",
month = may # "\slash " # jun,
year = "2003",
CODEN = "SCPGD4",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Sun Jan 11 10:42:03 MST 2004",
bibsource = "http://www.elsevier.com/locate/issn/01676423;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423",
remark = "Special Issue on Static Analysis (SAS'99).",
}
@InProceedings{Montgomery:2003:FEC,
author = "Peter L. Montgomery {Kirsten Eisentr{\"a}ger, Kristin
Lauter}",
title = "Fast Elliptic Curve Arithmetic and Improved {Weil}
Pairing Evaluation",
crossref = "Joye:2003:TCC",
pages = "343--354",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Morris:2003:KKL,
author = "James Morris",
title = "Kernel Korner: The {Linux} Kernel Cryptographic
{API}",
journal = j-LINUX-J,
volume = "108",
pages = "??--??",
month = apr,
year = "2003",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Apr 12 06:59:06 MDT 2003",
bibsource = "http://noframes.linuxjournal.com/lj-issues/issue108/index.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/linux-journal.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Book{Morrow:2003:DIB,
author = "Monique Morrow and Kateel Vijayananda",
title = "Developing {IP}-based services: solutions for service
providers and vendors",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "xxi + 313",
year = "2003",
ISBN = "1-55860-779-X",
ISBN-13 = "978-1-55860-779-8",
LCCN = "TK5105.5 .M72 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
}
@Book{Mrayati:2003:AKT,
editor = "M. Mrayati and Y. Meer Alam and M. H. at-Tayyan",
title = "{Al-Kindi}'s treatise on cryptanalysis",
volume = "1",
publisher = "KFCRIS \& KACST",
address = "Riyadh, Saudi Arabia",
pages = "204",
year = "2003",
ISBN = "9960-890-08-2",
ISBN-13 = "978-9960-890-08-1",
LCCN = "????",
bibdate = "Thu May 12 06:53:13 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "{Arabic} origins of cryptology",
acknowledgement = ack-nhfb,
keywords = "cryptography / Arab countries / history",
}
@Article{Naik:2003:DSW,
author = "Vinayak Naik and Anish Arora and Sandip Bapat and
Mohamed Gouda",
title = "Dependable Systems: Whisper: Local Secret Maintenance
in Sensor Networks",
journal = j-IEEE-DISTRIB-SYST-ONLINE,
volume = "4",
number = "9",
year = "2003",
CODEN = "????",
ISSN = "1541-4922 (print), 1558-1683 (electronic)",
ISSN-L = "1541-4922",
bibdate = "Sat Jan 03 14:59:06 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dsonline.computer.org/0309/f/gaep.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Distributed Systems Online",
}
@InProceedings{Naor:2003:CAC,
author = "Moni Naor",
title = "On Cryptographic Assumptions and Challenges",
crossref = "Boneh:2003:ACC",
pages = "96--109",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Naor:2003:CFP,
author = "Dalit Naor and Moni Naor",
title = "Cover Feature: Protecting cryptographic keys: the
trace-and-revoke approach",
journal = j-COMPUTER,
volume = "36",
number = "7",
pages = "47--53",
month = jul,
year = "2003",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:53:43 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2003/07/r7047.htm;
http://csdl.computer.org/dl/mags/co/2003/07/r7047.pdf;
http://www.computer.org/computer/co2003/r7047abs.htm",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Neve:2003:STF,
author = "Amaury N{\`e}ve and Denis Flandre and Jean-Jacques
Quisquater",
title = "{SOI} Technology for Future High-Performance Smart
Cards",
journal = j-IEEE-MICRO,
volume = "23",
number = "3",
pages = "58--67",
month = may # "\slash " # jun,
year = "2003",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2003.1209467",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Thu Jun 26 05:36:42 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/mi/2003/03/m3058abs.htm;
http://csdl.computer.org/dl/mags/mi/2003/03/m3058.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Nisley:2003:ELH,
author = "E. Nisley",
title = "{Ed} looks at the history of cryptography and examines
what it means for embedded systems developers
programming in {Java} today",
journal = j-DDJ,
volume = "28",
number = "11",
pages = "73--75",
year = "2003",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Tue Nov 4 05:29:15 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@TechReport{NIST:2003:RKE,
author = "{NIST}",
title = "Recommendation on Key Establishment Schemes",
type = "NIST Special Publication",
number = "800-56",
institution = pub-NIST,
address = pub-NIST:adr,
edition = "Draft 2.0",
month = jan,
year = "2003",
bibdate = "Wed Apr 20 12:14:29 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/CryptoToolkit/kms/keyschemes-Jan03.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Oechslin:2003:MFC,
author = "Philippe Oechslin",
title = "Making a Faster Cryptanalytic Time-Memory Trade-Off",
crossref = "Boneh:2003:ACC",
pages = "617--630",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Okeya:2003:MFC,
author = "Katsuyuki Okeya and Tsuyoshi Takagi",
title = "A More Flexible Countermeasure against Side Channel
Attacks Using Window Method",
crossref = "Walter:2003:CHE",
pages = "397--410",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Okeya:2003:WNM,
author = "Katsuyuki Okeya and Tsuyoshi Takagi",
title = "The Width-$w$ {NAF} Method Provides Small Memory and
Fast Elliptic Scalar Multiplications Secure against
Side Channel Attacks",
crossref = "Joye:2003:TCC",
pages = "328--342",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Book{Olson:2003:QHK,
author = "Lynne Olson and Stanley Cloud",
title = "A question of honor: the {Ko{\'s}ciuszko Squadron}:
forgotten heroes of {World War II}",
publisher = "Knopf",
address = "New York, NY, USA",
pages = "xii + 495",
year = "2003",
ISBN = "0-375-41197-6",
ISBN-13 = "978-0-375-41197-7",
LCCN = "D786 .O57 2003",
bibdate = "Thu Feb 23 07:25:37 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/random051/2002044826.html;
http://www.loc.gov/catdir/description/random0414/2002044826.html;
http://www.loc.gov/catdir/samples/random045/2002044826.html",
acknowledgement = ack-nhfb,
subject = "Air pilots, Military; Poland; History; 20th century;
World War, 1939--1945; Regimental histories; Great
Britain; Aerial operations, Polish; Aerial operations,
British; Forced repatriation",
}
@InProceedings{Ors:2003:PAA,
author = "S{\i}dd{\i}ka Berna {\"O}rs and Elisabeth Oswald and
Bart Preneel",
title = "Power-Analysis Attacks on an {FPGA} --- First
Experimental Results",
crossref = "Walter:2003:CHE",
pages = "35--50",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Paeng:2003:SCU,
author = "Seong-Hun Paeng",
title = "On the security of cryptosystem using automorphism
groups",
journal = j-INFO-PROC-LETT,
volume = "88",
number = "6",
pages = "293--298",
day = "31",
month = dec,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:33 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Page:2003:BRW,
author = "Sophie Page",
title = "Book Review: {William R. Newman and Anthony Grafton
(eds.), Secrets of Nature: Astrology and Alchemy in
Early Modern Europe. Transformations: Studies in the
History of Science and Technology. Cambridge, MA and
London: MIT Press, 2001. Pp. 443. ISBN 0-262-14075-6.
\pounds 34.50 (hardcover)}",
journal = j-BRITISH-J-HIST-SCI,
volume = "36",
number = "1",
pages = "87--127",
month = mar,
year = "2003",
CODEN = "BJHSAT",
DOI = "https://doi.org/10.1017/S0007087403254972",
ISSN = "0007-0874 (print), 1474-001X (electronic)",
ISSN-L = "0007-0874",
bibdate = "Sat Oct 2 10:06:46 MDT 2010",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=BJH;
https://www.math.utah.edu/pub/tex/bib/bjhs2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jstor.org/stable/4028320",
acknowledgement = ack-nhfb,
fjournal = "British Journal for the History of Science",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=BJH",
}
@Article{Park:2003:EMS,
author = "Jung Min Park and Edwin K. P. Chong and Howard Jay
Siegel",
title = "Efficient multicast stream authentication using
erasure codes",
journal = j-TISSEC,
volume = "6",
number = "2",
pages = "258--285",
month = may,
year = "2003",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Aug 7 09:02:37 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Park:2003:ESA,
author = "Yongsu Park and Tae-Sun Chung and Yookun Cho",
title = "An efficient stream authentication scheme using tree
chaining",
journal = j-INFO-PROC-LETT,
volume = "86",
number = "1",
pages = "1--8",
day = "15",
month = apr,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:31 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Pass:2003:DCR,
author = "Rafael Pass",
title = "On Deniability in the Common Reference String and
Random Oracle Model",
crossref = "Boneh:2003:ACC",
pages = "316--337",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Patarin:2003:LRR,
author = "Jacques Patarin",
title = "{Luby--Rackoff}: $7$ Rounds Are Enough for Security",
crossref = "Boneh:2003:ACC",
pages = "513--529",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Paulson:2003:NBV,
author = "Linda Dailey Paulson",
title = "News Briefs: Vendors Push Wireless {LAN} security;
Picturing a new encryption technique; Think tank
targets better software",
journal = j-COMPUTER,
volume = "36",
number = "1",
pages = "28--30",
month = jan,
year = "2003",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Dec 12 19:31:55 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2003/01/r1028.htm;
http://csdl.computer.org/dl/mags/co/2003/01/r1028.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Pelzl:2003:HCC,
author = "Jan Pelzl and Thomas Wollinger and Jorge Guajardo and
Christof Paar",
title = "Hyperelliptic Curve Cryptosystems: {Closing} the
Performance Gap to Elliptic Curves",
crossref = "Walter:2003:CHE",
pages = "351--365",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Pereira:2003:SAU,
author = "Olivier Pereira and Jean-Jacques Quisquater",
title = "Some attacks upon authenticated group key agreement
protocols",
journal = j-J-COMP-SECUR,
volume = "11",
number = "4",
pages = "555--580",
month = "????",
year = "2003",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2003-11404",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:14 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Perrine:2003:ECP,
author = "Tom Perrine",
title = "The End of {{\tt crypt()}} Passwords \ldots{}
Please?",
journal = j-LOGIN,
volume = "28",
number = "6",
pages = "??--??",
month = dec,
year = "2003",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:52:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.usenix.org/publications/login/2003-12/index.html",
URL = "http://www.usenix.org/publications/login/2003-12/pdfs/perrine.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@Article{Petullo:2003:IEH,
author = "Mike Petullo",
title = "Implementing encrypted home directories",
journal = j-LINUX-J,
volume = "2003",
number = "112",
pages = "1--1",
month = aug,
year = "2003",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:45:48 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Book{Pfleeger:2003:SC,
author = "Charles P. Pfleeger and Shari Lawrence Pfleeger",
title = "Security in computing",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
edition = "Third",
pages = "xxix + 746",
year = "2003",
ISBN = "0-13-035548-8",
ISBN-13 = "978-0-13-035548-5",
LCCN = "QA76.9.A25 P45 2003",
bibdate = "Thu Dec 14 18:04:33 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Data protection; Privacy, Right
of",
}
@Book{Pieprzyk:2003:FCS,
author = "Josef Pieprzyk and Thomas Hardjono and Jennifer
Seberry",
title = "Fundamentals of computer security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xx + 677",
year = "2003",
ISBN = "3-540-43101-2",
ISBN-13 = "978-3-540-43101-5",
LCCN = "QA76.9.A25 P536 2003",
bibdate = "Fri Mar 05 18:22:06 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$69.95",
series = "Monographs in theoretical computer science",
acknowledgement = ack-nhfb,
}
@TechReport{Pinkas:2003:CTP,
author = "Benny Pinkas",
title = "Cryptographic techniques for privacy-preserving data
mining",
type = "Report",
number = "HPL-2003-22",
institution = "Trusted Systems Laboratory, HP Laboratories Palo
Alto",
address = "Palo Alto, CA, USA",
day = "29",
month = jan,
year = "2003",
bibdate = "Sat Sep 17 11:00:25 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "To be published in SIGKDD Explorations, Volume 4,
Issue 2.",
URL = "http://www.hpl.hp.com/techreports/2003/HPL-2003-22.html",
abstract = "Research in secure distributed computation, which was
done as part of a larger body of research in the theory
of cryptography, has achieved remarkable results. It
was shown that non-trusting parties can jointly compute
functions of their different inputs while ensuring that
no party learns anything but the defined output of the
function. These results were shown using generic
constructions that can be applied to any function that
has an efficient representation as a circuit. We
describe these results, discuss their efficiency, and
demonstrate their relevance to privacy preserving
computation of data mining algorithms. We also show
examples of secure computation of data mining
algorithms that use these generic constructions.",
acknowledgement = ack-nhfb,
keywords = "cryptography; data mining; privacy",
}
@Article{Piper:2003:RCS,
author = "Fred Piper",
title = "Reseacrh in cryptography and security mechanisms",
journal = j-COMPUT-SECUR,
volume = "22",
number = "1",
pages = "22--25",
month = jan,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:50 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803001044",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Piret:2003:DFA,
author = "Gilles Piret and Jean-Jacques Quisquater",
title = "A Differential Fault Attack Technique against {SPN}
Structures, with Application to the {AES} and
{KHAZAD}",
crossref = "Walter:2003:CHE",
pages = "77--88",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Polk:2003:IIC,
author = "William T. Polk and Nelson E. Hastings and Ambarish
Malpani",
title = "{IEEE Internet} Computing: Security Track: Public Key
Infrastructures that Satisfy Security Goals",
journal = j-IEEE-DISTRIB-SYST-ONLINE,
volume = "4",
number = "7",
year = "2003",
CODEN = "????",
ISSN = "1541-4922 (print), 1558-1683 (electronic)",
ISSN-L = "1541-4922",
bibdate = "Sat Jan 03 14:59:06 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dsonline.computer.org/0307/f/wp4sec.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Distributed Systems Online",
}
@Book{Poole:2003:NSP,
author = "Owen Poole",
title = "Network Security: a Practical Guide",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xi + 212",
year = "2003",
ISBN = "0-7506-5033-8",
ISBN-13 = "978-0-7506-5033-5",
LCCN = "TK5105.59 .P66 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$47.95",
URL = "http://www.loc.gov/catdir/description/els051/2004315747.html;
http://www.loc.gov/catdir/toc/els051/2004315747.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer networks; Security
measures",
}
@Book{Potter:2003:S,
author = "Bruce Potter and Bob Fleck",
title = "802.11 Security",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xiii + 176",
year = "2003",
ISBN = "0-596-00290-4",
ISBN-13 = "978-0-596-00290-9",
LCCN = "TK5105.78 .P68 2003",
bibdate = "Mon Apr 18 15:04:48 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$34.95, CDN\$54.95, UK\pounds 24.95",
URL = "http://www.oreilly.com/catalog/80211security/",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Wireless
communication systems; Security measures; IEEE 802.11
(Standard)",
}
@Article{Potter:2003:WAO,
author = "Bruce Potter",
title = "Wireless authentication options for up and down the
{Stack}",
journal = j-NETWORK-SECURITY,
volume = "2003",
number = "6",
pages = "4--5",
month = jun,
year = "2003",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(03)00607-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:46 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580300607X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Provos:2003:HSI,
author = "Niels Provos and Peter Honeyman",
title = "Hide and Seek: An Introduction to Steganography",
journal = j-IEEE-SEC-PRIV,
volume = "1",
number = "3",
pages = "32--44",
month = may # "\slash " # jun,
year = "2003",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSECP.2003.1203220",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Sat Jun 14 14:56:19 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://dlib.computer.org/sp/books/sp2003/pdf/j3032.pdf;
http://www.computer.org/security/j3032abs.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Pucella:2003:JRB,
author = "Riccardo Pucella",
title = "Joint review of {{\booktitle{Foundations of
Cryptography: Basic Tools}}, by O. Goldreich. Cambridge
University Press, and \booktitle{Modelling and Analysis
of Security Protocols}, by P. Ryan and S. Schneider.
Addison Wesley}",
journal = j-SIGACT,
volume = "34",
number = "4",
pages = "26--31",
month = dec,
year = "2003",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/954092.954098",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:26 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Goldreich:2001:FCBa}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Rafaeli:2003:SKM,
author = "Sandro Rafaeli and David Hutchison",
title = "A survey of key management for secure group
communication",
journal = j-COMP-SURV,
volume = "35",
number = "3",
pages = "309--329",
month = sep,
year = "2003",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/937503.937506",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:19:22 MDT 2008",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Group communication can benefit from IP multicast to
achieve scalable exchange of messages. However, there
is a challenge of effectively controlling access to the
transmitted data. IP multicast by itself does not
provide any mechanisms for preventing nongroup members
to have access to the group communication. Although
encryption can be used to protect messages exchanged
among group members, distributing the cryptographic
keys becomes an issue. Researchers have proposed
several different approaches to group key management.
These approaches can be divided into three main
classes: centralized group key management protocols,
decentralized architectures and distributed key
management protocols. The three classes are described
here and an insight given to their features and goals.
The area of group key management is then surveyed and
proposed solutions are classified according to those
characteristics.",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Group Key Distribution; Multicast Security",
}
@Book{Rankl:2003:SCH,
author = "W. (Wolfgang) Rankl and W. Effing",
title = "Smart Card Handbook",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Third",
pages = "1120",
year = "2003",
ISBN = "",
ISBN-13 = "",
LCCN = "",
bibdate = "Mon Dec 22 12:08:12 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Ratner:2003:NGI,
author = "Daniel Ratner and Mark Ratner",
title = "Nanotechnology: a gentle introduction to the next big
idea",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "xiv + 188",
year = "2003",
ISBN = "0-13-101400-5",
ISBN-13 = "978-0-13-101400-8",
LCCN = "T174.7 .R38 2003",
bibdate = "Tue Nov 04 17:58:25 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Ratner:2003:NHS,
author = "Daniel Ratner and Mark Ratner",
title = "Nanotechnology and Homeland Security: New Weapons for
New Wars",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "176 (est.)",
year = "2003",
ISBN = "0-13-145307-6",
ISBN-13 = "978-0-13-145307-4",
LCCN = "UA927.R38 2004",
bibdate = "Tue Nov 04 17:54:51 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$24.95",
acknowledgement = ack-nhfb,
annote = "Daniel Ratner is an engineer and technology
entrepreneur who has founded three startup firms,
including Driveitaway.com, where he currently serves as
CTO. He is also an industry advisor to several other
high-tech ventures, and was recently awarded the
prestigious ``30 Under 30'' entrepreneurs' award by
Philly Tech Magazine.\par
Mark A. Ratner is Charles E. and Emma H. Morrison
Professor in Chemistry at Northwestern University. With
Ari Aviram, he originated the field of molecular-scale
electronics. Ratner won the 2001 Feynman Prize in
Nanotechnology for theoretical achievements that have
advanced the development of molecular nanotechnology.",
}
@Article{Reese:2003:ELD,
author = "R. A. Reese",
title = "Extreme lawsuits [digital copyright]",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "5",
pages = "23--25",
month = may,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1197471",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Broadcasting; business developments; Cities and towns;
consumer electronics products design; copyright;
copyright owners; copyright violations liability;
Cryptography; Digital audio players; digital copyright;
digital systems; digital technology; DVD; encryption;
entertainment; Law; lawsuits; Legal factors;
legislation; Motion pictures; Permission; Protection",
}
@InProceedings{Regev:2003:NLB,
author = "Oded Regev",
title = "New lattice based cryptographic constructions",
crossref = "ACM:2003:PTF",
pages = "407--416",
year = "2003",
bibdate = "Tue Jan 13 06:21:07 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Renner:2003:NBS,
author = "Renato Renner and Stefan Wolf",
title = "New Bounds in Secret-Key Agreement: The Gap between
Formation and Secrecy Extraction",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2656",
pages = "562--577",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/3-540-39200-9_35",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Nov 30 11:39:42 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2003a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/3-540-39200-9_35.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/3-540-39200-9",
book-URL = "http://www.springerlink.com/content/978-3-540-39200-2",
fjournal = "Lecture Notes in Computer Science",
}
@InProceedings{Renner:2003:UAP,
author = "Renato Renner and Stefan Wolf",
title = "Unconditional Authenticity and Privacy from an
Arbitrarily Weak Secret",
crossref = "Boneh:2003:ACC",
pages = "78--95",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Reyhani-Masoleh:2003:LCB,
author = "Arash Reyhani-Masoleh and M. Anwar Hasan",
title = "On Low Complexity Bit Parallel Polynomial Basis
Multipliers",
crossref = "Walter:2003:CHE",
pages = "189--202",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Reyhani-Masoleh:2003:LCS,
author = "Arash Reyhani-Masoleh and M. Anwar Hasan",
title = "Low complexity sequential normal basis multipliers
over {$ \mathrm {GF}(2^m) $}",
crossref = "Bajard:2003:ISC",
pages = "188--195",
year = "2003",
bibdate = "Wed Nov 26 12:04:35 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
URL = "http://www.acsel-lab.com/arithmetic/arith16/papers/ARITH16_Reyhani-Masoleh.pdf",
abstract = "For efficient hardware implementation of finite field
arithmetic units, the use of a normal basis is
advantageous. In this article, two architectures for
multipliers over the finite field $ \mathrm {GF}(2^m) $
are proposed. Both of these multipliers are of
sequential type --- after receiving the coordinates of
the two input field elements, they go through $m$
iterations (or clock cycles) to finally yield all the
coordinates of the product in parallel. These
multipliers are highly area efficient and require fewer
number of logic gates even when compared with the most
area efficient multiplier available in the open
literature. This makes the proposed multipliers
suitable for applications where the value of is large
but space is of concern, e.g., resource constrained
cryptographic systems. Additionally, the AND gate count
for one of the multipliers is $ \floor {m / 2} + 1 $
only. This implies that if the multiplication over $
\mathrm {GF}(2^m) $ is performed using a suitable
subfield $ \mathrm {GF}(2^n) $ where $ n > 1 $ and $ n
| m $, then the corresponding multiplier architecture
will yield a highly efficient digit or word serial
multiplier.",
acknowledgement = ack-nhfb,
keywords = "ARITH-16",
}
@MastersThesis{Rhinelander:2003:DIE,
author = "Jason P. Rhinelander",
title = "Design and implementation of encryption algorithms in
a coarse grain reconfigurable environment",
type = "Thesis ({M. Eng.})",
school = "Memorial University of Newfoundland",
address = "St. Johns, Newfoundland, Canada",
year = "2003",
bibdate = "Wed Sep 28 08:30:29 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Riebeck:2003:SCC,
author = "H. Riebeck",
title = "A second coffin for Chernobyl",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "3",
pages = "30--31",
month = mar,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1184444",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "113 m; 20000 ton; ceiling cranes; Chernobyl Reactor 4;
Concrete; Cryptography; Design engineering; fission
reactor accidents; fission reactor materials; greased
steel plates; Inductors; movable structure; Power
engineering and energy; Power generation; Quantum
computing; Quantum mechanics; radioactive materials
removal; Rain; shielding; Steel; steel shell; steel
structure",
}
@Misc{Rivest:2003:TAL,
author = "Ronald L. Rivest and Adi Shamir and Leonard M.
Adleman",
title = "{2002 Turing Award Lecture}",
howpublished = "World-Wide Web document.",
day = "7",
month = jun,
year = "2003",
bibdate = "Mon Dec 01 14:14:41 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Collection of three slide presentations: ``Pre RSA
Days'' (Adleman), ``Early RSA Days'' (Rivest), ``Turing
Lecture on Cryptology: A Status Report'' (Shamir).",
URL = "http://www.acm.org/awards/turing_citations/rivest-shamir-adleman.html",
acknowledgement = ack-nhfb,
}
@Misc{Rivest:2003:TLE,
author = "Ronald L. Rivest",
title = "{Turing Lecture} on Early {RSA} Days",
howpublished = "World-Wide Web slide presentation, video, and audio.",
year = "2003",
bibdate = "Sat Nov 19 07:46:28 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/turingawardlecture/RSA/",
acknowledgement = ack-nhfb,
}
@Article{Rogaway:2003:OBC,
author = "Phillip Rogaway and Mihir Bellare and John Black",
title = "{OCB}: a block-cipher mode of operation for efficient
authenticated encryption",
journal = j-TISSEC,
volume = "6",
number = "3",
pages = "365--403",
month = aug,
year = "2003",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Dec 22 17:56:09 MST 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Rothe:2003:SFC,
author = "J{\"o}rg Rothe",
title = "Some facets of complexity theory and cryptography: a
five-lecture tutorial",
journal = j-COMP-SURV,
volume = "34",
number = "4",
pages = "504--549",
month = dec,
year = "2003",
CODEN = "CMSVAN",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Aug 7 06:57:01 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Rouvroy:2003:EUF,
author = "G. Rouvroy and F.-X. Standaert and J.-J. Quisquater
and J.-D. Legat",
title = "Efficient uses of {FPGAs} for implementations of {DES}
and its experimental linear cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "473--482",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190588",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190588",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Manual{RSA:2003:PEC,
author = "{RSA Laboratories}",
title = "{PKCS \#13}: Elliptic Curve Cryptography Standard",
organization = pub-RSA,
address = pub-RSA:adr,
year = "2003",
bibdate = "Mon Dec 08 08:20:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Still under development.",
URL = "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-13/index.html",
acknowledgement = ack-nhfb,
}
@InProceedings{Rubin:2003:TBC,
author = "Karl Rubin and Alice Silverberg",
title = "Torus-Based Cryptography",
crossref = "Boneh:2003:ACC",
pages = "349--365",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Book{Salomon:2003:DPS,
author = "David Salomon",
title = "Data Privacy and Security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 465",
year = "2003",
ISBN = "0-387-00311-8",
ISBN-13 = "978-0-387-00311-5",
LCCN = "QA76.9.A25 S265 2003",
bibdate = "Mon Jun 16 18:35:35 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
https://www.math.utah.edu/pub/tex/bib/texbook2.bib",
price = "US\$59.95",
URL = "http://www.booksbydavidsalomon.com/",
abstract = "This integrated volume focuses on keeping data secure
and private and covers classical cryptography, modern
cryptography, and steganography. Each topic is
presented and explained by describing various methods,
techniques, and algorithms. Moreover, there are
numerous helpful examples to reinforce the reader's
understanding and expertise with these techniques and
methodologies.",
acknowledgement = ack-nhfb,
tableofcontents = "Part I: Data Encryption \\
1: Monoalphabetic Substitution Ciphers \\
2: Transposition Ciphers \\
3: Polyalphabetic Substitution Ciphers \\
4: Random Numbers \\
5: The Enigma \\
6: Stream Ciphers \\
7: Block Ciphers \\
8: Public-Key Cryptography \\
9: Quantum Cryptography \\
Part II: Data Hiding \\
10: Data Hiding in Text \\
11: Data Hiding in Images \\
12: Data Hiding: Other Methods \\
Part III: Essential Resources \\
Appendix A: Convolution \\
Appendix B: Hashing \\
Appendix C: Cyclic Redundancy Codes \\
Appendix D: Galois Fields",
}
@Article{Salus:2003:BRBb,
author = "Peter H. Salus",
title = "Book Reviews: The Bookworm: Reviews of {Pavol
Cerven}'s {{\em Crackproof Your Software\/}} and of
{Jenness} and {Cozens}'s {{\em Extending and Embedding
Perl}}",
journal = j-LOGIN,
volume = "28",
number = "2",
pages = "??--??",
month = apr,
year = "2003",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:52:26 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.usenix.org/publications/login/2003-04/index.html",
URL = "http://www.usenix.org/publications/login/2003-04/openpdfs/bookreviews.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@Article{Sarkar:2003:EIC,
author = "P. Sarkar and S. Maitra",
title = "Efficient implementation of cryptographically useful
``large'' {Boolean} functions",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "410--417",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190582",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190582",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Satoh:2003:SDF,
author = "A. Satoh and K. Takano",
title = "A scalable dual-field elliptic curve cryptographic
processor",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "449--460",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190586",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190586",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Satoh:2003:UHA,
author = "Akashi Satoh and Sumio Morioka",
title = "Unified Hardware Architecture for 128-Bit Block
Ciphers {AES} and {Camellia}",
crossref = "Walter:2003:CHE",
pages = "304--318",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Book{Schneier:2003:BFT,
author = "Bruce Schneier",
title = "Beyond fear: thinking sensibly about security in an
uncertain world",
publisher = pub-COPERNICUS,
address = pub-COPERNICUS:adr,
pages = "295",
year = "2003",
ISBN = "0-387-02620-7",
ISBN-13 = "978-0-387-02620-6",
LCCN = "HV6432 .S36 2003",
bibdate = "Thu Aug 21 08:38:41 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Sennewald:2003:ESM,
author = "Charles A. Sennewald",
title = "Effective security management",
publisher = pub-BUTTERWORTH-HEINEMANN,
address = pub-BUTTERWORTH-HEINEMANN:adr,
pages = "xx + 395",
year = "2003",
ISBN = "0-7506-7454-7",
ISBN-13 = "978-0-7506-7454-6",
LCCN = "HV8290 .S46 2003",
bibdate = "Thu Oct 30 07:30:32 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.95",
acknowledgement = ack-nhfb,
}
@Article{Seznec:2003:HUL,
author = "Andr{\'e} Seznec and Nicolas Sendrier",
title = "{HAVEGE}: a user-level software heuristic for
generating empirically strong random numbers",
journal = j-TOMACS,
volume = "13",
number = "4",
pages = "334--346",
month = oct,
year = "2003",
CODEN = "ATMCEZ",
ISSN = "1049-3301 (print), 1558-1195 (electronic)",
ISSN-L = "1049-3301",
bibdate = "Fri Oct 31 05:50:26 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tomacs/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Random numbers with high cryptographic quality are
needed to enhance the security of cryptography
applications. Software heuristics for generating
empirically strong random number sequences rely on
entropy gathering by measuring unpredictable external
events. These generators only deliver a few bits per
event. This limits them to being used as seeds for
pseudorandom generators. General-purpose processors
feature a large number of hardware mechanisms that aim
to improve performance: caches, branch predictors,
\ldots{}. The state of these components is not
architectural (i.e., the result of an ordinary
application does not depend on it). It is also volatile
and cannot be directly monitored by the user. On the
other hand, every operating system interrupt modifies
thousands of these binary volatile states. In this
article, we present and analyze HAVEGE (HArdware
Volatile Entropy Gathering and Expansion), a new
user-level software heuristic to generate practically
strong random numbers on general-purpose computers. The
hardware clock cycle counter of the processor can be
used to gather part of the entropy\slash uncertainty
introduced by operating system interrupts in the
internal states of the processor. Then, we show how
this entropy gathering technique can be combined with
pseudorandom number generation in HAVEGE. Since the
internal state of HAVEGE includes thousands of internal
volatile hardware states, it seems impossible even for
the user itself to reproduce the generated sequences.",
acknowledgement = ack-nhfb,
annote = "From the article: ``On current PCs and workstations,
the HAVEG algorithms collects several tens of thousands
of empirically strong random bits, on average, per
every operating system interrupt, that is, HAVEG is
three to four orders of magnitude more efficient than
previous software entropy gathering
techniques.\par
\ldots{}\par
\ldots{} on all the target platforms of HAVEGE in 2002
[Seznec and Sendrier 2002], the HAVEG algorithm
illustrated in Figure 1 allows to gather at least
8K--64K random bits in average per operating system
interrupt (from 8K on Itanium/Linux to 64K on
Solaris/UltraSparc II). That is, at least three to four
orders of magnitude more than the `entropy' gathered by
previously available entropy-gathering
techniques.\par
\ldots{}\par
In average on Pentium III, 920 million $ \pm 5 \% $
cycles were needed to collect 32 Mbytes of random
numbers, while on the UltraSparc II, 500 million $ \pm
5 \% $ cycles were sufficient. This throughput is in
the same range as the throughput of standard
pseudorandom number generators.''\par
Thus, it seems that this algorithm deserves careful
consideration for use in {\tt /dev/random} and {\tt
/dev/urandom} pseudodevices in Unix systems, since the
former in particular on several platforms can be
rapidly drained of data, causing very long input waits
(e.g., two days to read 10MB of data.)",
fjournal = "ACM Transactions on Modeling and Computer Simulation",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J781",
}
@InProceedings{Shamir:2003:FLN,
author = "Adi Shamir and Eran Tromer",
title = "Factoring Large Numbers with the {TWIRL} Device",
crossref = "Boneh:2003:ACC",
pages = "1--26",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@InProceedings{Shamir:2003:RS,
author = "Adi Shamir",
title = "{RSA} Shortcuts",
crossref = "Joye:2003:TCC",
pages = "327--327",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Misc{Shamir:2003:TLC,
author = "Adi Shamir",
title = "{Turing Lecture} on Cryptology: a Status Report",
howpublished = "World-Wide Web slide presentation, video, and audio.",
year = "2003",
bibdate = "Sat Nov 19 07:46:28 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/acm-turing-awards.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.acm.org/turingawardlecture/RSA/",
acknowledgement = ack-nhfb,
}
@Article{Shao:2003:CIB,
author = "Zuhua Shao",
title = "Cryptanalysis of {``an identity-based society oriented
signature scheme with anonymous signers''}",
journal = j-INFO-PROC-LETT,
volume = "86",
number = "6",
pages = "295--298",
day = "30",
month = jun,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:32 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Shao:2003:PSS,
author = "Zuhua Shao",
title = "Proxy signature schemes based on factoring",
journal = j-INFO-PROC-LETT,
volume = "85",
number = "3",
pages = "137--143",
day = "14",
month = feb,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Shen:2003:SET,
author = "Jau-Ji Shen and Chih-Wei Lin and Min-Shiang Hwang",
title = "Security enhancement for the timestamp-based password
authentication scheme using smart cards",
journal = j-COMPUT-SECUR,
volume = "22",
number = "7",
pages = "591--595",
month = oct,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803007090",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Shparlinski:2003:CAA,
author = "Igor E. Shparlinski",
title = "Cryptographic Applications of Analytic Number Theory:
Complexity Lower Bounds and Pseudorandomness",
volume = "22",
publisher = pub-BIRKHAUSER,
address = pub-BIRKHAUSER:adr,
pages = "viii + 411",
year = "2003",
ISBN = "3-7643-6654-0 , 0-8176-6654-0",
ISBN-13 = "978-3-7643-6654-4, 978-0-8176-6654-5",
LCCN = "QA267.7 .S55 2003",
bibdate = "Fri Mar 23 10:30:16 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Progress in computer science and applied logic",
acknowledgement = ack-nhfb,
subject = "Computational complexity; Coding theory; Combinatorial
number theory",
zz-isbn = "3-7643-6654-0, 0-8176-6654-0",
}
@Article{Sklavos:2003:DDR,
author = "N. Sklavos and O. Koufopavlou",
title = "Data dependent rotations, a trustworthy approach for
future encryption systems\slash ciphers: low cost and
high performance",
journal = j-COMPUT-SECUR,
volume = "22",
number = "7",
pages = "585--588",
month = oct,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803007065",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Skolnikoff:2003:SS,
author = "Eugene B. Skolnikoff",
title = "Security and sanity",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "4",
pages = "13--14",
month = apr,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1191776",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Artificial satellites; Cryptography; Educational
institutions; Government; Information security;
Licenses; National security; Power engineering and
energy; Space technology; Weapons",
}
@Book{Skoudis:2003:MFM,
author = "Ed Skoudis and Lenny Zeltser",
title = "Malware: Fighting Malicious Code",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "512 (est.)",
year = "2003",
ISBN = "0-13-101405-6",
ISBN-13 = "978-0-13-101405-3",
LCCN = "QA76.9.A25 S58 2003",
bibdate = "Tue Nov 04 18:30:20 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.99",
series = "{Prentice Hall} series in computer networking and
distributed systems",
acknowledgement = ack-nhfb,
}
@InProceedings{Smart:2003:ACU,
author = "Nigel P. Smart",
title = "Access Control Using Pairing Based Cryptography",
crossref = "Joye:2003:TCC",
pages = "111--121",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@InProceedings{Smart:2003:AGR,
author = "Nigel P. Smart",
title = "An Analysis of {Goubin}'s Refined Power Analysis
Attack",
crossref = "Walter:2003:CHE",
pages = "281--290",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Smith:2003:FTT,
author = "B. Smith",
title = "{Fort TV} [{TV} show e-mail transmission prevention]",
journal = j-IEEE-SPECTRUM,
volume = "40",
number = "5",
pages = "30--32",
month = may,
year = "2003",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2003.1197475",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "broad public redistribution; cryptography; digital
content robust protection; digital defenses; digital
television; Digital TV; direct digital home copying;
DVD; electronic mail; encryption technology; FCC;
Internet; Motion pictures; Protection; TV broadcasting;
TV show e-mail transmission prevention; Video
equipment; Waste materials; Watermarking",
}
@Article{Springer:2003:BRB,
author = "William M. {Springer II}",
title = "Book Review: {{\booktitle{Cryptography: Theory and
Practice}}, second edition by Douglas R. Stinson. CRC
Press}",
journal = j-SIGACT,
volume = "34",
number = "4",
pages = "22--25",
month = dec,
year = "2003",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/954092.954097",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:26 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See
\cite{Stinson:1995:CTP,Stinson:2002:CTP,Stinson:2006:CTP}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Staff:2003:NTC,
author = "{CACM Staff}",
title = "News track: Cinematic Watermark; Eye-Opening
Education; Roaming Time; Stand By Me; Savings Bonds
Fade to Net; Phone Home",
journal = j-CACM,
volume = "46",
number = "7",
pages = "9--10",
month = jul,
year = "2003",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Wed Sep 3 17:06:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Stajano:2003:SCU,
author = "Frank Stajano",
title = "The Security Challenges of Ubiquitous Computing",
crossref = "Walter:2003:CHE",
pages = "1--1",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Standaert:2003:EIR,
author = "Fran{\c{c}}ois-Xavier Standaert and Gael Rouvroy and
Jean-Jacques Quisquater and Jean-Didier Legat",
title = "Efficient Implementation of {Rijndael} Encryption in
Reconfigurable Hardware: {Improvements} and Design
Tradeoffs",
crossref = "Walter:2003:CHE",
pages = "334--350",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Article{Sugita:2003:DRW,
author = "Hiroshi Sugita",
title = "Dynamic random {Weyl} sampling for drastic reduction
of randomness in {Monte Carlo} integration",
journal = j-MATH-COMP-SIM,
volume = "62",
number = "3--6",
pages = "529--537",
day = "3",
month = mar,
year = "2003",
CODEN = "MCSIDR",
DOI = "https://doi.org/10.1016/S0378-4754(02)00231-8",
ISSN = "0378-4754 (print), 1872-7166 (electronic)",
ISSN-L = "0378-4754",
bibdate = "Mon Feb 27 18:00:02 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0378475402002318",
abstract = "To reduce randomness drastically in Monte Carlo (MC)
integration, we propose a pairwise independent
sampling, the dynamic random Weyl sampling (DRWS). DRWS
is applicable even if the length of random bits to
generate a sample may vary. The algorithm of DRWS is so
simple that it works very fast, even though the
pseudo-random generator, the source of randomness,
might be slow. In particular, we can use a
cryptographically secure pseudo-random generator for
DRWS to obtain the most reliable numerical integration
method for complicated functions.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics and Computers in Simulation",
keywords = "dynamic random Weyl sampling (DRWS)",
}
@Article{Sumii:2003:LRE,
author = "Eijiro Sumii and Benjamin C. Pierce",
title = "Logical relations for encryption",
journal = j-J-COMP-SECUR,
volume = "11",
number = "4",
pages = "521--554",
month = "????",
year = "2003",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2003-11403",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:14 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Thimbleby:2003:RE,
author = "Harold Thimbleby",
title = "The reduced {Enigma}",
journal = j-COMPUT-SECUR,
volume = "22",
number = "7",
pages = "624--642",
month = oct,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803007120",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Tico:2003:RAS,
author = "Marius Tico and Pauli Kuosmanen",
title = "A Remote Authentication System Using Fingerprints",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "3",
number = "3",
pages = "425--??",
month = jul,
year = "2003",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Thu Jan 06 07:38:16 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Tiri:2003:SEA,
author = "Kris Tiri and Ingrid Verbauwhede",
title = "Securing Encryption Algorithms against {DPA} at the
Logic Level: Next Generation {Smart Card} Technology",
crossref = "Walter:2003:CHE",
pages = "125--136",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@Book{Trudel:2003:DSE,
author = "Bernard Trudel and Sean Convery and Russell Rice",
title = "Designing secure enterprise networks",
publisher = pub-CISCO,
address = pub-CISCO:adr,
pages = "????",
year = "2003",
ISBN = "1-58705-115-X",
ISBN-13 = "978-1-58705-115-9",
bibdate = "Thu Jun 23 18:36:24 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
note = "Duplicate ISBN with \cite{Convery:2004:NSA}.",
acknowledgement = ack-nhfb,
xxnote = "Check: was this a prepublication catalog entry??",
}
@Article{Tseng:2003:DSM,
author = "Yuh-Min Tseng and Jinn-Ke Jan and Hung-Yu Chien",
title = "Digital signature with message recovery using
self-certified public keys and its variants",
journal = j-APPL-MATH-COMP,
volume = "136",
number = "2--3",
pages = "203--214",
day = "15",
month = mar,
year = "2003",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:40:52 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Tsunoo:2003:CIC,
author = "Yukiyasu Tsunoo and Teruo Saito and Tomoyasu Suzaki
and Maki Shigeri and Hiroshi Miyauchi",
title = "Cryptanalysis of {DES} Implemented on Computers with
Cache",
crossref = "Walter:2003:CHE",
pages = "62--76",
year = "2003",
bibdate = "Tue Apr 4 18:12:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "CHES 2003; cryptography",
}
@InProceedings{Vadhan:2003:CLC,
author = "Salil P. Vadhan",
title = "On Constructing Locally Computable Extractors and
Cryptosystems in the Bounded Storage Model",
crossref = "Boneh:2003:ACC",
pages = "61--77",
year = "2003",
bibdate = "Tue Apr 4 08:39:42 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto' 2003; cryptography",
}
@Article{Vanstone:2003:NGS,
author = "S. A. Vanstone",
title = "Next generation security for wireless: elliptic curve
cryptography",
journal = j-COMPUT-SECUR,
volume = "22",
number = "5",
pages = "412--415",
month = jul,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:52 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803005078",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Vavriv:2003:RNG,
author = "D. D. Vavriv",
editor = "Visarath In and Ljupco Kocarev and Stefano Boccaletti
and Bruce J. Gluckman and Jurgen Kurths and Thomas L.
Carroll",
title = "Random Number Generators on the Basis of Systems with
Chaotic Behavior",
journal = j-AIP-CONF-PROC,
volume = "676",
number = "1",
pages = "373--373",
year = "2003",
CODEN = "APCPCS",
DOI = "https://doi.org/10.1063/1.1612254",
ISSN = "0094-243X (print), 1551-7616 (electronic), 1935-0465",
ISSN-L = "0094-243X",
bibdate = "Mon Jan 16 15:57:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://link.aip.org/link/?APC/676/373/1",
acknowledgement = ack-nhfb,
fjournal = "AIP Conference Proceedings",
keywords = "chaos; cryptography; random number generation;
sequences",
}
@Book{Viega:2003:SPC,
author = "John Viega and Matt Messier",
title = "Secure programming cookbook for {C} and {C++}: Recipes
for cryptography, authentication, networking, input
validation and more",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xxv + 762",
year = "2003",
ISBN = "0-596-00394-3",
ISBN-13 = "978-0-596-00394-4",
LCCN = "QA76.73.C15 V53 2003",
bibdate = "Thu Feb 23 07:58:01 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Covers Unix and Windows",
subject = "C (Computer program language); C++ (Computer program
language); Computer security; Computer software;
Development",
}
@Article{Viroli:2003:TPA,
author = "Mirko Viroli",
title = "A Type-Passing Approach for the Implementation of
Parametric Methods in {Java}",
journal = j-COMP-J,
volume = "46",
number = "3",
pages = "263--294",
month = may,
year = "2003",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Sun Jun 29 07:07:12 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_03/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_03/460263.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_46/Issue_03/pdf/460263.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Book{Wagstaff:2003:CNT,
author = "Samuel S. {Wagstaff, Jr.}",
title = "Cryptanalysis of number theoretic ciphers",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xv + 318",
year = "2003",
ISBN = "1-58488-153-4",
ISBN-13 = "978-1-58488-153-7",
LCCN = "QA76.9.A25 W33 2003",
bibdate = "Thu May 12 07:25:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Computational mathematics",
URL = "http://www.loc.gov/catdir/enhancements/fy0646/2002034919-d.html",
acknowledgement = ack-nhfb,
subject = "computer security; cryptography; number theory",
}
@InProceedings{Walter:2003:STM,
author = "Colin D. Walter",
title = "Seeing through {MIST} Given a Small Fraction of an
{RSA} Private Key",
crossref = "Joye:2003:TCC",
pages = "391--402",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Wang:2003:CET,
author = "Bin Wang and Jian-Hua Li and Zhi-Peng Tong",
title = "Cryptanalysis of an enhanced timestamp-based password
authentication scheme",
journal = j-COMPUT-SECUR,
volume = "22",
number = "7",
pages = "643--645",
month = oct,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803007132",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Wang:2003:SGP,
author = "Huaxiong Wang and Josef Pieprzyk",
title = "Shared Generation of Pseudo-Random Functions with
Cumulative Maps",
crossref = "Joye:2003:TCC",
pages = "281--294",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Weng:2003:CHC,
author = "Annegret Weng",
title = "Constructing hyperelliptic curves of genus $2$
suitable for cryptography",
journal = j-MATH-COMPUT,
volume = "72",
number = "241",
pages = "435--458",
month = jan,
year = "2003",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Fri Nov 22 10:22:27 MST 2002",
bibsource = "http://www.ams.org/mcom/2003-72-241;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/journal-getitem?pii=S0025-5718-02-01422-9;
http://www.ams.org/mcom/2003-72-241/S0025-5718-02-01422-9/S0025-5718-02-01422-9.dvi;
http://www.ams.org/mcom/2003-72-241/S0025-5718-02-01422-9/S0025-5718-02-01422-9.pdf;
http://www.ams.org/mcom/2003-72-241/S0025-5718-02-01422-9/S0025-5718-02-01422-9.ps;
http://www.ams.org/mcom/2003-72-241/S0025-5718-02-01422-9/S0025-5718-02-01422-9.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@InProceedings{Whiting:2003:MPH,
author = "Douglas L. Whiting and Michael J. Sabin",
title = "{Montgomery} Prime Hashing for Message
Authentication",
crossref = "Joye:2003:TCC",
pages = "50--67",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Wolfe:2003:EE,
author = "Hank Wolfe",
title = "Encountering encryption",
journal = j-COMPUT-SECUR,
volume = "22",
number = "5",
pages = "388--391",
month = jul,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:52 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803005042",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Wu:2003:HDW,
author = "Hsien-Chu Wu and Chin-Chen Chang",
title = "Hiding Digital Watermarks Using Fractal Compression
Technique",
journal = j-FUND-INFO,
volume = "58",
number = "2",
pages = "189--202",
month = apr,
year = "2003",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:01:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Wu:2003:IMT,
author = "Tzong-Sun Wu and Chien-Lung Hsu and Han-Yu Lin and
Po-Sheng Huang",
title = "Improvement of the {Miyazaki--Takaragi} threshold
digital signature scheme",
journal = j-INFO-PROC-LETT,
volume = "88",
number = "4",
pages = "183--186",
day = "30",
month = nov,
year = "2003",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:33 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Wu:2003:TSS,
author = "Tzong-Sun Wu and Chien-Lung Hsu",
title = "Threshold signature scheme using self-certified public
keys",
journal = j-J-SYST-SOFTW,
volume = "67",
number = "2",
pages = "89--97",
day = "15",
month = aug,
year = "2003",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Sat Oct 25 07:14:15 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wu:2003:UFR,
author = "Shyi-Tsong Wu and Bin-Chang Chieu",
title = "A user friendly remote authentication scheme with
smart cards",
journal = j-COMPUT-SECUR,
volume = "22",
number = "6",
pages = "547--550",
month = sep,
year = "2003",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:53 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404803006163",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Xiao:2003:HPC,
author = "Lu Xiao and Howard M. Heys",
title = "Hardware Performance Characterization of Block Cipher
Structures",
crossref = "Joye:2003:TCC",
pages = "176--192",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@InProceedings{Xu:2003:TEP,
author = "Shouhuai Xu and Ravi Sandhu",
title = "Two Efficient and Provably Secure Schemes for
Server-Assisted Threshold Signatures",
crossref = "Joye:2003:TCC",
pages = "355--372",
year = "2003",
bibdate = "Tue Apr 4 18:46:22 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "cryptology; Topics in Cryptology CT-RSA 2003",
}
@Article{Yeh:2003:IAM,
author = "Her-Tyan Yeh and Hung-Min Sun and Tzonelih Hwang",
title = "Improved authenticated multiple-key agreement
protocol",
journal = j-COMPUT-MATH-APPL,
volume = "46",
number = "2--3",
pages = "207--211",
month = jul # "\slash " # aug,
year = "2003",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:31 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122103900253",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Yen:2003:RSC,
author = "Sung-Ming Yen and Seungjoo Kim and Seongan Lim and
Sang-Jae Moon",
title = "{RSA} speedup with {Chinese Remainder Theorem} immune
against hardware fault cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "52",
number = "4",
pages = "461--472",
month = apr,
year = "2003",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2003.1190587",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:52:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1190587",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Zhang:2003:FSP,
author = "Zhenxiang Zhang and Min Tang",
title = "Finding strong pseudoprimes to several bases. {II}",
journal = j-MATH-COMPUT,
volume = "72",
number = "244",
pages = "2085--2097",
month = oct,
year = "2003",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Nov 5 16:26:04 MST 2003",
bibsource = "http://www.ams.org/mcom/2003-72-244;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/journal-getitem?pii=S0025-5718-03-01545-X;
http://www.ams.org/mcom/2003-72-244/S0025-5718-03-01545-X/S0025-5718-03-01545-X.dvi;
http://www.ams.org/mcom/2003-72-244/S0025-5718-03-01545-X/S0025-5718-03-01545-X.pdf;
http://www.ams.org/mcom/2003-72-244/S0025-5718-03-01545-X/S0025-5718-03-01545-X.ps;
http://www.ams.org/mcom/2003-72-244/S0025-5718-03-01545-X/S0025-5718-03-01545-X.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Abadi:2004:PA,
author = "Mart{\'\i}n Abadi and C{\'e}dric Fournet",
title = "Private authentication",
journal = j-THEOR-COMP-SCI,
volume = "322",
number = "3",
pages = "427--476",
month = sep,
year = "2004",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Nov 4 10:19:18 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Abe:2004:ASF,
author = "Masayuki Abe and Serge Fehr",
title = "Adaptively Secure {Feldman} {VSS} and Applications to
Universally-Composable Threshold Cryptography",
crossref = "Franklin:2004:ACC",
pages = "317--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Abe:2004:CEP,
author = "Masayuki Abe",
title = "Combining Encryption and Proof of Knowledge in the
Random Oracle Model",
journal = j-COMP-J,
volume = "47",
number = "1",
pages = "58--??",
month = jan,
year = "2004",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Thu Feb 26 06:22:27 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_01/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_01/470058.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_01/pdf/470058.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Agrawal:2004:OPE,
author = "Rakesh Agrawal and Jerry Kiernan and Ramakrishnan
Srikant and Yirong Xu",
title = "Order preserving encryption for numeric data",
crossref = "ACM:2004:PAS",
pages = "563--574",
year = "2004",
bibdate = "Sun Nov 7 06:14:27 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Aiello:2004:JFK,
author = "William Aiello and Steven M. Bellovin and Matt Blaze
and Ran Canetti and John Ioannidis and Angelos D.
Keromytis and Omer Reingold",
title = "Just fast keying: {Key} agreement in a hostile
{Internet}",
journal = j-TISSEC,
volume = "7",
number = "2",
pages = "242--273",
month = may,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Al-Akaidi:2004:FSP,
author = "Marwan Al-Akaidi",
title = "Fractal speech processing",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "x + 214",
year = "2004",
ISBN = "0-521-81458-8 (hardcover), 0-511-75454-X (e-book)",
ISBN-13 = "978-0-521-81458-4 (hardcover), 978-0-511-75454-8
(e-book)",
LCCN = "TK7882.S65 A43 2004; TK7882.S65 ALA",
bibdate = "Tue Sep 20 18:49:43 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.ox.ac.uk:210/ADVANCE",
URL = "http://www.loc.gov/catdir/description/cam032/2003055750.htm;
http://www.loc.gov/catdir/toc/cam032/2003055750.htm",
acknowledgement = ack-nhfb,
subject = "Speech processing systems; Fractals; Data processing",
tableofcontents = "Frontmatter: i--iv \\
Contents: v--viii \\
List of acronyms and abbreviations: ix--x \\
1: Introduction to speech processing: 1--25 \\
2: Computational background: 26--65 \\
3: Statistical analysis, entropy and Bayesian
estimation: 66--87 \\
4: Introduction to fractal geometry: 88--126 \\
5: Application to speech processing and synthesis:
127--140 \\
6: Speech processing with fractals: 141--163 \\
7: Speech synthesis using fractals: 164--177 \\
8: Cryptology and chaos: 178--211 \\
Index: 212--214",
}
@Article{Alvarez:2004:KCC,
author = "G. {\'A}lvarez and F. Montoya and M. Romera and G.
Pastor",
title = "Keystream cryptanalysis of a chaotic cryptographic
method",
journal = j-COMP-PHYS-COMM,
volume = "156",
number = "2",
pages = "205--207",
day = "1",
month = jan,
year = "2004",
CODEN = "CPHCBZ",
DOI = "https://doi.org/10.1016/S0010-4655(03)00432-6",
ISSN = "0010-4655 (print), 1879-2944 (electronic)",
ISSN-L = "0010-4655",
bibdate = "Mon Feb 13 23:41:34 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Wong:2001:MCC,Wong:2004:RCK}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0010465503004326",
acknowledgement = ack-nhfb,
fjournal = "Computer Physics Communications",
journal-URL = "http://www.sciencedirect.com/science/journal/00104655",
}
@Article{Aly:2004:CSP,
author = "Alaaeldin A. Aly and Shakil Akhtar",
title = "Cryptography and security protocols course for
undergraduate {IT} students",
journal = j-SIGCSE,
volume = "36",
number = "2",
pages = "44--47",
month = jun,
year = "2004",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1024338.1024369",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:09 MST 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigcse/sigcse36.html#AlyA04;
http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
URL = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2004.bib",
abstract = "This paper presents an application of active learning
methodologies to teach cryptography and security
protocols for undergraduate IT students. This course is
offered to sophomore/junior students and is based upon
the recently approved Computing Curricula CC 2001 by
IEEE Computer Society/ACM taskforce. We illustrate the
teaching methodology to cover the security related
topics such as encryption/decryption methodologies,
security and protection, cryptographic algorithms and
standards, and computer crime. An example lesson
covering the DES is included.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Amir:2004:PGK,
author = "Yair Amir and Yongdae Kim and Cristina Nita-Rotaru and
Gene Tsudik",
title = "On the performance of group key agreement protocols",
journal = j-TISSEC,
volume = "7",
number = "3",
pages = "457--488",
month = aug,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Anderson:2004:BRR,
author = "Dennis Anderson",
title = "Book Review: {{\em RFID Handbook: Fundamentals and
Applications in Contactless Smart Cards and
Identification\/} by Klaus Finkenzeller, John Wiley \&
Sons, 2003, \$125, ISBN 0-470-84402-7}",
journal = j-QUEUE,
volume = "2",
number = "3",
pages = "74--74",
month = may,
year = "2004",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Thu Jun 23 16:38:49 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Article{Androutsellis-Theotokis:2004:SPP,
author = "Stephanos Androutsellis-Theotokis and Diomidis
Spinellis",
title = "A survey of peer-to-peer content distribution
technologies",
journal = j-COMP-SURV,
volume = "36",
number = "4",
pages = "335--371",
month = dec,
year = "2004",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1041680.1041681",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:20:19 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Distributed computer architectures labeled
'peer-to-peer' are designed for the sharing of computer
resources (content, storage, CPU cycles) by direct
exchange, rather than requiring the intermediation or
support of a centralized server or authority.
Peer-to-peer architectures are characterized by their
ability to adapt to failures and accommodate transient
populations of nodes while maintaining acceptable
connectivity and performance. Content distribution is
an important peer-to-peer application on the Internet
that has received considerable research attention.
Content distribution applications typically allow
personal computers to function in a coordinated manner
as a distributed storage medium by contributing,
searching, and obtaining digital content. In this
survey, we propose a framework for analyzing
peer-to-peer content distribution technologies. Our
approach focuses on nonfunctional characteristics such
as security, scalability, performance, fairness, and
resource management potential, and examines the way in
which these characteristics are reflected in---and
affected by---the architectural design decisions
adopted by current peer-to-peer systems. We study
current peer-to-peer systems and infrastructure
technologies in terms of their distributed object
location and routing mechanisms, their approach to
content replication, caching and migration, their
support for encryption, access control, authentication
and identity, anonymity, deniability, accountability
and reputation, and their use of resource trading and
management schemes.",
acknowledgement = ack-nhfb,
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Content distribution; DHT; DOLR; grid computing; p2p;
peer-to-peer",
}
@Article{Anonymous:2004:BB,
author = "Anonymous",
title = "Biometrics Boom",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "3",
pages = "13--13",
month = mar,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1270539",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Aircraft; Authentication; Biometrics; Clocks; Clouds;
Costs; Energy capture; Fingerprint recognition; Humans;
Solar energy",
}
@Article{Anonymous:2004:Cf,
author = "Anonymous",
title = "Codebuster",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "5",
pages = "59--60",
month = may,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1296018",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Andy Clark; biographies; Biographies; codes; computer
crime; Computer crime; computer forensics;
cryptography; Cryptography; data encryption; decryption
technique; Deep Thought; Inforenz; parallel computers",
}
@Article{Anonymous:2004:CJL,
author = "Anonymous",
title = "{Chipkarten: Java-L{\"o}sung f{\"u}r SmartCards}.
({German}) [{Chip} cards: {Java} Solutions for
{SmartCards}]",
journal = j-ELECTRONIK,
volume = "53",
number = "4",
pages = "6",
year = "2004",
CODEN = "EKRKAR",
ISSN = "0013-5658",
bibdate = "Sat Apr 3 08:12:24 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "Elektronik",
language = "German",
}
@Article{Anonymous:2004:CPS,
author = "Anonymous",
title = "Call for Papers for Special Section on Fault Diagnosis
and Tolerance in Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "53",
number = "11",
pages = "1504--1504",
month = nov,
year = "2004",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2004.89",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:12:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1336771",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Anonymous:2004:ISL,
author = "Anonymous",
title = "{IBM}'s support for the {Liberty Alliance} brings
standard convergence for federated identity a step
closer",
journal = j-NETWORK-SECURITY,
volume = "2004",
number = "11",
pages = "3, 20",
month = nov,
year = "2004",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(04)00151-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485804001515",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2004:NGJ,
author = "Anonymous",
title = "New generation {Java} smart cards",
journal = "Card Technology Today",
volume = "16",
number = "3",
pages = "10--11",
year = "2004",
CODEN = "????",
ISSN = "0965-2590",
bibdate = "Sat Apr 3 08:12:24 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
}
@InProceedings{Applebaum:2004:CNS,
author = "B. Applebaum and Y. Ishai and E. Kushilevitz",
title = "Cryptography in {NC}$^0$",
crossref = "IEEE:2004:PAI",
pages = "166--175",
year = "2004",
bibdate = "Fri Jul 15 16:13:03 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/9430/29918/01366236.pdf?isnumber=29918&prod=CNF&arnumber=1366236&arSt=+166&ared=+175&arAuthor=Applebaum%2C+B.%3B+Ishai%2C+Y.%3B+Kushilevitz%2C+E.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=29918&arnumber=1366236&count=64&index=17",
acknowledgement = ack-nhfb,
}
@Article{Arnold:2004:IPN,
author = "T. W. Arnold and L. P. {Van Doorn}",
title = "The {IBM PCIXCC}: a new cryptographic coprocessor for
the {IBM eServer}",
journal = j-IBM-JRD,
volume = "48",
number = "3/4",
pages = "475--487",
month = "????",
year = "2004",
CODEN = "IBMJAE",
DOI = "https://doi.org/10.1147/rd.483.0475",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Sep 28 06:50:40 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/rd/483/arnold.html;
http://www.research.ibm.com/journal/rd/483/arnold.pdf",
abstract = "IBM has designed special cryptographic processors for
its servers for more than 25 years. These began as very
simple devices, but over time the requirements have
become increasingly complex, and there has been a
never-ending demand for increased speed. This paper
describes the PCIXCC, the new coprocessor introduced in
the IBM z990 server. In many ways, PCIXCC is a
watershed design. For the first time, a single product
satisfies all requirements across all IBM server
platforms. It offers the performance demanded by
today's Web servers, it supports the complex and
specialized cryptographic functions needed in the
banking and finance industry, and it uses packaging
technology that leads the world in resistance to
physical or electrical attacks against its secure
processes and the secret data it holds. Furthermore, it
is programmable and highly flexible, so that its
function can be easily modified to meet new
requirements as they appear. These features are
possible because of innovative design in both the
hardware and embedded software for the card. This paper
provides an overview of that design.",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
ordernumber = "G322-0240",
remark = "From the paper: ``Random-number generator: The card
includes two cryptographic-quality hardware
random-number generators. The entropy is obtained from
electrical noise from a semiconductor junction. Each of
the two random-number sources provides random bits at a
rate of 128 Kb/s.''\par
Linux operating system and device drivers: \ldots{} By
adopting Linux as the card O/S, the PCIXCC development
team could focus more of its energy on the unique
PCIXCC components. \ldots{} In the end, we decided to
provide all device driver modules under the same
license as the Linux kernel, the GNU General Public
License (GPL).",
}
@Article{Artail:2004:PAC,
author = "Hassan A. Artail",
title = "Peer-assisted carrying authentication {(PACA)}",
journal = j-COMPUT-SECUR,
volume = "23",
number = "6",
pages = "478--488",
month = sep,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001191",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Aslan:2004:HSM,
author = "Heba K. Aslan",
title = "A hybrid scheme for multicast authentication over
lossy networks",
journal = j-COMPUT-SECUR,
volume = "23",
number = "8",
pages = "705--713",
month = dec,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001798",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Aslan:2004:LAA,
author = "Heba K. Aslan",
title = "Logical analysis of {AUTHMAC\_DH}: a new protocol for
authentication and key distribution",
journal = j-COMPUT-SECUR,
volume = "23",
number = "4",
pages = "290--299",
month = jun,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804000215",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Atallah:2004:ALA,
author = "Mikhail J. Atallah and Stefano Lonardi",
title = "Augmenting {LZ-77} with authentication and integrity
assurance capabilities",
journal = j-CCPE,
volume = "16",
number = "11",
pages = "1063--1076",
month = sep,
year = "2004",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.804",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat May 14 11:30:55 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Prac\-tice and
Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "6 Aug 2004",
}
@Article{Ateniese:2004:VED,
author = "Giuseppe Ateniese",
title = "Verifiable encryption of digital signatures and
applications",
journal = j-TISSEC,
volume = "7",
number = "1",
pages = "1--20",
month = feb,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Bajard:2004:FRI,
author = "J.-C. Bajard and L. Imbert",
title = "A full {RNS} implementation of {RSA}",
journal = j-IEEE-TRANS-COMPUT,
volume = "53",
number = "6",
pages = "769--774",
month = jun,
year = "2004",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2004.2",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:12:38 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1288551",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Bao:2004:CPK,
author = "Feng Bao",
title = "Cryptanalysis of a partially known cellular automata
cryptosystem",
journal = j-IEEE-TRANS-COMPUT,
volume = "53",
number = "11",
pages = "1493--1497",
month = nov,
year = "2004",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2004.94",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:12:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1336769",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Bar-Yossef:2004:ESQ,
author = "Ziv Bar-Yossef and T. S. Jayram and Iordanis
Kerenidis",
title = "Exponential separation of quantum and classical
one-way communication complexity",
crossref = "ACM:2004:PAA",
pages = "128--137",
year = "2004",
bibdate = "Wed Apr 5 05:59:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Bellare:2004:BPR,
author = "Mihir Bellare and Tadayoshi Kohno and Chanathip
Namprempre",
title = "Breaking and provably repairing the {SSH}
authenticated encryption scheme: a case study of the
Encode-then-Encrypt-and-{MAC} paradigm",
journal = j-TISSEC,
volume = "7",
number = "2",
pages = "206--241",
month = may,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Misc{Bellare:2004:CBG,
author = "M. Bellare and P. Rogaway",
title = "Code-based game-playing proofs and the security of
triple encryption",
howpublished = "Cryptology ePrint Archive report 2004/331",
year = "2004",
bibdate = "Tue Mar 18 10:50:08 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://eprint.iacr.org/2004/331",
acknowledgement = ack-nhfb,
}
@InProceedings{Bellare:2004:KEA,
author = "Mihir Bellare and Adriana Palacio",
title = "The Knowledge-of-Exponent Assumptions and $3$-Round
Zero-Knowledge Protocols",
crossref = "Franklin:2004:ACC",
pages = "273--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Bellovin:2004:IRS,
author = "Steven M. Bellovin",
title = "Inside risks: Spamming, phishing, authentication, and
privacy",
journal = j-CACM,
volume = "47",
number = "12",
pages = "144--144",
month = dec,
year = "2004",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Dec 2 06:08:32 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@TechReport{Benson:2004:VS,
author = "Robert L. Benson",
title = "The {Venona} Story",
type = "Report",
institution = "Center for Cryptologic History, National Security
Agency",
address = "9800 Savage Road, Suite 6886, Fort George G. Meade, MD
20755-6886",
pages = "63",
day = "15",
month = jan,
year = "2004",
bibdate = "Fri Dec 29 08:09:11 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.nsa.gov/about/cryptologic-heritage/historical-figures-publications/publications/coldwar/assets/files/venona_story.pdf",
abstract = "On 1 February 1943 the U.S. Army's Signal Intelligence
Service, a forerunner of the National Security Agency,
began a small, very secret program, later codenamed
VENONA. The original object of the VENONA program was
to examine, and possibly exploit, encrypted Soviet
diplomatic communications. These messages had been
accumulated by the Signal Intelligence Service (later
renamed the U.S. Army Signal Security Agency and
commonly called ``Arlington Hall'' after the Virginia
location of its headquarters) since 1939 but had not
been studied previously. American analysts discovered
that these Soviet communications dealt with not only
diplomatic subjects but also espionage matters.",
acknowledgement = ack-nhfb,
keywords = "Alger Hiss; Carter Clarke; Cecil Phillips; David
Greenglass; Donald Maclean; Elizabeth Bentley; Ethel
Rosenberg; Gene Grabeel; Guy Burgess; Harry D. White;
Harry Gold; Julius Rosenberg; Kim Philby; Klaus Fuchs;
Meredith Gardner; Robert Lamphere; Theodore Hall;
William Perl",
remark = "Internally undated, but pdfinfo reports CreationDate:
Thu Jan 15 07:25:33 2004 and ModDate: Wed Oct 22
10:27:42 2008.",
}
@Misc{Bernstein:2004:FPA,
author = "Daniel J. Bernstein",
title = "Floating-Point Arithmetic and Message Authentication",
pages = "21",
day = "18",
month = sep,
year = "2004",
bibdate = "Mon May 13 10:25:28 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "To be incorporated into the author's
\booktitle{High-Speed Cryptography} book. [As of 13 May
2024, this book seems not to have been published.]",
URL = "https://cr.yp.to/antiforgery/hash127-20040918.pdf",
abstract = "There is a well-known class of message authentication
systems guaranteeing that attackers will have a
negligible chance of successfully forging a message.
This paper shows how one of these systems can hash
messages at extremely high speed --- much more quickly
than previous systems at the same security level ---
using IEEE floating-point arithmetic. This paper also
presents a survey of the literature in a unified
mathematical framework.",
acknowledgement = ack-nhfb,
remark = "From the first page: ``What distinguishes $ h_r $ is
its speed: it is the first high-security system that
offers better speed than the MD5-based systems in
common use today.'' The section on Priority dates on
the second page notes earlier work back to April
1999.",
}
@Article{Bhargavan:2004:SWS,
author = "Karthikeyan Bhargavan and C{\'e}dric Fournet and
Andrew D. Gordon",
title = "A semantics for {Web} services authentication",
journal = j-SIGPLAN,
volume = "39",
number = "1",
pages = "198--209",
month = jan,
year = "2004",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Apr 12 09:38:12 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@InProceedings{Biham:2004:NCS,
author = "Eli Biham and Rafi Chen",
title = "Near-Collisions of {SHA-0}",
crossref = "Franklin:2004:ACC",
pages = "290--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@InProceedings{Biryukov:2004:MLA,
author = "Alex Biryukov and Christophe {De Canni{\`e}re} and
Micha{\"e}l Quisquater",
title = "On Multiple Linear Approximations",
crossref = "Franklin:2004:ACC",
pages = "1--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Book{Blake:2004:AEC,
editor = "Ian F. Blake and G. (Gadiel) Seroussi and Nigel P.
(Nigel Paul) Smart",
title = "Advances in elliptic curve cryptography",
volume = "317",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xvi + 281",
year = "2004",
ISBN = "0-521-60415-X",
ISBN-13 = "978-0-521-60415-4",
LCCN = "QA76.9.A25 A375 2004",
bibdate = "Wed Sep 14 14:29:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "London Mathematical Society lecture note series",
URL = "http://www.loc.gov/catdir/description/cam051/2004054519.html;
http://www.loc.gov/catdir/toc/cam051/2004054519.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Public key cryptography",
tableofcontents = "Protocols --- Elliptic curve base protocols / N. P.
Smart \\
On the provable security of ECDSA / D. Brown \\
Proofs of security for ECIES / A. W. Dent \\
Implementation Techniques --- Side channel analysis /
E. Oswald \\
Defenses against side-channel analysis / M. Joye \\
Mathematical Foundations --- Advances in point counting
/ F. Vercauteren \\
Hyperelliptic curves and the HCDLP / P. Guadry \\
Weil descent attacks / F. Hess \\
Pairing Based Techniques --- Pairings / S. Galbraith
\\
Cryptography from pairings / K. G. Paterson.",
}
@Article{Blundo:2004:SIA,
author = "Carlo Blundo and Stelvio Cimato",
title = "A Software Infrastructure for Authenticated {Web}
Metering",
journal = j-COMPUTER,
volume = "37",
number = "4",
pages = "28--??",
month = apr,
year = "2004",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 4 16:02:09 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/co/2004/04/r4028abs.htm;
http://csdl.computer.org/dl/mags/co/2004/04/r4028.htm;
http://csdl.computer.org/dl/mags/co/2004/04/r4028.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Boesgaard:2004:RNH,
author = "M. Boesgaard and M. Vesterager and T. Pedersen and J.
Christiansen and O. Scavenius",
editor = "????",
booktitle = "Proceedings of Fast Software Encryption 10",
title = "{Rabbit}: a new high performance stream cipher",
volume = "2887",
publisher = pub-SV,
address = pub-SV:adr,
pages = "307--329",
year = "2004",
bibdate = "Thu Sep 22 18:43:55 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Boneh:2004:SGS,
author = "Dan Boneh and Xavier Boyen and Hovav Shacham",
title = "Short Group Signatures",
crossref = "Franklin:2004:ACC",
pages = "41--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@InProceedings{Boneh:2004:SIB,
author = "Dan Boneh and Xavier Boyen",
title = "Secure Identity Based Encryption Without Random
Oracles",
crossref = "Franklin:2004:ACC",
pages = "443--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Bozzano:2004:AVS,
author = "Marco Bozzano and Giorgio Delzanno",
title = "Automatic verification of secrecy properties for
linear logic specifications of cryptographic
protocols",
journal = j-J-SYMBOLIC-COMP,
volume = "38",
number = "5",
pages = "1375--1415",
month = nov,
year = "2004",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Tue Jul 5 17:59:12 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/07477171",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171",
}
@Article{Branovic:2004:WCE,
author = "I. Branovic and R. Giorgi and E. Martinelli",
title = "A workload characterization of elliptic curve
cryptography methods in embedded environments",
journal = j-COMP-ARCH-NEWS,
volume = "32",
number = "3",
pages = "27--34",
month = jun,
year = "2004",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:41:01 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Book{Buchmann:2004:IC,
author = "Johannes Buchmann",
title = "Introduction to cryptography",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xvi + 335",
year = "2004",
ISBN = "0-387-20756-2 , 0-387-21156-X",
ISBN-13 = "978-0-387-20756-8, 978-0-387-21156-5",
LCCN = "QA268.B83; QA268.B83 2004",
bibdate = "Thu Apr 21 17:40:14 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.mit.edu:9909/mit01",
series = "Undergraduate texts in mathematics",
acknowledgement = ack-nhfb,
remark = "See also first edition \cite{Buchmann:2001:IC}.",
subject = "Coding theory; Cryptography",
}
@Article{Burmester:2004:HPK,
author = "Mike Burmester and Yvo G. Desmedt",
title = "Is hierarchical public-key certification the next
target for hackers?",
journal = j-CACM,
volume = "47",
number = "8",
pages = "68--74",
month = aug,
year = "2004",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1012037.1012038",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Dec 2 06:08:31 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Camenisch:2004:SSA,
author = "Jan Camenisch and Anna Lysyanskaya",
title = "Signature Schemes and Anonymous Credentials from
Bilinear Maps",
crossref = "Franklin:2004:ACC",
pages = "56--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Carrier:2004:STP,
author = "Brian Carrier and Clay Shields",
title = "The session token protocol for forensics and
traceback",
journal = j-TISSEC,
volume = "7",
number = "3",
pages = "333--362",
month = aug,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Catalano:2004:IIP,
author = "Dario Catalano and David Pointcheval and Thomas
Pornin",
title = "{IPAKE}: {Isomorphisms for Password-Based
Authenticated Key Exchange}",
crossref = "Franklin:2004:ACC",
pages = "477--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Ceravolo:2004:ERH,
author = "P. Ceravolo",
title = "Extracting role hierarchies from authentication data
flows",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "19",
number = "3",
pages = "??--??",
month = may,
year = "2004",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Sat May 14 12:27:04 2005",
bibsource = "http://www.crlpublishing.co.uk/cssecont04.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Semantics-Aware Techniques for
Security.",
}
@Periodical{Certicom:2004:CCC,
author = "{Certicom}",
title = "Code \& Cipher: {Certicom}'s Bulletin of Security and
Cryptography",
publisher = "Certicom",
address = "5520 Explorer Drive, 4th Floor Mississauga, Ontario,
L4W 5L1 Canada",
year = "2004",
bibdate = "Wed Apr 20 11:56:41 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Published quarterly.",
URL = "http://www.certicom.com/codeandcipher",
acknowledgement = ack-nhfb,
}
@Article{Chang:2004:ASS,
author = "Chin-Chen Chang and Piyu Tsai and Min-Hui Lin",
title = "An Adaptive Steganographic Scheme for Color Images",
journal = j-FUND-INFO,
volume = "62",
number = "3--4",
pages = "275--289",
month = mar,
year = "2004",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:02:22 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chang:2004:CGS,
author = "Chin-Chen Chang and Yeu-Pong Lai",
title = "A convertible group signature scheme",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "58--65",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2004:IDA,
author = "Ya-Fan Chang and Chin-Chen Chang and Chia-Lin Kao",
title = "An improvement on a deniable authentication protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "65--74",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2004:IDM,
author = "Chin-Chen Chang and Iuon-Chang Lin",
title = "An improvement of delegated multisignature scheme with
document decomposition",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "52--57",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2004:RFB,
author = "Chin-Chen Chang and Iuon-Chang Lin",
title = "Remarks on fingerprint-based remote user
authentication scheme using {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "91--96",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2004:SES,
author = "Ya-Fen Chang and Chin-Chen Chang",
title = "A secure and efficient strong-password authentication
protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "79--90",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2004:SOT,
author = "Ya-Fen Chang and Chin-Chen Chang and Jui-Yi Kuo",
title = "A secure one-time password authentication scheme using
{Smart Cards} without limiting login times",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "80--90",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2004:TSSb,
author = "Ting-Yi Chang and Chou-Chen Yang and Min-Shiang
Hwang",
title = "A threshold signature scheme for group communications
without a shared distribution center",
journal = j-FUT-GEN-COMP-SYS,
volume = "20",
number = "6",
pages = "1013--1021",
month = aug,
year = "2004",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Chaum:2004:VSB,
author = "David Chaum",
title = "{E}-Voting: Secret-Ballot Receipts: True
Voter-Verifiable Elections",
journal = j-IEEE-SEC-PRIV,
volume = "2",
number = "1",
pages = "38--47",
month = jan # "\slash " # feb,
year = "2004",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSECP.2004.1264852",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Feb 3 11:48:25 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
URL = "http://csdl.computer.org/comp/mags/sp/2004/01/j1038abs.htm;
http://csdl.computer.org/dl/mags/sp/2004/01/j1038.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Chen:2004:IAM,
author = "Bi-Hui Chen",
title = "Improvement of authenticated multiple-key agreement
protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "35--41",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chen:2004:MCK,
author = "Tzer-Shyong Chen and Kuo-Hsuan Huang and Yu-Fang
Chung",
title = "Modified cryptographic key assignment scheme for
overcoming the incorrectness of the {CHW} scheme",
journal = j-APPL-MATH-COMP,
volume = "159",
number = "1",
pages = "147--155",
day = "25",
month = nov,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:37 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chen:2004:SEP,
author = "Ling Chen and Yi Pan and Xiao-hua Xu",
title = "Scalable and Efficient Parallel Algorithms for
{Euclidean} Distance Transform on the {LARPBS} Model",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "15",
number = "11",
pages = "975--982",
month = nov,
year = "2004",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2004.71",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Sat Dec 11 16:24:16 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/trans/td/2004/11/l0975abs.htm;
http://csdl.computer.org/dl/trans/td/2004/11/l0975.htm;
http://csdl.computer.org/dl/trans/td/2004/11/l0975.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Chen:2004:TPM,
author = "Tzer-Shyong Chen and Yu-Fang Chung and Kuo-Hsuan
Huang",
title = "A traceable proxy multisignature scheme based on the
elliptic curve cryptosystem",
journal = j-APPL-MATH-COMP,
volume = "159",
number = "1",
pages = "137--145",
day = "25",
month = nov,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:37 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Cheng:2004:BSD,
author = "Qi Cheng",
title = "On the Bounded Sum-of-Digits Discrete Logarithm
Problem in Finite Fields",
crossref = "Franklin:2004:ACC",
pages = "201--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Chien:2004:IAM,
author = "Hung-Yu Chien and Jinn-Ke Jan",
title = "Improved authenticated multiple-key agreement protocol
without using conventional one-way function",
journal = j-APPL-MATH-COMP,
volume = "147",
number = "2",
pages = "491--497",
day = "12",
month = jan,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:41:16 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chien:2004:SIS,
author = "Hung-Yu Chien and Jinn-Ke Jan and Yuh-Min Tseng",
title = "Solving the invalid signer-verified signature problem
and comments on {Xia--You} group signature",
journal = j-J-SYST-SOFTW,
volume = "73",
number = "3",
pages = "369--373",
month = nov # "\slash " # dec,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:26 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Cho:2004:GKR,
author = "Taenam Cho and Sang-Ho Lee and Won Kim",
title = "A group key recovery mechanism based on logical key
hierarchy",
journal = j-J-COMP-SECUR,
volume = "12",
number = "5",
pages = "711--736",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-12503",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:32 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Chow:2004:UDL,
author = "Jim Chow and Ben Pfaff and Tal Garfinkel and Kevin
Christopher and Mendel Rosenblum",
editor = "????",
booktitle = "USENIX Security Symposium",
title = "Understanding data lifetime via whole system
simulation",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "??--??",
year = "2004",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:40:20 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 17]{Schneier:2015:SWC}.",
}
@Book{Cobb:2004:CD,
author = "Chey Cobb",
title = "Cryptography For Dummies",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xx + 304",
year = "2004",
ISBN = "0-7645-4188-9",
ISBN-13 = "978-0-7645-4188-9",
LCCN = "TK5102.94 .C62 2004",
bibdate = "Sat Jan 10 09:20:32 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$24.99",
series = "For dummies",
URL = "http://www.loc.gov/catdir/bios/wiley046/2003105686.html;
http://www.loc.gov/catdir/description/wiley039/2003105686.html;
http://www.loc.gov/catdir/toc/wiley041/2003105686.html",
acknowledgement = ack-nhfb,
subject = "Telecommunication; Security measures; Popular works;
Data encryption (Computer science)",
}
@Article{Collberg:2004:DPB,
author = "C. Collberg and E. Carter and S. Debray and A.
Huntwork and J. Kececioglu and C. Linn and M. Stepp",
title = "Dynamic path-based software watermarking",
journal = j-SIGPLAN,
volume = "39",
number = "6",
pages = "107--118",
month = may,
year = "2004",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Thu Dec 2 05:49:55 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@Book{Convery:2004:NSA,
author = "Sean Convery",
title = "Network security architectures",
publisher = pub-CISCO,
address = pub-CISCO:adr,
pages = "xxxix + 739",
year = "2004",
ISBN = "1-58705-115-X",
ISBN-13 = "978-1-58705-115-9",
LCCN = "TK5105.59 .C5793 2004",
bibdate = "Thu Jun 23 18:36:24 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
note = "Duplicate ISBN with \cite{Trudel:2003:DSE}.",
series = "Networking technology series",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures",
}
@Article{Copeland:2004:COO,
author = "B. Jack Copeland",
title = "{Colossus}: Its Origins and Originators",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "26",
number = "4",
pages = "38--45",
month = oct # "\slash " # dec,
year = "2004",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2004.26",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Sat Dec 11 18:28:43 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/an/2004/04/a4038.htm;
http://csdl.computer.org/dl/mags/an/2004/04/a4038.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Cornwall:2004:AAM,
author = "Linda A. Cornwall and Jens Jensen and David P. Kelsey
and {\'A}kos Frohner and Daniel Kou{\v{r}}il and Franck
Bonnassieux and Sophie Nicoud and K{\'a}roly
L{\~o}rentey and Joni Hahkala and Mika Silander and
Roberto Cecchini and Vincenzo Ciaschini and Luca
dell'Agnello and Fabio Spataro and David O'Callaghan
and Olle Mulmo and Gian Luca Volpato and David Groep
and Martijn Steenbakkers and Andrew McNab",
title = "Authentication and Authorization Mechanisms for
Multi-Domain {Grid} Environments",
journal = j-J-GRID-COMP,
volume = "2",
number = "4",
pages = "301--311",
month = dec,
year = "2004",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10723-004-8182-y",
ISSN = "1570-7873 (print), 1572-9184 (electronic)",
ISSN-L = "1570-7873",
bibdate = "Wed Jul 6 08:49:48 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1570-7873&volume=2&issue=4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1570-7873&volume=2&issue=4&spage=301",
acknowledgement = ack-nhfb,
fjournal = "Journal of Grid Computing",
journal-URL = "http://link.springer.com/journal/10723",
}
@Article{Coron:2004:SSL,
author = "Jean-Sebastien Coron and David Naccache and Paul
Kocher",
title = "Statistics and secret leakage",
journal = j-TECS,
volume = "3",
number = "3",
pages = "492--508",
month = aug,
year = "2004",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Fri Oct 29 06:35:47 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@InProceedings{Courtois:2004:FSB,
author = "Nicolas T. Courtois",
title = "{Feistel} Schemes and Bi-linear Cryptanalysis:
(Extended Abstract)",
crossref = "Franklin:2004:ACC",
pages = "23--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Cousot:2004:AIB,
author = "Patrick Cousot and Radhia Cousot",
title = "An abstract interpretation-based framework for
software watermarking",
journal = j-SIGPLAN,
volume = "39",
number = "1",
pages = "173--185",
month = jan,
year = "2004",
CODEN = "SINODQ",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Apr 12 09:38:12 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
}
@InProceedings{Crescenzo:2004:CRR,
author = "Giovanni {Di Crescenzo} and Giuseppe Persiano and Ivan
Visconti",
title = "Constant-Round Resettable Zero Knowledge with
Concurrent Soundness in the Bare Public-Key Model",
crossref = "Franklin:2004:ACC",
pages = "237--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@InProceedings{Damgaard:2004:ZKP,
author = "Ivan Damg{\aa}rd and Serge Fehr and Louis Salvail",
title = "Zero-Knowledge Proofs and String Commitments
Withstanding Quantum Attacks",
crossref = "Franklin:2004:ACC",
pages = "254--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Dandalis:2004:ACE,
author = "Andreas Dandalis and Viktor K. Prasanna",
title = "An adaptive cryptographic engine for {Internet}
protocol security architectures",
journal = j-TODAES,
volume = "9",
number = "3",
pages = "333--353",
month = jul,
year = "2004",
CODEN = "ATASFO",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Thu Nov 4 08:12:30 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
}
@Article{DeBonis:2004:RSS,
author = "Annalisa {De Bonis} and Alfredo {De Santis}",
title = "Randomness in secret sharing and visual cryptography
schemes",
journal = j-THEOR-COMP-SCI,
volume = "314",
number = "3",
pages = "351--374",
day = "10",
month = apr,
year = "2004",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Nov 4 10:19:14 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Book{DeBrosse:2004:SBU,
author = "Jim DeBrosse and Colin B. Burke",
title = "The secret in {Building 26}: the untold story of
{America}'s ultra war against the {U}-boat {Enigma}
codes",
publisher = pub-RANDOM-HOUSE,
address = pub-RANDOM-HOUSE:adr,
pages = "xxix + 272",
year = "2004",
ISBN = "0-375-50807-4, 1-58836-353-8, 0-375-75995-6",
ISBN-13 = "978-0-375-50807-3, 978-1-58836-353-4,
978-0-375-75995-6",
LCCN = "D810.C88 D43 2004",
bibdate = "Fri Jan 13 17:17:54 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/samples/random045/2003058494.html;
http://www.randomhouse.com/catalog/display.pperl?isbn=9781588363534",
acknowledgement = ack-nhfb,
remark = "From the publisher: ``Much has been written about the
success of the British ``Ultra'' program in cracking
the Germans' Enigma code early in World War II, but few
know what really happened in 1942, when the Germans
added a fourth rotor to the machine that created the
already challenging naval code and plunged Allied
intelligence into darkness.
Enter one Joe Desch, an unassuming but brilliant
engineer at the National Cash Register Company in
Dayton, Ohio, who was given the task of creating a
machine to break the new Enigma settings. It was an
enterprise that rivaled the Manhattan Project for
secrecy and complexity---and nearly drove Desch to a
breakdown. Under enormous pressure, he succeeded in
creating a 5,000-pound electromechanical monster known
as the Desch Bombe, which helped turn the tide in the
Battle of the Atlantic---but not before a disgruntled
co-worker attempted to leak information about the
machine to the Nazis.
After toiling anonymously---it even took his daughter
years to learn of his accomplishments---Desch was
awarded the National Medal of Merit, the country's
highest civilian honor. In The Secret in Building 26,
the entire thrilling story of the final triumph over
Enigma is finally told. ''",
subject = "World War, 1939--1945; Cryptography; Enigma cipher
system; United States; History; 20th century; Desch,
Joseph",
}
@Article{DePalma:2004:CCS,
author = "Paul {De Palma} and Charles Frank and Suzanne
Gladfelter and Joshua Holden",
title = "Cryptography and computer security for
undergraduates",
journal = j-SIGCSE,
volume = "36",
number = "1",
pages = "94--95",
month = mar,
year = "2004",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1028174.971334",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:06 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "The panel discusses solutions to the problem of
computer security education.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{DeSantis:2004:CKA,
author = "Alfredo {De Santis} and Anna Lisa Ferrara and Barbara
Masucci",
title = "Cryptographic key assignment schemes for any access
control policy",
journal = j-INFO-PROC-LETT,
volume = "92",
number = "4",
pages = "199--205",
day = "30",
month = nov,
year = "2004",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:57 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Devanbu:2004:FAX,
author = "Premkumar Devanbu and Michael Gertz and April Kwong
and Charles Martel and Glen Nuckolls and Stuart G.
Stubblebine",
title = "Flexible authentication of {XML} documents",
journal = j-J-COMP-SECUR,
volume = "12",
number = "6",
pages = "841--864",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-12602",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:36 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Dodis:2004:IPC,
author = "Y. Dodis and Shien Jin Ong and M. Prabhakaran and A.
Sahai",
title = "On the (im)possibility of cryptography with imperfect
randomness",
crossref = "IEEE:2004:PAI",
pages = "196--205",
year = "2004",
bibdate = "Fri Jul 15 16:13:03 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/9430/29918/01366239.pdf?isnumber=29918&prod=CNF&arnumber=1366239&arSt=+196&ared=+205&arAuthor=Dodis%2C+Y.%3B+Shien+Jin+Ong%3B+Prabhakaran%2C+M.%3B+Sahai%2C+A.;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=29918&arnumber=1366239&count=64&index=20",
acknowledgement = ack-nhfb,
}
@InProceedings{Dodis:2004:REK,
author = "Yevgeniy Dodis and Rosario Gennaro and Johan
H{\aa}stad and Hugo Krawczyk and Tal Rabin",
title = "Randomness Extraction and Key Derivation Using the
{CBC}, {Cascade} and {HMAC} Modes",
crossref = "Franklin:2004:ACC",
pages = "494--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Duggan:2004:TBC,
author = "Dominic Duggan",
title = "Type-based cryptographic operations",
journal = j-J-COMP-SECUR,
volume = "12",
number = "3--4",
pages = "485--550",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-123-407",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:26 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Book{Dwivedi:2004:ISS,
author = "Himanshu Dwivedi",
title = "Implementing {SSH}: strategies for optimizing the
secure shell",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxvi + 376",
year = "2004",
ISBN = "0-471-45880-5",
ISBN-13 = "978-0-471-45880-7",
LCCN = "QA76.76.O63 D895 2004",
bibdate = "Wed Jan 21 05:31:30 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 24.50",
URL = "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
http://www.loc.gov/catdir/bios/wiley046/2004297174.html;
http://www.loc.gov/catdir/description/wiley041/2004297174.html;
http://www.loc.gov/catdir/toc/wiley041/2004297174.html",
acknowledgement = ack-nhfb,
remark = "Pt. 1. SSH Basics. ch. 1. Overview of SSH ; ch. 2. SSH
Servers ; ch. 3. Secure Shell clients ; ch. 4.
Authentication ; ch. 5. SSH Management -- pt. 2. Remote
Access Solutions. ch. 6. SSH port forwarding ; ch. 7.
Secure remote access -- pt. 3. Protocol replacement.
ch. 8. SSH versatility ; ch. 9. Proxy technologies in a
secure Web environment ; ch. 10. SSH case studies.",
subject = "UNIX Shells; Computer networks; Security measures;
Data encryption (Computer science)",
}
@InProceedings{Dwork:2004:PPD,
author = "Cynthia Dwork and Kobbi Nissim",
title = "Privacy-Preserving Datamining on Vertically
Partitioned Databases",
crossref = "Franklin:2004:ACC",
pages = "528--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Elliott:2004:QC,
author = "Chip Elliott",
title = "Quantum Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "2",
number = "4",
pages = "57--61",
month = jul # "\slash " # aug,
year = "2004",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2004.54",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 4 07:44:24 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/sp/2004/04/j4057.htm;
http://csdl.computer.org/dl/mags/sp/2004/04/j4057.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Ernst:2004:FBH,
author = "M. Ernst and B. Henhapl and S. Klupsch and S. Huss",
title = "{FPGA} based hardware acceleration for elliptic curve
public key cryptosystems",
journal = j-J-SYST-SOFTW,
volume = "70",
number = "3",
pages = "299--313",
month = mar,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:23 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Fan:2004:PPI,
author = "Jinliang Fan and Jun Xu and Mostafa H. Ammar and Sue
B. Moon",
title = "Prefix-preserving {IP} address anonymization:
measurement-based security evaluation and a new
cryptography-based scheme",
journal = j-COMP-NET-AMSTERDAM,
volume = "46",
number = "2",
pages = "253--272",
day = "7",
month = oct,
year = "2004",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 14 17:03:03 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Feng:2004:PEX,
author = "L. Feng and W. Jonker",
title = "Preparations for encrypted {XML} metadata querying",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "19",
number = "3",
pages = "??--??",
month = may,
year = "2004",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Sat May 14 12:27:04 2005",
bibsource = "http://www.crlpublishing.co.uk/cssecont04.htm;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Semantics-Aware Techniques for
Security.",
}
@InProceedings{Fitzi:2004:PSB,
author = "Matthias Fitzi and Stefan Wolf and J{\"u}rg
Wullschleger",
title = "Pseudo-signatures, Broadcast, and Multi-party
Computation from Correlated Randomness",
crossref = "Franklin:2004:ACC",
pages = "562--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Forbes:2004:BRN,
author = "Scott Forbes",
title = "Book Reviews: {{\em A .NET Gold Mine: .NET Security
and Cryptography}, by Peter Thorsteinson and G. Gnana
Arun Ganesh (Prentice-Hall 2004, ISBN 0-13-100851-X)}",
journal = j-IEEE-SEC-PRIV,
volume = "2",
number = "4",
pages = "10--10",
month = jul # "\slash " # aug,
year = "2004",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2004.38",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 4 07:44:24 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/sp/2004/04/j4010.htm",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@InProceedings{Fundulaki:2004:SYD,
author = "Irini Fundulaki and Arnaud Sahuguet",
title = "``Share your data, keep your secrets''",
crossref = "ACM:2004:PAS",
pages = "945--946",
year = "2004",
bibdate = "Sun Nov 7 06:14:27 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/pods.bib",
acknowledgement = ack-nhfb,
}
@Article{Galbraith:2004:EDD,
author = "Steven D. Galbraith and Victor Rotger",
title = "Easy decision {Diffie--Hellman} groups",
journal = j-LMS-J-COMPUT-MATH,
volume = "7",
pages = "201--??",
year = "2004",
CODEN = "????",
ISSN = "1461-1570",
bibdate = "Tue Nov 09 08:26:26 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "LMS Journal of Computation and Mathematics",
}
@Book{Garrett:2004:MCT,
author = "Paul B. Garrett",
title = "The mathematics of coding theory: information,
compression, error correction, and finite fields",
publisher = pub-PH,
address = pub-PH:adr,
pages = "x + 398",
year = "2004",
ISBN = "0-13-101967-8",
ISBN-13 = "978-0-13-101967-6",
LCCN = "QA275 .G26 2003",
bibdate = "Tue Feb 15 17:18:13 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Error analysis (Mathematics); Finite fields (Algebra);
Coding theory",
}
@Article{Gassend:2004:IAI,
author = "Blaise Gassend and Daihyun Lim and Dwaine Clarke and
Marten van Dijk and Srinivas Devadas",
title = "Identification and authentication of integrated
circuits",
journal = j-CCPE,
volume = "16",
number = "11",
pages = "1077--1098",
month = sep,
year = "2004",
CODEN = "CCPEBO",
DOI = "https://doi.org/10.1002/cpe.805",
ISSN = "1532-0626 (print), 1532-0634 (electronic)",
ISSN-L = "1532-0626",
bibdate = "Sat May 14 11:30:55 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/1532-0626;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.interscience.wiley.com/journalfinder.html",
acknowledgement = ack-nhfb,
fjournal = "Concurrency and Computation: Prac\-tice and
Experience",
journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626",
onlinedate = "6 Aug 2004",
}
@Article{Gebotys:2004:DSC,
author = "Catherine H. Gebotys",
title = "Design of secure cryptography against the threat of
power-attacks in {DSP}-embedded processors",
journal = j-TECS,
volume = "3",
number = "1",
pages = "92--113",
month = feb,
year = "2004",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Sat Mar 6 07:14:21 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@InProceedings{Gennaro:2004:MTC,
author = "Rosario Gennaro",
title = "Multi-trapdoor Commitments and Their Applications to
Proofs of Knowledge Secure Under Concurrent
Man-in-the-Middle Attacks",
crossref = "Franklin:2004:ACC",
pages = "220--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@InProceedings{Gentry:2004:HCR,
author = "Craig Gentry",
title = "How to Compress {Rabin} Ciphertexts and Signatures
(and More)",
crossref = "Franklin:2004:ACC",
pages = "179--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Book{Goldreich:2004:FCV,
author = "Oded Goldreich",
title = "Foundations of Cryptography: Volume 2: Basic
Applications",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "373--798",
year = "2004",
ISBN = "0-521-83084-2",
ISBN-13 = "978-0-521-83084-3",
LCCN = "QA268 .G5745 2001",
bibdate = "Wed Sep 14 14:23:22 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See also volume 1 \cite{Goldreich:2001:FCBa}.",
URL = "http://www.loc.gov/catdir/description/cam021/00049362.html;
http://www.loc.gov/catdir/toc/cam023/00049362.html",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Mathematics",
}
@Article{Goldsmith:2004:CAI,
author = "Clair W. Goldsmith and Rob Kolstad",
title = "A Conversation About Identity Management",
journal = j-LOGIN,
volume = "29",
number = "5",
pages = "??--??",
month = oct,
year = "2004",
CODEN = "LOGNEM",
ISSN = "1044-6397",
bibdate = "Tue Apr 11 10:52:44 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.usenix.org/publications/login/2004-10/index.html",
URL = "http://www.usenix.org/publications/login/2004-10/pdfs/interview.pdf",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@InProceedings{Goodrich:2004:ETB,
author = "Michael T. Goodrich and Jonathan Z. Sun and Roberto
Tamassia",
title = "Efficient Tree-Based Revocation in Groups of Low-State
Devices",
crossref = "Franklin:2004:ACC",
pages = "511--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Gordon:2004:TEA,
author = "Andrew D. Gordon and Alan Jeffrey",
title = "Types and effects for asymmetric cryptographic
protocols",
journal = j-J-COMP-SECUR,
volume = "12",
number = "3--4",
pages = "435--483",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-123-406",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:26 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Gorrieri:2004:SFR,
author = "Roberto Gorrieri and Fabio Martinelli",
title = "A simple framework for real-time cryptographic
protocol analysis with compositional proof rules",
journal = j-SCI-COMPUT-PROGRAM,
volume = "50",
number = "1--3",
pages = "23--49",
month = mar,
year = "2004",
CODEN = "SCPGD4",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Fri Apr 1 18:38:37 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01676423",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423",
}
@Book{Gross:2004:MNh,
author = "Benedict H. Gross and Joe Harris",
title = "The Magic of Numbers",
publisher = "Pearson Education",
address = "Upper Saddle River, NJ, USA",
pages = "xiv + 287",
year = "2004",
ISBN = "0-13-177721-1",
ISBN-13 = "978-0-13-177721-7",
LCCN = "QA39.3 .G76 2003",
MRclass = "00Axx",
bibdate = "Sun Jan 10 15:34:15 MST 2021",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
author-dates = "1950--",
subject = "Mathematics; Matematik.",
tableofcontents = "I: Counting \\
1: Simple Counting \\
2: The Multiplication Principle \\
3: The Subtraction Principle \\
4: Collections \\
5: Probability \\
6: The Binomial Theorem \\
7: Advanced Counting \\
\\
II: Arithmetic \\
8: Divisibility \\
9: Combinations \\
10: Primes \\
11: Factorization \\
12: Consequences \\
13: Relatively Prime \\
\\
III: Modular Aritmetic \\
14: What is a Number? \\
15: Modular Arithmetic \\
16: Congruences \\
17: Division \\
18: Powers \\
19: Roots \\
20: Eulers Theorem \\
\\
IV: Codes and Primes \\
21: Codes \\
22: Public-Key Cryptography \\
23: Finding Primes \\
24: Generators, Roots, and Passwords",
}
@Article{Guida:2004:DUP,
author = "Richard Guida and Robert Stahl and Thomas Bunt and
Gary Secrest and Joseph Moorcones",
title = "Deploying and Using Public Key Technology: Lessons
Learned in Real Life",
journal = j-IEEE-SEC-PRIV,
volume = "2",
number = "4",
pages = "67--71",
month = jul # "\slash " # aug,
year = "2004",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2004.41",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 4 07:44:24 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/sp/2004/04/j4067.htm;
http://csdl.computer.org/dl/mags/sp/2004/04/j4067.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Gumz:2004:BRH,
author = "Joy Gumz",
title = "Book Review: {{\em Hacking Exposed: Network Security
Secrets and Solutions}, 4th ed., by Stuart McClure,
Joel Scambray, and George Kurtz, McGraw-Hill, 2003,
\$49.99, ISBN 0-07-222742-7}",
journal = j-QUEUE,
volume = "1",
number = "10",
pages = "88--88",
month = feb,
year = "2004",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Sat Mar 6 07:19:32 MST 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/queue.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Book{Gutmann:2004:CSA,
author = "Peter Gutmann",
title = "Cryptographic Security Architecture: Design and
Verification",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 320",
year = "2004",
ISBN = "0-387-95387-6",
ISBN-13 = "978-0-387-95387-8",
LCCN = "QA76.9.A25 G88 2002",
bibdate = "Mon Oct 20 17:55:18 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.springer-ny.com/",
acknowledgement = ack-nhfb,
}
@Article{Gutmann:2004:SPK,
author = "Peter Gutmann",
title = "Simplifying Public Key Management",
journal = j-COMPUTER,
volume = "37",
number = "2",
pages = "101--??",
month = feb,
year = "2004",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 4 16:02:09 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/co/2004/02/r2101abs.htm;
http://csdl.computer.org/dl/mags/co/2004/02/r2101.htm;
http://csdl.computer.org/dl/mags/co/2004/02/r2101.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Guttman:2004:ATD,
author = "Joshua D. Guttman",
title = "Authentication tests and disjoint encryption: A design
method for security protocols",
journal = j-J-COMP-SECUR,
volume = "12",
number = "3--4",
pages = "409--433",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-123-405",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:26 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Guttman:2004:FAP,
author = "Joshua D. Guttman and F. Javier Thayer and Lenore D.
Zuck",
title = "The faithfulness of abstract protocol analysis:
Message authentication",
journal = j-J-COMP-SECUR,
volume = "12",
number = "6",
pages = "865--891",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-12603",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:36 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Haastad:2004:SAR,
author = "Johan H{\aa}stad and Mats N{\aa}slund",
title = "The security of all {RSA} and discrete log bits",
journal = j-J-ACM,
volume = "51",
number = "2",
pages = "187--230",
month = mar,
year = "2004",
CODEN = "JACOAH",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Mar 6 07:04:43 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@InProceedings{Halpern:2004:RSS,
author = "Joseph Halpern and Vanessa Teague",
title = "Rational secret sharing and multiparty computation:
extended abstract",
crossref = "ACM:2004:PAA",
pages = "623--632",
year = "2004",
bibdate = "Wed Apr 5 05:59:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Hankerson:2004:GEC,
author = "Darrel Hankerson and Alfred J. Menezes and Scott
Vanstone",
title = "Guide to Elliptic Curve Cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xx + 311",
year = "2004",
ISBN = "0-387-95273-X",
ISBN-13 = "978-0-387-95273-4",
LCCN = "QA76.9.A25 H37 2003",
bibdate = "Fri Mar 05 17:54:57 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$59.95",
acknowledgement = ack-nhfb,
}
@InProceedings{Hawkes:2004:RVC,
author = "Philip Hawkes and Gregory G. Rose",
title = "Rewriting Variables: The Complexity of Fast Algebraic
Attacks on Stream Ciphers",
crossref = "Franklin:2004:ACC",
pages = "390--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Hayat:2004:CSE,
author = "Khawaja Amer Hayat and Umar Waqar Anis and S.
Tauseef-ur-Rehman",
title = "Cryptanalysis of some encryption\slash cipher schemes
using related key attack",
journal = j-SIGCSE,
volume = "36",
number = "4",
pages = "85--87",
month = dec,
year = "2004",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1041624.1041665",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:12 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
note = "{NOTE FROM ACM}: It has been determined that the
authors of this article plagiarized the contents from a
previously published paper. Therefore {ACM} has shut
off access to this paper.",
abstract = "NOTE FROM ACM: It has been determined that the authors
of this article plagiarized the contents from a
previously published paper. Therefore ACM has shut off
access to this paper. To see the paper that was
plagiarized, click here Additional Links The citation
in ACM's Guide to Computing Literature, click here The
available link from Springer, click here For further
information, contact the ACM Director of
Publications.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Hernandez:2004:FED,
author = "Julio C. Hernandez and Pedro Isasi",
title = "Finding Efficient Distinguishers for Cryptographic
Mappings, with an Application to the Block Cipher
{TEA}",
journal = j-COMPUT-INTELL,
volume = "20",
number = "3",
pages = "517--525",
month = aug,
year = "2004",
CODEN = "COMIE6",
DOI = "https://doi.org/10.1111/j.0824-7935.2004.00250.x",
ISSN = "0824-7935 (print), 1467-8640 (electronic)",
ISSN-L = "0824-7935",
bibdate = "Fri Apr 1 07:46:37 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/computintell.bib",
acknowledgement = ack-nhfb,
ajournal = "Comput. Intell.",
fjournal = "Computational Intelligence",
journal-URL = "https://onlinelibrary.wiley.com/journal/14678640",
onlinedate = "27 July 2004",
}
@Article{Hernandez:2004:STN,
author = "Julio C. Hernandez and Jos{\'e} Mar{\'\i}a Sierra and
Andre Seznec",
title = "The {SAC} Test: a New Randomness Test, with Some
Applications to {PRNG} Analysis",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2004",
pages = "960--967",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-540-24707-4_108",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Feb 01 16:40:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.springerlink.com/content/an44921nlaa5bf0g/",
abstract = "A new statistical test for randomness, the SAC test,
is presented, together with its results over some
well-known generators in the literature. These results
are analyzed and some possible applications of the
test, as for measuring the strength of cryptographic
primitives including block ciphers, stream ciphers and
pseudorandom number generators, especially during the
design and analysis phase, are detailed. Finally, the
source code for the SAC test is provided, which proves
some of its other advantages: it is easy to implement,
and very fast so well-suited for practical
applications.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Hess:2004:CTT,
author = "Adam Hess and Jason Holt and Jared Jacobson and Kent
E. Seamons",
title = "Content-triggered trust negotiation",
journal = j-TISSEC,
volume = "7",
number = "3",
pages = "428--456",
month = aug,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Hess:2004:GAR,
author = "Florian Hess",
title = "The {GHS} attack revisited",
journal = j-LMS-J-COMPUT-MATH,
volume = "7",
pages = "167--??",
year = "2004",
CODEN = "????",
ISSN = "1461-1570",
bibdate = "Tue Nov 09 08:26:26 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "LMS Journal of Computation and Mathematics",
keywords = "elliptic curve discrete logarithm problem (ECDLP)",
}
@Article{Hess:2004:SVE,
author = "F. Hess",
title = "On the security of the verifiably-encrypted signature
scheme of {Boneh}, {Gentry}, {Lynn} and {Shacham}",
journal = j-INFO-PROC-LETT,
volume = "89",
number = "3",
pages = "111--114",
day = "14",
month = feb,
year = "2004",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Jan 26 08:44:33 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Hodjat:2004:HTP,
author = "Alireza Hodjat and Ingrid Verbauwhede",
title = "High-Throughput Programmable Cryptocoprocessor",
journal = j-IEEE-MICRO,
volume = "24",
number = "3",
pages = "34--45",
month = may # "\slash " # jun,
year = "2004",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2004.11",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Sat Dec 11 17:59:16 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/mi/2004/03/m3034.htm;
http://csdl.computer.org/dl/mags/mi/2004/03/m3034.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Book{Hoglund:2004:ESH,
author = "Greg Hoglund and Gary McGraw",
title = "Exploiting software: how to break code",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxxv + 471",
year = "2004",
ISBN = "0-201-78695-8 (paperback)",
ISBN-13 = "978-0-201-78695-8 (paperback)",
LCCN = "QA76.9.A25 H635 2004",
bibdate = "Thu Jun 23 18:36:27 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0411/2003025556.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer software; Testing;
Computer hackers",
}
@InProceedings{Holenstein:2004:CCB,
author = "Thomas Holenstein and Ueli Maurer and Johan
Sj{\"o}din",
title = "Complete Classification of Bilinear Hard-Core
Functions",
crossref = "Franklin:2004:ACC",
pages = "73--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Hong:2004:DCT,
author = "Seokhie Hong and Deukjo Hong and Youngdai Ko and
Donghoon Chang and Wonil Lee and Sangjin Lee",
title = "Differential Cryptanalysis of {TEA} and {XTEA}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2971",
pages = "402--417",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-540-24691-6_30",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Feb 01 16:53:31 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.springerlink.com/content/n4exvw35x7g8t6pb/",
abstract = "TEA and XTEA are simple block ciphers consisting of
exclusive-or, addition, and shift. Although their round
functions are very simple and guarantee a little
security, large number of 64 rounds have made them
secure enough. It seems that the best result for TEA is
the related-key attack [3], but it is less reasonable
than such attacks for one key as differential and
linear attacks. Impossible differential attacks on
12-round TEA and 14-round XTEA are best results except
for related-key attack [5]. We suggest differential and
truncated differential attacks on TEA and XTEA better
than them. Our best results on TEA and XTEA are attacks
on 17-round TEA and 23-round XTEA.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "Block cipher; differential cryptanalysis; TEA;
truncated differential cryptanalysis; XTEA",
}
@InProceedings{Hsiao:2004:FCP,
author = "Chun-Yuan Hsiao and Leonid Reyzin",
title = "Finding Collisions on a Public Road, or Do Secure Hash
Functions Need Secret Coins?",
crossref = "Franklin:2004:ACC",
pages = "92--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Hsu:2004:EPS,
author = "Chien-Lung Hsu and Tzong-Sun Wu",
title = "Efficient proxy signature schemes using self-certified
public keys",
journal = j-APPL-MATH-COMP,
volume = "152",
number = "3",
pages = "807--820",
day = "13",
month = may,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:31 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hsu:2004:GOS,
author = "Chien-Lung Hsu and Tzong-Sun Wu and Tzong-Chen Wu",
title = "Group-oriented signature scheme with distinguished
signing authorities",
journal = j-FUT-GEN-COMP-SYS,
volume = "20",
number = "5",
pages = "865--873",
day = "15",
month = jun,
year = "2004",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Huang:2004:NDE,
author = "Hui-Feng Huang and Chin-Chen Chang",
title = "A new design of efficient partially blind signature
scheme",
journal = j-J-SYST-SOFTW,
volume = "73",
number = "3",
pages = "397--403",
month = nov # "\slash " # dec,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:26 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Hughes:2004:ISE,
author = "Jim Hughes",
title = "{IEEE} Standard for Encrypted Storage",
journal = j-COMPUTER,
volume = "37",
number = "11",
pages = "110--??",
month = nov,
year = "2004",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2004.210",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 4 16:02:13 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2004/11/ry110.htm;
http://csdl.computer.org/dl/mags/co/2004/11/ry110.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{Husemoller:2004:EC,
author = "Dale Husem{\"o}ller",
title = "Elliptic curves",
volume = "111",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xxi + 487",
year = "2004",
ISBN = "0-387-95490-2",
ISBN-13 = "978-0-387-95490-5",
LCCN = "QA567 .H897 2004",
bibdate = "Wed Mar 12 17:13:23 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
note = "With appendices by Stefan Theisen, Otto Forster, and
Ruth Lawrence.",
series = "Graduate texts in mathematics",
URL = "http://www.loc.gov/catdir/enhancements/fy0814/2002067016-d.html;
http://www.loc.gov/catdir/enhancements/fy0814/2002067016-t.html",
acknowledgement = ack-nhfb,
subject = "Curves, Elliptic; Curves, Algebraic; Group schemes
(Mathematics)",
}
@Article{Hwang:2004:KAS,
author = "Min-Shiang Hwang and Li-Hua Li and Cheng-Chi Lee",
title = "A key authentication scheme with non-repudiation",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "75--78",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Hwang:2004:NMP,
author = "Shin-Jia Hwang and Chiu-Chin Chen",
title = "New multi-proxy multi-signature schemes",
journal = j-APPL-MATH-COMP,
volume = "147",
number = "1",
pages = "57--67",
day = "5",
month = jan,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:41:15 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hwang:2004:REL,
author = "Shin-Jia Hwang and Yun-Hua Lee",
title = "Repairing {ElGamal}-like multi-signature schemes using
self-certified public keys",
journal = j-APPL-MATH-COMP,
volume = "156",
number = "1",
pages = "73--83",
day = "25",
month = aug,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:34 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Isasi:2004:IAE,
author = "Pedro Isasi and Julio C. Hernandez",
title = "Introduction to the Applications of Evolutionary
Computation in Computer Security and Cryptography",
journal = j-COMPUT-INTELL,
volume = "20",
number = "3",
pages = "445--449",
month = aug,
year = "2004",
CODEN = "COMIE6",
DOI = "https://doi.org/10.1111/j.0824-7935.2004.00244.x",
ISSN = "0824-7935 (print), 1467-8640 (electronic)",
ISSN-L = "0824-7935",
bibdate = "Fri Apr 1 07:46:37 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/computintell.bib",
acknowledgement = ack-nhfb,
ajournal = "Comput. Intell.",
fjournal = "Computational Intelligence",
journal-URL = "https://onlinelibrary.wiley.com/journal/14678640",
onlinedate = "27 July 2004",
}
@Book{ISO:2004:IIIb,
author = "{ISO}",
title = "{ISO\slash IEC} 10118-3:2004: Information technology
--- Security techniques --- Hash-functions --- Part 3:
Dedicated hash-functions",
publisher = pub-ISO,
address = pub-ISO:adr,
pages = "94",
month = feb,
year = "2004",
bibdate = "Tue Feb 07 07:44:15 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.iso.org/iso/en/CatalogueDetailPage.CatalogueDetail?CSNUMBER=39876",
abstract = "ISO/IEC 10118-3:2004 specifies the following seven
dedicated hash-functions, i.e., specially-designed
hash-functions:\par
\begin{itemize} \item the first hash-function
(RIPEMD-160) in Clause 7 provides hash-codes of lengths
up to 160 bits; \item the second hash-function
(RIPEMD-128) in Clause 8 provides hash-codes of lengths
up to 128 bits; \item the third hash-function (SHA-1)
in Clause 9 provides hash-codes of lengths up to 160
bits; \item the fourth hash-function (SHA-256) in
Clause 10 provides hash-codes of lengths up to 256
bits; \item the fifth hash-function (SHA-512) in Clause
11 provides hash-codes of lengths up to 512 bits; \item
the sixth hash-function (SHA-384) in Clause 12 provides
hash-codes of a fixed length, 384 bits; and \item the
seventh hash-function (WHIRLPOOL) in Clause 13 provides
hash-codes of lengths up to 512 bits. \end{itemize}
For each of these dedicated hash-functions, ISO/IEC
10118-3:2004 specifies a round-function that consists
of a sequence of sub-functions, a padding method,
initializing values, parameters, constants, and an
object identifier as normative information, and also
specifies several computation examples as informative
information.",
acknowledgement = ack-nhfb,
xxISBN = "????",
xxLCCN = "",
}
@Article{Jaeger:2004:CAA,
author = "Trent Jaeger and Antony Edwards and Xiaolan Zhang",
title = "Consistency analysis of authorization hook placement
in the {Linux} security modules framework",
journal = j-TISSEC,
volume = "7",
number = "2",
pages = "175--205",
month = may,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Jiang:2004:FAP,
author = "Rui Jiang and Li Pan and Jian-Hua Li",
title = "Further analysis of password authentication schemes
based on authentication tests",
journal = j-COMPUT-SECUR,
volume = "23",
number = "6",
pages = "469--477",
month = sep,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001038",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Joux:2004:MIH,
author = "Antoine Joux",
title = "Multicollisions in Iterated Hash Functions.
Application to Cascaded Constructions",
crossref = "Franklin:2004:ACC",
pages = "306--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Juang:2004:EPA,
author = "Wen-Shenq Juang",
title = "Efficient password authenticated key agreement using
smart cards",
journal = j-COMPUT-SECUR,
volume = "23",
number = "2",
pages = "167--173",
month = mar,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804000252",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Juang:2004:FBT,
author = "Wen-Shenq Juang and Horng-Twu Liaw",
title = "Fair blind threshold signatures in wallet with
observers",
journal = j-J-SYST-SOFTW,
volume = "72",
number = "1",
pages = "25--31",
month = jun,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:24 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Katz:2004:ROS,
author = "Jonathan Katz and Rafail Ostrovsky",
title = "Round-Optimal Secure Two-Party Computation",
crossref = "Franklin:2004:ACC",
pages = "335--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Kim:2004:TBG,
author = "Yongdae Kim and Adrian Perrig and Gene Tsudik",
title = "Tree-based group key agreement",
journal = j-TISSEC,
volume = "7",
number = "1",
pages = "60--96",
month = feb,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Kirovski:2004:DWF,
author = "Darko Kirovski and Henrique and Yacov Yacobi",
title = "A Dual Watermark-Fingerprint System",
journal = j-IEEE-MULTIMEDIA,
volume = "11",
number = "3",
pages = "59--73",
month = jul # "\slash " # sep,
year = "2004",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2004.1",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Sat Dec 11 17:34:41 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/mu/2004/03/u3059.htm;
http://csdl.computer.org/dl/mags/mu/2004/03/u3059.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Koblitz:2004:OTS,
author = "Neal Koblitz and Alfred J. Menezes",
title = "Obstacles to the torsion-subgroup attack on the
decision {Diffie--Hellman Problem}",
journal = j-MATH-COMPUT,
volume = "73",
number = "248",
pages = "2027--2041",
month = oct,
year = "2004",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Aug 11 08:23:09 MDT 2004",
bibsource = "http://www.ams.org/mcom/2004-73-248;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/mcom/2004-73-248/S0025-5718-04-01637-0/home.html;
http://www.ams.org/mcom/2004-73-248/S0025-5718-04-01637-0/S0025-5718-04-01637-0.dvi;
http://www.ams.org/mcom/2004-73-248/S0025-5718-04-01637-0/S0025-5718-04-01637-0.pdf;
http://www.ams.org/mcom/2004-73-248/S0025-5718-04-01637-0/S0025-5718-04-01637-0.ps;
http://www.ams.org/mcom/2004-73-248/S0025-5718-04-01637-0/S0025-5718-04-01637-0.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Koblitz:2004:SPK,
author = "Neal Koblitz and Alfred J. Menezes",
title = "A Survey of Public-Key Cryptosystems",
journal = j-SIAM-REVIEW,
volume = "46",
number = "4",
pages = "599--634",
month = dec,
year = "2004",
CODEN = "SIREAD",
DOI = "https://doi.org/10.1137/S0036144503439190",
ISSN = "0036-1445 (print), 1095-7200 (electronic)",
ISSN-L = "0036-1445",
bibdate = "Sat Apr 16 12:47:34 MDT 2005",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toc/SIREV/46/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/43919",
acknowledgement = ack-nhfb,
fjournal = "SIAM Review",
journal-URL = "http://epubs.siam.org/sirev",
}
@Book{Kozaczuk:2004:EHP,
author = "W{\l}adys{\l}aw Kozaczuk and Jerzy Straszak",
title = "{Enigma}: how the {Poles} broke the {Nazi} code",
publisher = "Hippocrene Books",
address = "New York, NY, USA",
pages = "viii + 163",
year = "2004",
ISBN = "0-7818-0941-X",
ISBN-13 = "978-0-7818-0941-2",
LCCN = "D810.C88 K67 2004",
bibdate = "Thu Feb 23 07:27:33 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/fy051/2004040636.html",
acknowledgement = ack-nhfb,
subject = "Enigma cipher system; ULTRA (Intelligence system);
World War, 1939-1945; Electronic intelligence; Poland;
Great Britain; Cryptography; History; 20th century",
}
@Article{Ku:2004:HBS,
author = "Wei-Chi Ku",
title = "A hash-based strong-password authentication scheme
without using {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "29--34",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@InProceedings{Kurosawa:2004:NPH,
author = "Kaoru Kurosawa and Yvo Desmedt",
title = "A New Paradigm of Hybrid Encryption Scheme",
crossref = "Franklin:2004:ACC",
pages = "426--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Lai:2004:SGS,
author = "Chun-Pong Lai and Cunsheng Ding",
title = "Several Generalizations of {Shamir's} Secret Sharing
Scheme",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "2",
pages = "445--??",
month = apr,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 06 08:20:19 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijfcs.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Landau:2004:PNS,
author = "Susan Landau",
title = "Polynomials in the Nation's Service: Using Algebra to
Design the {Advanced Encrypted Standard}",
journal = j-AMER-MATH-MONTHLY,
volume = "111",
number = "2",
pages = "89--117",
month = feb,
year = "2004",
CODEN = "AMMYAE",
ISSN = "0002-9890 (print), 1930-0972 (electronic)",
ISSN-L = "0002-9890",
bibdate = "Tue Mar 16 06:13:26 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://research.sun.com/people/slandau/maa1.pdf;
http://www.esat.kuleuven.ac.be/~rijmen/rijndael;
http://www.rsasecurity.com/rsalabs/faq3-1.html",
acknowledgement = ack-nhfb,
fjournal = "American Mathematical Monthly",
journal-URL = "https://www.jstor.org/journals/00029890.htm",
}
@InProceedings{Landau:2004:SLE,
author = "Susan Landau",
title = "Security, Liberty, and Electronic Communications",
crossref = "Franklin:2004:ACC",
pages = "355--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Lee:2004:CIB,
author = "Wei-Bin Lee and Kuan-Chieh Liao",
title = "Constructing identity-based cryptosystems for discrete
logarithm based cryptosystems",
journal = j-J-NETW-COMPUT-APPL,
volume = "27",
number = "4",
pages = "191--199",
month = nov,
year = "2004",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:42:56 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804504000268",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Lee:2004:CUA,
author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo",
title = "Cryptanalysis of a user authentication scheme using
hash functions",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "24--28",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lee:2004:CUS,
author = "Narn-Yih Lee and Pei-Hsiu Ho",
title = "Convertible undeniable signature with subliminal
channels",
journal = j-APPL-MATH-COMP,
volume = "158",
number = "1",
pages = "169--175",
day = "25",
month = oct,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2004:DEB,
author = "Chang-Doo Lee and Bong-Jun Choi and Kyoo-Seok Park",
title = "Design and evaluation of a block encryption algorithm
using dynamic-key mechanism",
journal = j-FUT-GEN-COMP-SYS,
volume = "20",
number = "2",
pages = "327--338",
day = "16",
month = feb,
year = "2004",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Lee:2004:DIS,
author = "Wongoo Lee and Jaekwang Lee",
title = "Design and implementation of secure e-mail system
using elliptic curve cryptosystem",
journal = j-FUT-GEN-COMP-SYS,
volume = "20",
number = "2",
pages = "315--326",
day = "16",
month = feb,
year = "2004",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Lee:2004:ETP,
author = "Tian-Fu Lee and Tzonelih Hwang and Chun-Li Lin",
title = "Enhanced three-party encrypted key exchange without
server public keys",
journal = j-COMPUT-SECUR,
volume = "23",
number = "7",
pages = "571--577",
month = oct,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001762",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lee:2004:FIM,
author = "Narn-Yih Lee and Ming-Feng Lee",
title = "Further improvement on the modified authenticated key
agreement scheme",
journal = j-APPL-MATH-COMP,
volume = "157",
number = "3",
pages = "729--733",
day = "15",
month = oct,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2004:IAK,
author = "Narn-Yih Lee and Chien-Nan Wu",
title = "Improved authentication key exchange protocol without
using one-way hash function",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "85--92",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lee:2004:MPA,
author = "Young-Ran Lee and Hyang-Sook Lee and Ho-Kyu Lee",
title = "Multi-party authenticated key agreement protocols from
multi-linear forms",
journal = j-APPL-MATH-COMP,
volume = "159",
number = "2",
pages = "317--331",
day = "6",
month = dec,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:38 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2004:SAA,
author = "Cheng-Chi Lee and Min-Shiang Hwang and I-En Liao",
title = "A server assisted authentication protocol for
detecting error vectors",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "93--96",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lee:2004:SPM,
author = "Hyang-Sook Lee",
title = "A self-pairing map and its applications to
cryptography",
journal = j-APPL-MATH-COMP,
volume = "151",
number = "3",
pages = "671--678",
day = "15",
month = apr,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:30 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2004:SSP,
author = "Jung-Seuk Lee and Jun-Cheol Jeon and Kee-Young Yoo",
title = "A security scheme for protecting security policies in
firewall",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "69--72",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lekkas:2004:CNL,
author = "Dimitris Lekkas and Dimitris Gritzalis",
title = "Cumulative notarization for long-term preservation of
digital signatures",
journal = j-COMPUT-SECUR,
volume = "23",
number = "5",
pages = "413--424",
month = jul,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001014",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Levi:2004:UNC,
author = "Albert Levi and M. Ufuk Caglayan and Cetin K. Koc",
title = "Use of nested certificates for efficient, dynamic, and
trust preserving public key infrastructure",
journal = j-TISSEC,
volume = "7",
number = "1",
pages = "21--59",
month = feb,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Li:2004:CAB,
author = "Hua Li and Chang N. Zhang",
title = "A Cellular Automata Based Reconfigurable Architecture
for Hybrid Cryptosystems",
journal = j-COMP-J,
volume = "47",
number = "3",
pages = "320--328",
month = may,
year = "2004",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 8 12:55:15 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_03/",
URL = "",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Li:2004:CES,
author = "Li-Hua Li and Chi-Yu Liu and Min-Shiang Hwang",
title = "Cryptanalysis of an efficient secure group signature
scheme",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "66--69",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Li:2004:QAU,
author = "Xiaoyu Li and Howard Barnum",
title = "Quantum Authentication Using Entangled States",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "15",
number = "4",
pages = "609--??",
month = aug,
year = "2004",
CODEN = "IFCSEN",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Thu Jan 6 06:10:33 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Li:2004:WMS,
author = "Li Li and David Zhang and Zhigeng Pan and Jiaoying Shi
and Kun Zhou and Kai Ye",
title = "Watermarking {3D} mesh by spherical parameterization",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "28",
number = "6",
pages = "981--989",
month = dec,
year = "2004",
CODEN = "COGRD2",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Thu Jul 14 18:00:20 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00978493",
acknowledgement = ack-nhfb,
fjournal = "Computers and Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Liaw:2004:SPA,
author = "Horng-Twu Liaw and Shiou-Wei Fan and Wei-Chen Wu",
title = "A simple password authentication using a polynomial",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "74--79",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lin:2004:SIS,
author = "Chang-Chou Lin and Wen-Hsiang Tsai",
title = "Secret image sharing with steganography and
authentication",
journal = j-J-SYST-SOFTW,
volume = "73",
number = "3",
pages = "405--414",
month = nov # "\slash " # dec,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:26 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Lin:2004:SOT,
author = "Min-Hui Lin and Chin-Chen Chang",
title = "A secure one-time password authentication scheme with
low-computation for mobile communications",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "76--84",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Lindquist:2004:JCS,
author = "T. Lindquist and M. Diarra and B. Millard",
title = "A {Java} Cryptography Service Provider Implementing
One-Time Pad ({INIDP04})",
journal = "Proceedings of the Annual Hawaii International
Conference on System Sciences",
volume = "CONF37",
pages = "189",
year = "2004",
CODEN = "????",
ISSN = "1060-3425",
bibdate = "Mon Feb 23 16:27:22 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
}
@Article{Liu:2004:MBA,
author = "Donggang Liu and Peng Ning",
title = "Multilevel {$ \mu $TESLA}: {Broadcast} authentication
for distributed sensor networks",
journal = j-TECS,
volume = "3",
number = "4",
pages = "800--836",
month = nov,
year = "2004",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Fri Oct 29 06:35:48 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Lopez:2004:AAI,
author = "Javier Lopez and Rolf Oppliger and G{\"u}nther
Pernul",
title = "Authentication and authorization infrastructures
{(AAIs)}: a comparative survey",
journal = j-COMPUT-SECUR,
volume = "23",
number = "7",
pages = "578--590",
month = oct,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001828",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Lu:2004:FCA,
author = "Yi Lu and Serge Vaudenay",
title = "Faster Correlation Attack on {Bluetooth} Keystream
Generator {E0}",
crossref = "Franklin:2004:ACC",
pages = "407--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Lu:2004:XMS,
author = "Eric Jui-Lin Lu and Rai-Fu Chen",
title = "An {XML} multisignature scheme",
journal = j-APPL-MATH-COMP,
volume = "149",
number = "1",
pages = "1--14",
day = "5",
month = feb,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Jan 9 08:41:21 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Luo:2004:UUR,
author = "Haiyun Luo and Jiejun Kong and Petros Zerfos and
Songwu Lu and Lixia Zhang",
title = "{URSA}: ubiquitous and robust access control for
mobile ad hoc networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "12",
number = "6",
pages = "1049--1063",
month = dec,
year = "2004",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2004.838598",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Tue Apr 12 07:15:18 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Madsen:2004:FFD,
author = "Wayne Madsen",
title = "Former {FBI Director} says encryption fuels
terrorists",
journal = j-NETWORK-SECURITY,
volume = "2004",
number = "4",
pages = "1, 3",
month = apr,
year = "2004",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(04)00059-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:58:58 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485804000595",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Mahle:2004:DDI,
author = "Melissa Boyle Mahle",
title = "Denial and deception: an insider's view of the {CIA}
from {Iran--Contra} to 9/11",
publisher = "Nation Books",
address = "New York, NY, USA",
pages = "xi + 403",
year = "2004",
ISBN = "1-56025-649-4",
ISBN-13 = "978-1-56025-649-6",
LCCN = "JK468.I6 M333 2004",
bibdate = "Thu Jan 19 12:30:08 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Intelligence service; United States",
tableofcontents = "September 11, 2001. Intelligence failure \par
The Webster years (May 26, 1987--August 31, 1991).
Iran--Contra legacy; Directorate of operations; Setting
new standards \par
The Gates years (November 6, 1991--January 20, 1993).
Confirmation of an insider; A new vision; Rethinking
covert action; The directorate of intelligence;
Post-Cold War convulsions \par
The Woolsey years (February 5, 1993--January 10, 1995).
The technocrat and the new world order; New directions;
Adrich Ames; Doing less with less; Woolsey's undoing
\par
The Deutch years (May 10, 1995--December 15, 1996). The
reluctant spy; Politically correct espionage; Al-Qa'ida
dawns; Mission alignment; Unethical spies; Turf and
policy battles; The CIA bites back \par
The Tenet years (July 11, 1997--July 11, 2004). A
pleasant surprise; War on terrorism; The dark side;
Help wanted; Failure; Out of the foxhole \par
The years ahead. Epilogue.",
}
@Book{Mao:2004:MCT,
author = "Wenbo Mao",
title = "Modern Cryptography: Theory and Practice",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "xxxviii + 707",
year = "2004",
ISBN = "0-13-066943-1, 0-13-288741-X (on-demand digital
reprint)",
ISBN-13 = "978-0-13-066943-8, 978-0-13-288741-0 (on-demand
digital reprint)",
LCCN = "????",
bibdate = "Wed Dec 03 07:48:43 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$54.99",
acknowledgement = ack-nhfb,
tableofcontents = "Part 1. Introduction \\
Beginning with a simple communication game \\
Wrestling between safeguard and attack \\
Part 2. Mathematical foundations \\
Probability and information theory \\
Computational complexity \\
Algebraic foundations \\
Number theory \\
Part 3. Basic cryptographic techniques \\
Encryption: symmetric techniques \\
Encryption: asymmetric techniques \\
In an ideal world: bit security of the basic public-key
cryptographic functions \\
Data integrity techniques \\
Part 4. Authentication \\
Authentication protocols: principles \\
Authentication protocols: the real world \\
Authentication framework for public-key cryptography
\\
Part 5. Formal approaches to security establishment \\
Formal and strong security definitions for public-key
cryptosystems \\
Provably secure and efficient public-key cryptosystems
\\
Strong and provable security for digital signatures \\
Formal methods for authentication protocols analysis
\\
Part 6. Cryptographic protocols \\
Zero-knowledge protocols \\
Returning to ``coin flipping over telephone'' \\
Afterremark",
}
@Article{Martel:2004:GMA,
author = "Charles Martel and Glen Nuckolls and Premkumar Devanbu
and Michael Gertz and April Kwong and Stuart G.
Stubblebine",
title = "A General Model for Authenticated Data Structures",
journal = j-ALGORITHMICA,
volume = "39",
number = "1",
pages = "21--41",
month = jan,
year = "2004",
CODEN = "ALGOEJ",
DOI = "https://doi.org/10.1007/s00453-003-1076-8",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68P15 (68P25)",
MRnumber = "MR2036441 (2004k:68039)",
bibdate = "Fri Jan 6 11:42:46 MST 2006",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0178-4617&volume=39&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0178-4617&volume=39&issue=1&spage=21",
acknowledgement = ack-nhfb,
fjournal = "Algorithmica. An International Journal in Computer
Science",
journal-URL = "http://link.springer.com/journal/453",
}
@Article{Martin:2004:AMC,
author = "Cynthia E. Martin and Jeffrey H. Dunn",
title = "Authentication mechanisms for call control message
integrity and origin verification",
journal = j-BELL-LABS-TECH-J,
volume = "8",
number = "4",
pages = "71--91",
month = "Winter",
year = "2004",
CODEN = "BLTJFD",
DOI = "https://doi.org/10.1002/bltj.10088",
ISSN = "1089-7089 (print), 1538-7305 (electronic)",
ISSN-L = "1089-7089",
bibdate = "Fri Nov 26 17:31:33 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
onlinedate = "5 Feb 2004",
}
@Article{Mastroeni:2004:APA,
author = "Isabella Mastroeni",
title = "Algebraic Power Analysis by Abstract Interpretation",
journal = j-HIGHER-ORDER-SYMB-COMPUT,
volume = "17",
number = "4",
pages = "297--345",
month = dec,
year = "2004",
CODEN = "LSCOEX",
DOI = "https://doi.org/10.1007/s10990-004-4867-y",
ISSN = "1388-3690 (print), 2212-0793 (electronic)",
ISSN-L = "1388-3690",
bibdate = "Wed Jul 9 12:34:43 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=17&issue=4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1388-3690&volume=17&issue=4&spage=297",
acknowledgement = ack-nhfb,
fjournal = "Higher-Order and Symbolic Computation",
keywords = "abstract domains; abstract interpretation; algebraic
power analysis; software watermarking; static program
analysis",
}
@InProceedings{Maurer:2004:RCD,
author = "Ueli Maurer",
title = "The role of cryptography in database security",
crossref = "ACM:2004:PAS",
pages = "5--10",
year = "2004",
bibdate = "Sun Nov 7 06:14:27 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{May:2004:CRS,
author = "Alexander May",
title = "Computing the {RSA} Secret Key Is Deterministic
Polynomial Time Equivalent to Factoring",
crossref = "Franklin:2004:ACC",
pages = "213--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{McElheny:2004:TPW,
author = "Victor K. McElheny",
title = "{{\booktitle{Tuxedo Park: A Wall Street Tycoon and the
Secret Palace of Science that Changed the Course of
World War II}}} (review)",
journal = j-TECH-CULTURE,
volume = "45",
number = "2",
pages = "456--457",
month = apr,
year = "2004",
CODEN = "TECUA3",
DOI = "https://doi.org/10.1353/tech.2004.0077",
ISSN = "0040-165X (print), 1097-3729 (electronic)",
ISSN-L = "0040-165X",
bibdate = "Sat Sep 30 08:24:53 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/techculture2000.bib",
URL = "https://muse.jhu.edu/pub/1/article/55675",
acknowledgement = ack-nhfb,
ajournal = "Tech. Culture",
fjournal = "Technology and Culture",
journal-URL = "https://muse.jhu.edu/journal/194",
}
@Article{McKenna:2004:EAE,
author = "Brian McKenna",
title = "Erratum to {``Attacks on the (enhanced) Yang--Shieh
authentication'' [Comput Secur {\bf 22}(8) (2003)
725--727]}",
journal = j-COMPUT-SECUR,
volume = "23",
number = "1",
pages = "85--85",
month = feb,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:54 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Chen:2003:AEY}.",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804000082",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{McKinnon:2004:CCS,
author = "A. David McKinnon and David E. Bakken and John C.
Shovic",
title = "A configurable cryptography subsystem in a middleware
framework for embedded systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "46",
number = "6",
pages = "771--795",
day = "20",
month = dec,
year = "2004",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 14 17:03:05 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Meadows:2004:OSM,
author = "Catherine Meadows",
title = "Ordering from {Satan}'s menu: a survey of requirements
specification for formal analysis of cryptographic
protocols",
journal = j-SCI-COMPUT-PROGRAM,
volume = "50",
number = "1--3",
pages = "3--22",
month = mar,
year = "2004",
CODEN = "SCPGD4",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Fri Apr 1 18:38:37 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01676423",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423",
}
@Article{Micciancio:2004:CTA,
author = "Daniele Micciancio and Bogdan Warinschi",
title = "Completeness theorems for the {Abadi--Rogaway}
language of encrypted expressions",
journal = j-J-COMP-SECUR,
volume = "12",
number = "1",
pages = "99--129",
month = "????",
year = "2004",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2004-12105",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:19 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib;
https://www.math.utah.edu/pub/tex/bib/sgml2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Millan:2004:NCE,
author = "William Millan and Joanne Fuller and Ed Dawson",
title = "New Concepts in Evolutionary Search for {Boolean}
Functions in Cryptology",
journal = j-COMPUT-INTELL,
volume = "20",
number = "3",
pages = "463--474",
month = aug,
year = "2004",
CODEN = "COMIE6",
DOI = "https://doi.org/10.1111/j.0824-7935.2004.00246.x",
ISSN = "0824-7935 (print), 1467-8640 (electronic)",
ISSN-L = "0824-7935",
bibdate = "Fri Apr 1 07:46:37 MDT 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/computintell.bib",
acknowledgement = ack-nhfb,
ajournal = "Comput. Intell.",
fjournal = "Computational Intelligence",
journal-URL = "https://onlinelibrary.wiley.com/journal/14678640",
onlinedate = "27 July 2004",
}
@InProceedings{Molland:2004:ICA,
author = "H{\aa}vard Molland and Tor Helleseth",
title = "An Improved Correlation Attack Against Irregular
Clocked and Filtered Keystream Generators",
crossref = "Franklin:2004:ACC",
pages = "373--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Montenegro:2004:CBI,
author = "Gabriel Montenegro and Claude Castelluccia",
title = "Crypto-based identifiers {(CBIDs)}: {Concepts} and
applications",
journal = j-TISSEC,
volume = "7",
number = "1",
pages = "97--127",
month = feb,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Moran:2004:NIT,
author = "Tal Moran and Ronen Shaltiel and Amnon Ta-Shma",
title = "Non-interactive Timestamping in the Bounded Storage
Model",
crossref = "Franklin:2004:ACC",
pages = "460--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Book{Mrayati:2004:IAD,
editor = "M. Mrayati and Y. Meer Alam and M. H. at-Tayyan",
title = "{Ibn 'ad-Durayhim's} treatise on cryptanalysis",
volume = "3",
publisher = "KFCRIS \& KACST",
address = "Riyadh, Saudi Arabia",
pages = "127",
year = "2004",
ISBN = "9960-890-20-0",
ISBN-13 = "978-9960-890-20-3",
LCCN = "????",
bibdate = "Thu May 12 06:53:13 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "{Arabic} origins of cryptology",
acknowledgement = ack-nhfb,
keywords = "cryptography / Arab countries / history",
}
@Article{Muzereau:2004:EBD,
author = "A. Muzereau and N. P. Smart and F. Vercauteren",
title = "The equivalence between the {DHP} and {DLP} for
elliptic curves used in practical applications",
journal = j-LMS-J-COMPUT-MATH,
volume = "7",
pages = "50--??",
year = "2004",
CODEN = "????",
ISSN = "1461-1570",
bibdate = "Tue Nov 09 08:26:26 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "LMS Journal of Computation and Mathematics",
}
@Article{Naor:2004:NTC,
author = "Moni Naor and Omer Reingold",
title = "Number-theoretic constructions of efficient
pseudo-random functions",
journal = j-J-ACM,
volume = "51",
number = "2",
pages = "231--262",
month = mar,
year = "2004",
CODEN = "JACOAH",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Mar 6 07:04:43 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Book{Nedjah:2004:ECH,
editor = "Nadia Nedjah and Luiza de {Macedo Mourelle}",
title = "Embedded cryptographic hardware: methodologies and
architectures",
publisher = "Nova Science Publishers",
address = "New York, NY, USA",
pages = "ix + 295",
year = "2004",
ISBN = "1-59454-012-8 (hardcover)",
ISBN-13 = "978-1-59454-012-7 (hardcover)",
LCCN = "TK5102.94 .E49 2004",
bibdate = "Mon Mar 5 14:58:51 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "http://www.loc.gov/catdir/toc/ecip0417/2004008204.html",
acknowledgement = ack-nhfb,
subject = "Telecommunication; Security measures; Data encryption
(Computer science); Computer security; Embedded
computer systems",
}
@Misc{Netscape:2004:HSW,
author = "{Netscape Communications, Inc.}",
title = "How {SSL} Works",
howpublished = "Worldwide Web document.",
day = "27",
month = aug,
year = "2004",
bibdate = "Thu Jun 23 08:48:15 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "This is a tutorial of how the Secure Sockets Layer
(SSL) protocol works.",
URL = "http://developer.netscape.com/tech/security/ssl/howitworks.html;
http://web.archive.org/web/20040827080204/",
acknowledgement = ack-nhfb,
}
@Book{Neuenschwander:2004:PSM,
author = "Daniel Neuenschwander",
title = "{Probabilistic and Statistical Methods in Cryptology:
An Introduction by Selected Topics}",
volume = "3028",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 158",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b97045",
ISBN = "3-540-22001-1",
ISBN-13 = "978-3-540-22001-5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76 A1 L43 3028",
bibdate = "Tue Nov 16 07:48:43 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3028.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3028;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b97045",
acknowledgement = ack-nhfb,
}
@Article{Niederreiter:2004:BRC,
author = "H. Niederreiter",
title = "Book review: {{\em Cryptographic applications of
analytic number theory}}",
journal = j-MATH-COMPUT,
volume = "73",
number = "247",
pages = "1581--1582",
month = jul,
year = "2004",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Aug 11 08:23:07 MDT 2004",
bibsource = "http://www.ams.org/mcom/2004-73-247;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib",
URL = "http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/home.html;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.dvi;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.pdf;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.ps;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Ning:2004:TTA,
author = "Peng Ning and Yun Cui and Douglas S. Reeves and
Dingbang Xu",
title = "Techniques and tools for analyzing intrusion alerts",
journal = j-TISSEC,
volume = "7",
number = "2",
pages = "274--318",
month = may,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Okeya:2004:SBR,
author = "Katsuyuki Okeya and Katja Schmidt-Samoa and Christian
Spahn and Tsuyoshi Takagi",
title = "Signed Binary Representations Revisited",
crossref = "Franklin:2004:ACC",
pages = "123--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Page:2004:PCA,
author = "D. Page and N. P. Smart",
title = "Parallel cryptographic arithmetic using a redundant
{Montgomery} representation",
journal = j-IEEE-TRANS-COMPUT,
volume = "53",
number = "11",
pages = "1474--1482",
month = nov,
year = "2004",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2004.100",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:12:46 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1336767",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Park:2004:APP,
author = "Chang-Seop Park",
title = "Authentication protocol providing user anonymity and
untraceability in wireless mobile communication
systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "44",
number = "2",
pages = "267--273",
day = "5",
month = feb,
year = "2004",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Mon Feb 9 06:35:22 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Park:2004:UUC,
author = "Jaehong Park and Ravi Sandhu",
title = "The {UCON$_{ABC}$} usage control model",
journal = j-TISSEC,
volume = "7",
number = "1",
pages = "128--174",
month = feb,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Patarin:2004:SRF,
author = "Jacques Patarin",
title = "Security of Random {Feistel} Schemes with $5$ or More
Rounds",
crossref = "Franklin:2004:ACC",
pages = "106--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Book{Peikari:2004:SW,
author = "Cyrus Peikari and Anton Chuvakin",
title = "Security warrior",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xvii + 531",
year = "2004",
ISBN = "0-596-00545-8",
ISBN-13 = "978-0-596-00545-0",
LCCN = "TK5105.59 .P44985 2004",
bibdate = "Mon Apr 18 15:07:43 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures",
}
@Article{Peinado:2004:CLK,
author = "A. Peinado",
title = "Cryptanalysis of {LHL}-key authentication scheme",
journal = j-APPL-MATH-COMP,
volume = "152",
number = "3",
pages = "721--724",
day = "13",
month = may,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:31 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Phan:2004:IDC,
author = "Raphael C.-W. Phan",
title = "Impossible differential cryptanalysis of 7-round
{Advanced Encryption Standard (AES)}",
journal = j-INFO-PROC-LETT,
volume = "91",
number = "1",
pages = "33--38",
day = "16",
month = jul,
year = "2004",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:53 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Prabhakaran:2004:NNS,
author = "Manoj Prabhakaran and Amit Sahai",
title = "New notions of security: achieving universal
composability without trusted setup",
crossref = "ACM:2004:PAA",
pages = "242--251",
year = "2004",
bibdate = "Wed Apr 5 05:59:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Puzmanova:2004:RWF,
author = "Rita Puzmanova",
title = "Review of {{\em Wi-Foo: The Secrets of Wireless
Hacking\/} by Andrew Vladimirov, Konstantin V.
Gravrilenko, and Andrei A. Mikhailovsky. Pearson
Education, 2004, ISBN 0-321-20217-1}",
journal = j-QUEUE,
volume = "2",
number = "8",
pages = "70--70",
month = nov,
year = "2004",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Thu Jun 23 16:38:50 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/queue.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Article{Regev:2004:NLB,
author = "Oded Regev",
title = "New lattice-based cryptographic constructions",
journal = j-J-ACM,
volume = "51",
number = "6",
pages = "899--942",
month = nov,
year = "2004",
CODEN = "JACOAH",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Jan 15 06:33:05 MST 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jacm.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Reyhani-Masoleh:2004:TFT,
author = "Arash Reyhani-Masoleh and M. Anwar Hasan",
title = "Towards fault-tolerant cryptographic computations over
finite fields",
journal = j-TECS,
volume = "3",
number = "3",
pages = "593--613",
month = aug,
year = "2004",
CODEN = "????",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Fri Oct 29 06:35:47 MDT 2004",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
}
@Article{Riley:2004:HAE,
author = "Joseph Riley and Michael J. Schulte",
title = "A Hardware Accelerator for Elliptic Curve Cryptography
over {$ \mathrm {GF}(2^m) $}",
journal = j-INT-J-COMP-RESEARCH,
volume = "??",
number = "??",
pages = "??--??",
year = "2004",
ISSN = "1535-6698",
bibdate = "Sun Mar 04 20:54:26 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Special Issue on Cryptographic Hardware and Embedded
Systems",
URL = "http://mesa.ece.wisc.edu/publications/cp_2004-10.pdf",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Research",
}
@Book{Rosenberg:2004:SWS,
author = "Jonathan B. Rosenberg and David L. Remy",
title = "Securing {Web} services with {WS-Security}:
demystifying {WS-Security}, {WS-Policy}, {SAML}, {XML
Signature}, and {XML Encryption}",
publisher = pub-SAMS,
address = pub-SAMS:adr,
pages = "xiv + 378",
year = "2004",
ISBN = "0-672-32651-5 (paperback)",
ISBN-13 = "978-0-672-32651-6 (paperback)",
LCCN = "TK5105.59 .R68 2004",
bibdate = "Wed Sep 28 08:21:03 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ross:2004:TCN,
author = "P. E. Ross",
title = "10 tech companies for the next 10 years",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "11",
pages = "52--52",
month = nov,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1353793",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "biomedical equipment; computer peripheral equipment;
Crossbow Technology Inc; Cybernetix; Digital integrated
circuits; Displays; Instruments; integrated circuit
manufacture; integrated circuit technology; Integrated
circuit technology; lighting; Lumileds Lighting LLC;
Magiq Technologies Inc; MeshNetworks Inc; Microchips
Inc; Microcomputers; Microvision Inc; nanotechnology;
Nantero Inc; Picsel Technologies Ltd; power
electronics; public key cryptography; Retina; robots;
Robots; semiconductor device manufacture; semiconductor
technology; Semikron International; technological
companies; Technological innovation; telecommunication
services; Telecommunications; undersea robots; Venture
capital",
}
@Article{Rugg:2004:CMV,
author = "Gordon Rugg",
title = "Cryptography: The Mystery of the {Voynich
Manuscript}",
journal = j-SCI-AMER,
volume = "291",
number = "1",
pages = "104--109",
month = jul,
year = "2004",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0704-104",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Fri May 17 10:28:01 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sciam2000.bib",
URL = "http://www.nature.com/scientificamerican/journal/v291/n1/pdf/scientificamerican0704-104.pdf",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
}
@Article{Ryabko:2004:NTR,
author = "B. Ya. Ryabko and V. S. Stognienko and Y. I. Shokin",
title = "A new test for randomness and its application to some
cryptographic problems",
journal = j-J-STAT-PLANN-INFERENCE,
volume = "123",
number = "2",
pages = "365--376",
day = "1",
month = jul,
year = "2004",
CODEN = "JSPIDN",
DOI = "https://doi.org/10.1016/S0378-3758(03)00149-6",
ISSN = "0378-3758 (print), 1873-1171 (electronic)",
ISSN-L = "0378-3758",
bibdate = "Fri Mar 09 12:13:33 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0378375803001496",
acknowledgement = ack-nhfb,
fjournal = "Journal of Statistical Planning and Inference",
keywords = "adaptive chi-square test",
}
@Article{Savelli:2004:NDC,
author = "A. Savelli",
title = "On numerically decipherable codes and their homophonic
partitions",
journal = j-INFO-PROC-LETT,
volume = "90",
number = "3",
pages = "103--108",
day = "16",
month = may,
year = "2004",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:52 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Schneier:2004:SA,
author = "Bruce Schneier",
title = "Sensible Authentication",
journal = j-QUEUE,
volume = "1",
number = "10",
pages = "74--78",
month = feb,
year = "2004",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Sat Mar 6 07:19:32 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Article{Schultz:2004:GBC,
author = "E. Eugene Schultz",
title = "The gap between cryptography and information security:
has it narrowed?",
journal = j-COMPUT-SECUR,
volume = "23",
number = "7",
pages = "531--532",
month = oct,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804002287",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Scott:2004:CIB,
author = "Michael Scott",
title = "Cryptanalysis of an {ID}-based password authentication
scheme using {Smart Cards} and fingerprints",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "73--75",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@InProceedings{Scott:2004:CP,
author = "Michael Scott and Paulo S. L. M. Barreto",
title = "Compressed Pairings",
crossref = "Franklin:2004:ACC",
pages = "140--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Seetharaman:2004:BRB,
author = "Priya Seetharaman",
title = "Book Review: {{\em Beyond Fear---Thinking Sensibly
About Security in an Uncertain World}}, by {Bruce
Schneier}",
journal = j-COMP-J,
volume = "47",
number = "3",
pages = "397--397",
month = may,
year = "2004",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 8 12:55:15 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_03/",
URL = "http://www3.oup.co.uk/computer_journal/free_pdf/470397.pdf;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_03/470397.sgm.abs.html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Seredynski:2004:CAC,
author = "Franciszek Seredynski and Pascal Bouvry and Albert Y.
Zomaya",
title = "Cellular automata computations and secret key
cryptography",
journal = j-PARALLEL-COMPUTING,
volume = "30",
number = "5--6",
pages = "753--766",
month = may # "\slash " # jun,
year = "2004",
CODEN = "PACOEJ",
ISSN = "0167-8191 (print), 1872-7336 (electronic)",
ISSN-L = "0167-8191",
bibdate = "Sun Nov 7 05:53:53 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01678191",
acknowledgement = ack-nhfb,
fjournal = "Parallel Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/01678191",
}
@InCollection{Shaltiel:2004:RDE,
author = "Ronen Shaltiel",
title = "Recent developments in extractors",
crossref = "Paun:2004:CTT",
pages = "??--??",
year = "2004",
bibdate = "Wed Apr 05 05:41:37 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cs.haifa.ac.il/~ronen/online_papers/online_papers.html;
http://www.cs.haifa.ac.il/~ronen/online_papers/survey.ps",
acknowledgement = ack-nhfb,
keywords = "cryptography",
remark = "A preliminary version appeared in {\em Bulletin of the
European Association for Theoretical Computer Science},
Volume 77, June 2002, pages 67--95.",
}
@Article{Shao:2004:IDS,
author = "Zuhua Shao",
title = "Improvement of digital signature with message recovery
using self-certified public keys and its variants",
journal = j-APPL-MATH-COMP,
volume = "159",
number = "2",
pages = "391--399",
day = "6",
month = dec,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:38 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shparlinski:2004:BRR,
author = "Igor Shparlinski",
title = "Book review: {{\em RSA and public-key cryptography}}",
journal = j-MATH-COMPUT,
volume = "73",
number = "247",
pages = "1582--1582",
month = jul,
year = "2004",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Wed Aug 11 08:23:07 MDT 2004",
bibsource = "http://www.ams.org/mcom/2004-73-247;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/home.html;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.dvi;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.pdf;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.ps;
http://www.ams.org/mcom/2004-73-247/S0025-5718-04-01695-3/S0025-5718-04-01695-3.tex",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Article{Shparlinski:2004:UDD,
author = "Igor E. Shparlinski",
title = "On the uniformity of distribution of the decryption
exponent in fixed encryption exponent {RSA}",
journal = j-INFO-PROC-LETT,
volume = "92",
number = "3",
pages = "143--147",
day = "15",
month = nov,
year = "2004",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Sierra:2004:LCC,
author = "Jos{\'e} M. Sierra and Julio C. Hern{\'a}ndez and
Narayana Jayaram and Arturo Ribagorda",
title = "Low computational cost integrity for block ciphers",
journal = j-FUT-GEN-COMP-SYS,
volume = "20",
number = "5",
pages = "857--863",
day = "15",
month = jun,
year = "2004",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Smolin:2004:EDE,
author = "J. A. Smolin",
title = "The early days of experimental quantum cryptography",
journal = j-IBM-JRD,
volume = "48",
number = "1",
pages = "47--??",
month = "????",
year = "2004",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Tue Jan 27 05:37:12 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/rd/481/smolin.pdf",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
ordernumber = "G322-0238",
}
@Article{Solachidis:2004:WPL,
author = "Vassilios Solachidis and Ioannis Pitas",
title = "Watermarking Polygonal Lines Using {Fourier}
Descriptors",
journal = j-IEEE-CGA,
volume = "24",
number = "3",
pages = "44--51",
month = may # "\slash " # jun,
year = "2004",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/MCG.2004.1297010",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Sat Dec 11 16:47:37 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/cg/2004/03/g3044abs.htm;
http://csdl.computer.org/dl/mags/cg/2004/03/g3044.htm;
http://csdl.computer.org/dl/mags/cg/2004/03/g3044.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@InProceedings{Srinathan:2004:OPS,
author = "K. Srinathan and Arvind Narayanan and C. Pandu
Rangan",
title = "Optimal Perfectly Secure Message Transmission",
crossref = "Franklin:2004:ACC",
pages = "545--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Strembeck:2004:IAE,
author = "Mark Strembeck and Gustaf Neumann",
title = "An integrated approach to engineer and enforce context
constraints in {RBAC} environments",
journal = j-TISSEC,
volume = "7",
number = "3",
pages = "392--427",
month = aug,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Stubblefield:2004:KRA,
author = "Adam Stubblefield and John Ioannidis and Aviel D.
Rubin",
title = "A key recovery attack on the 802.11b wired equivalent
privacy protocol {(WEP)}",
journal = j-TISSEC,
volume = "7",
number = "2",
pages = "319--332",
month = may,
year = "2004",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/996943.996948",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this paper, we present a practical key recovery
attack on WEP, the link-layer security protocol for
802.11b wireless networks. The attack is based on a
partial key exposure vulnerability in the RC4 stream
cipher discovered by Fluhrer, Mantin, and Shamir. This
paper describes how to apply this flaw to breaking WEP,
our implementation of the attack, and optimizations
that can be used to reduce the number of packets
required for the attack. We conclude that the 802.11b
WEP standard is completely insecure, and we provide
recommendations on how this vulnerability could be
mitigated and repaired.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Stytz:2004:BRW,
author = "Martin R. Stytz",
title = "Book Reviews: Wireless World Order [{{\em How Secure
Is Your Wireless Network? Safeguarding Your Wi-Fi LAN}
by Lee Barken}]; No Need to Fear [{{\em Beyond Fear:
Thinking Sensibly About Security in an Uncertain
World}, by Bruce Schneier}]",
journal = j-IEEE-SEC-PRIV,
volume = "2",
number = "1",
pages = "20--21",
month = jan # "\slash " # feb,
year = "2004",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSECP.2004.1264848",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Feb 3 11:48:25 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/sp/2004/01/j1020abs.htm;
http://csdl.computer.org/dl/mags/sp/2004/01/j1020.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Book{Swiderski:2004:TM,
author = "Frank Swiderski and Window Snyder",
title = "Threat modeling",
publisher = pub-MICROSOFT,
address = pub-MICROSOFT:adr,
pages = "xv + 259",
year = "2004",
ISBN = "0-7356-1991-3 (paperback)",
ISBN-13 = "978-0-7356-1991-3 (paperback)",
LCCN = "QA76.9.A25 S934 2004",
bibdate = "Tue Jul 3 15:43:30 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer networks; Security
measures",
}
@Article{Tan:2004:OBC,
author = "Zhangxi Tan and Chuang Lin and Hao Yin and Bo Li",
title = "Optimization and Benchmark of Cryptographic Algorithms
on Network Processors",
journal = j-IEEE-MICRO,
volume = "24",
number = "5",
pages = "55--69",
month = sep # "\slash " # oct,
year = "2004",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2004.54",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Sat Dec 11 17:59:16 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/mi/2004/05/m5055.htm;
http://csdl.computer.org/dl/mags/mi/2004/05/m5055.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Teoh:2004:PCK,
author = "Andrew B. J. Teoh and David C. L. Ngo and Alwyn Goh",
title = "Personalised cryptographic key generation based on
{FaceHashing}",
journal = j-COMPUT-SECUR,
volume = "23",
number = "7",
pages = "606--614",
month = oct,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:57 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001701",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Thorsteinson:2004:NSC,
author = "Peter Thorsteinson and G. Gnana Arun Ganesh",
title = "{.NET} Security and Cryptography",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "xvii + 466",
year = "2004",
ISBN = "0-13-100851-X",
ISBN-13 = "978-0-13-100851-9",
LCCN = "????",
bibdate = "Wed Aug 04 08:04:36 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$49.99",
series = "The integrated {.NET} series from object innovations",
acknowledgement = ack-nhfb,
}
@InCollection{Turing:2004:BS,
author = "Alan M. Turing",
title = "{Bombe} and {Spider}",
crossref = "Copeland:2004:ETS",
pages = "313--335",
year = "2004",
bibdate = "Mon Nov 07 18:26:24 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Text prepared by Ralph Erskine and Philip Marks and
Frode Weierud from the only two surviving copies of
Turing's typescript.",
acknowledgement = ack-nhfb,
remark = "Chapter 6 of \booktitle{Treatise on the Enigma}.",
}
@Article{Tzeng:2004:NTM,
author = "Shiang-Feng Tzeng and Cheng-Ying Yang and Min-Shiang
Hwang",
title = "A nonrepudiable threshold multi-proxy multi-signature
scheme with shared verification",
journal = j-FUT-GEN-COMP-SYS,
volume = "20",
number = "5",
pages = "887--893",
day = "15",
month = jun,
year = "2004",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Uzun:2004:BRC,
author = "Isa Servan Uzun",
title = "Book Review: {{\em Cryptographic Security
Architecture---Design and Verification}, by Peter
Gutmann}",
journal = j-COMP-J,
volume = "47",
number = "5",
pages = "622--623",
month = sep,
year = "2004",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 28 17:48:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_05/",
URL = "http://www3.oup.co.uk/computer_journal/free_pdf/470622a.pdf;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_05/470622a.sgm.abs.html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{vanDijk:2004:AOC,
author = "Marten van Dijk and David Woodruff",
title = "Asymptotically Optimal Communication for Torus-Based
Cryptography",
crossref = "Franklin:2004:ACC",
pages = "157--??",
year = "2004",
bibdate = "Tue Apr 04 07:53:49 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2004; cryptography",
}
@Article{Vaughan-Nichols:2004:VAS,
author = "Steven J. Vaughan-Nichols",
title = "Voice Authentication Speaks to the Marketplace",
journal = j-COMPUTER,
volume = "37",
number = "3",
pages = "13--??",
month = mar,
year = "2004",
CODEN = "CPTRB4",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 4 16:02:09 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2004/03/r3013.htm;
http://csdl.computer.org/dl/mags/co/2004/03/r3013.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{Vladimirov:2004:WFS,
author = "Andrew A. Vladimirov and Konstantin V. Gavrilenko and
Andrei A. Mikhailovsky",
title = "Wi-Foo: The Secrets of Wireless Hacking",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxvii + 555",
year = "2004",
ISBN = "0-321-20217-1",
ISBN-13 = "978-0-321-20217-8",
LCCN = "TK5105.59 .V53 2004",
bibdate = "Thu Oct 6 06:05:08 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90;
z3950.loc.gov:7090/Voyager",
URL = "http://www.awprofessional.com/title/0321202171",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Wireless
communication systems",
}
@Article{Wallich:2004:EEI,
author = "P. Wallich",
title = "Electrical engineering's identity crisis --- when does
a vast and vital profession become unrecognizably
diffuse?",
journal = j-IEEE-SPECTRUM,
volume = "41",
number = "11",
pages = "66--73",
month = nov,
year = "2004",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2004.1353795",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Biology; circuit designing; Electrical engineering;
electrical engineering; electrical engineering identity
crisis; Materials science and technology; Physics;
professional aspects; quantum-based cryptographic
devices; technological development",
}
@Article{Wang:2004:AWA,
author = "Shiuh-Jeng Wang",
title = "Anonymous wireless authentication on a portable
cellular mobile system",
journal = j-IEEE-TRANS-COMPUT,
volume = "53",
number = "10",
pages = "1317--1329",
month = oct,
year = "2004",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2004.70",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Tue Jul 5 08:12:43 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1327581",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Misc{Wang:2004:CHF,
author = "Xiaoyun Wang and Dengguo Feng and Xuejia Lai and
Hongbo Yu",
title = "Collisions for Hash Functions {MD4}, {MD5},
{HAVAL-128} and {RIPEMD}",
howpublished = "Cryptology ePrint Archive, Report 2004/199",
pages = "4",
year = "2004",
bibdate = "Wed Sep 15 14:58:12 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eprint.iacr.org/2004/199.pdf;
http://www.tcs.hut.fi/~mjos/md5/",
acknowledgement = ack-nhfb,
remark = "From the paper: ``\ldots{} MD5(M,N) = MD5(M',N'). On
IBM P690, it takes about one hour to find such M and
M', after that, it takes only 15 seconds to 5 minutes
to find N$_i$ and N'$_i$, so that (M,N$_i$ ) and
(M',N'$_i$ ) will produce the same hash same value.
Moreover, our attack works for any given initial
value.'' Markku-Juhani O. Saarinen comments (in the
second URL): ``This clearly shows that the resistance
of MD5 against collision attacks is significantly lower
than $ 2^{64} $ indicated by its 128-bit digest. Since
the attack allows free selection of IV, these attacks
mean that MD5 should not be used for any serious
cryptographic purpose.''",
}
@Article{Wang:2004:CWS,
author = "Huaiqing Wang and Shuozhong Wang",
title = "Cyber warfare: steganography vs. steganalysis",
journal = j-CACM,
volume = "47",
number = "10",
pages = "76--82",
month = oct,
year = "2004",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Dec 2 06:08:31 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Wang:2004:TVS,
author = "Shiuh-Jeng Wang",
title = "Threshold verification scheme to a valid-signature
using identity only on specialized approval",
journal = j-APPL-MATH-COMP,
volume = "152",
number = "2",
pages = "373--383",
day = "5",
month = may,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:31 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Wedde:2004:MAA,
author = "Horst F. Wedde and Mario Lischka",
title = "Modular authorization and administration",
journal = j-TISSEC,
volume = "7",
number = "3",
pages = "363--391",
month = aug,
year = "2004",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Nov 4 08:41:51 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Book{Weiss:2004:JCE,
author = "Jason Weiss",
title = "{Java} Cryptography Extensions: Practical Guide for
Programmers",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "xv + 158",
year = "2004",
ISBN = "0-12-742751-1",
ISBN-13 = "978-0-12-742751-5",
LCCN = "QA76.73.J38 W445 2004",
bibdate = "Tue Jul 27 05:22:17 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$21.95",
acknowledgement = ack-nhfb,
}
@Book{Wollinger:2004:SHI,
author = "Thomas Wollinger",
title = "Software and hardware implementation of hyperelliptic
curve cryptosystems",
volume = "3",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Bochum, Germany",
pages = "177",
year = "2004",
ISBN = "3-86515-025-X",
ISBN-13 = "978-3-86515-025-7",
LCCN = "????",
bibdate = "Fri May 13 08:53:09 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
price = "EUR 24.90",
series = "IT-Security",
URL = "http://verlag.rub.de/g9783865150257.html",
abstract = "The hyperelliptic curve cryptosystems (HECC) is one of
the emerging cryptographic primitives of the last
years. HECC offers the same security as established
public-key cryptosystems with much shorter operand
length. However, until recently the common belief was
that HEC are out of scope for any practical
application, because of the complex group
operation.\par
The thesis at hand is a step towards the practical use
of HECC by narrowing the performance gap between
elliptic curve (ECC) and HECC. We were able to reduce
the complexity of the group operation for small genus
hyperelliptic curves. Our theoretical comparison
between ECC and HECC, as well as our software and
hardware implementations show that the performance of
both cryptographic primitives is in the same range. The
implementations we investigated range from a general
purpose processor to a variety of different embedded
processors, and also include the prototype
implementation of a HEC coprocessor on FPGAs.",
acknowledgement = ack-nhfb,
}
@Article{Wong:2004:RCK,
author = "W. K. Wong and L. P. Lee and K. W. Wong",
title = "Reply to the comment {``Keystream cryptanalysis of a
chaotic cryptographic method''}",
journal = j-COMP-PHYS-COMM,
volume = "156",
number = "2",
pages = "208--208",
day = "1",
month = jan,
year = "2004",
CODEN = "CPHCBZ",
DOI = "https://doi.org/10.1016/S0010-4655(03)00433-8",
ISSN = "0010-4655 (print), 1879-2944 (electronic)",
ISSN-L = "0010-4655",
bibdate = "Mon Feb 13 23:41:34 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Wong:2001:MCC,Alvarez:2004:KCC}.",
URL = "http://www.sciencedirect.com/science/article/pii/S0010465503004338",
acknowledgement = ack-nhfb,
fjournal = "Computer Physics Communications",
journal-URL = "http://www.sciencedirect.com/science/journal/00104655",
}
@Article{Wu:2004:EIW,
author = "Hsien-Chu Wu and Chin-Chen Chang",
title = "Embedding Invisible Watermarks into Digital Images
Based on Side-Match Vector Quantization",
journal = j-FUND-INFO,
volume = "63",
number = "1",
pages = "89--106",
month = jan,
year = "2004",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:02:27 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Wu:2004:RKA,
author = "Tzong-Sun Wu and Han-Yu Lin",
title = "Robust key authentication scheme resistant to public
key substitution attacks",
journal = j-APPL-MATH-COMP,
volume = "157",
number = "3",
pages = "825--833",
day = "15",
month = oct,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Xie:2004:CTA,
author = "Qi Xie and Xiu Yuan Yu",
title = "Cryptanalysis of {Tseng} et al.'s authenticated
encryption schemes",
journal = j-APPL-MATH-COMP,
volume = "158",
number = "1",
pages = "1--5",
day = "25",
month = oct,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yang:2004:CUF,
author = "Chou-Chen Yang and Ren-Chiun Wang",
title = "Cryptanalysis of a user friendly remote authentication
scheme with smart cards",
journal = j-COMPUT-SECUR,
volume = "23",
number = "5",
pages = "425--427",
month = jul,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:56 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001002",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Yang:2004:ENT,
author = "Cheng-Ying Yang and Shiang-Feng Tzeng and Min-Shiang
Hwang",
title = "On the efficiency of nonrepudiable threshold proxy
signature scheme with known signers",
journal = j-J-SYST-SOFTW,
volume = "73",
number = "3",
pages = "507--514",
month = nov # "\slash " # dec,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:26 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Yang:2004:ISE,
author = "Chou-Chen Yang and Ren-Ching Wang",
title = "An improvement of security enhancement for the
timestamp-based password authentication scheme using
{Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "38",
number = "3",
pages = "91--96",
month = jul,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Yang:2004:MSS,
author = "Chou-Chen Yang and Ting-Yi Chang and Min-Shiang
Hwang",
title = "A $ (t, n) $ multi-secret sharing scheme",
journal = j-APPL-MATH-COMP,
volume = "151",
number = "2",
pages = "483--490",
day = "5",
month = apr,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:30 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yeh:2004:PBU,
author = "Her-Tyan Yeh and Hung-Min Sun",
title = "Password-based user authentication and key
distribution protocols for client--server
applications",
journal = j-J-SYST-SOFTW,
volume = "72",
number = "1",
pages = "97--103",
month = jun,
year = "2004",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:24 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Yi:2004:AKA,
author = "Xun Yi",
title = "Authenticated key agreement in dynamic peer groups",
journal = j-THEOR-COMP-SCI,
volume = "326",
number = "1--3",
pages = "363--382",
day = "20",
month = oct,
year = "2004",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Nov 4 10:19:19 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Yoon:2004:SUA,
author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo",
title = "A secure user authentication scheme using hash
functions",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "62--68",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Young:2004:HRV,
author = "Dale Young",
title = "Human Resources have a vital role to play within
employee identity and access management",
journal = j-NETWORK-SECURITY,
volume = "2004",
number = "11",
pages = "5--7",
month = nov,
year = "2004",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(04)00154-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:06 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485804001540",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Young:2004:MCE,
author = "Adam Young and Moti Yung",
title = "Malicious cryptography: exposing cryptovirology",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxiv + 392",
year = "2004",
ISBN = "0-7645-4975-8 (paperback)",
ISBN-13 = "978-0-7645-4975-5 (paperback)",
LCCN = "QA76.9.A25 Y65 2004",
bibdate = "Sat Jun 13 08:19:29 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/wiley047/2003023863.html;
http://www.loc.gov/catdir/description/wiley041/2003023863.html;
http://www.loc.gov/catdir/toc/wiley041/2003023863.html",
acknowledgement = ack-nhfb,
subject = "computer security; cryptography; computer viruses;
prevention; data protection",
}
@Article{Yuan-bo:2004:ITA,
author = "Guo Yuan-bo and Ma Jian-feng",
title = "An intrusion-tolerant authorization and authentication
scheme in distributed environments",
journal = j-OPER-SYS-REV,
volume = "38",
number = "4",
pages = "45--51",
month = oct,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Zhang:2004:AFV,
author = "Yuqing Zhang and Xiuying Liu",
title = "An approach to the formal verification of the
three-principal cryptographic protocols",
journal = j-OPER-SYS-REV,
volume = "38",
number = "1",
pages = "35--42",
month = jan,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Zhang:2004:AIB,
author = "Fangguo Zhang and Xiaofeng Chen",
title = "Attack on an {ID}-based authenticated group key
agreement scheme from {PKC 2004}",
journal = j-INFO-PROC-LETT,
volume = "91",
number = "4",
pages = "191--193",
month = aug,
year = "2004",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:54 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Zhang:2004:NMS,
author = "Zhang Zhang and Guozhen Xiao",
title = "New multisignature scheme for specified group of
verifiers",
journal = j-APPL-MATH-COMP,
volume = "157",
number = "2",
pages = "425--431",
day = "5",
month = oct,
year = "2004",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Zhang:2004:RMA,
author = "Yuqing Zhang and Xiuying Liu",
title = "Running-mode analysis of the {Security Socket Layer}
protocol",
journal = j-OPER-SYS-REV,
volume = "38",
number = "2",
pages = "34--40",
month = apr,
year = "2004",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Zhang:2004:SAE,
author = "Chang N. Zhang and Chunren Lai",
title = "A systematic approach for encryption and
authentication with fault tolerance",
journal = j-COMP-NET-AMSTERDAM,
volume = "45",
number = "2",
pages = "143--154",
day = "5",
month = jun,
year = "2004",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 14 17:03:01 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Zhen:2004:IBS,
author = "Z. Zhen and B. Fei and L. Kejun",
title = "The implementation of 128 bit strong encryption for
{SSL} by using {Java} Applet",
journal = "Journal --- Huazhong University of Science and
Technology Nature Science Chinese Edition",
volume = "32",
number = "4",
pages = "74--76",
year = "2004",
CODEN = "????",
ISSN = "1671-4512",
bibdate = "Fri Jun 18 08:03:35 MDT 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
}
@Article{Zhu:2004:DSM,
author = "Lie Huang Zhu and Yuan Da Cao and Dong Wang",
title = "Digital signature of multicast streams secure against
adaptive chosen message attack",
journal = j-COMPUT-SECUR,
volume = "23",
number = "3",
pages = "229--240",
month = may,
year = "2004",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:55 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804000707",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Abadi:2005:CFI,
author = "Mart{\'\i}n Abadi and Mihai Budiu and {\'U}lfar
Erlingsson and Jay Ligatti",
title = "Control-flow integrity",
crossref = "Meadows:2005:CPA",
pages = "340--353",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Abadi:2005:SAC,
author = "Mart{\'\i}n Abadi and Bogdan Warinschi",
title = "Security analysis of cryptographically controlled
access to {XML} documents",
crossref = "ACM:2005:PTF",
pages = "108--117",
year = "2005",
bibdate = "Wed Aug 23 12:08:49 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Abdalla:2005:SER,
author = "Michel Abdalla and Mihir Bellare and Dario Catalano
and Eike Kiltz and Tadayoshi Kohno and Tanja Lange and
John Malone-Lee and Gregory Neven and Pascal Paillier
and Haixia Shi",
title = "Searchable Encryption Revisited: Consistency
Properties, Relation to Anonymous {IBE}, and
Extensions",
crossref = "Shoup:2005:ACC",
pages = "205--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_13",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Aciicmez:2005:IBB,
author = "Onur Acii{\c{c}}mez and Werner Schindler and
{\c{C}}etin K. Ko{\c{c}}",
title = "Improving {Brumley} and {Boneh} timing attack on
unprotected {SSL} implementations",
crossref = "Meadows:2005:CPA",
pages = "139--146",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Al-Azzoni:2005:MVC,
author = "Issam Al-Azzoni and Douglas G. Down and Ridha Khedri",
title = "Modeling and Verification of Cryptographic Protocols
Using Coloured {Petri} Nets and Design\slash {CPN}",
journal = j-NORDIC-J-COMPUT,
volume = "12",
number = "3",
pages = "200--228",
month = "Fall",
year = "2005",
CODEN = "NJCOFR",
ISSN = "1236-6064",
bibdate = "Sat Sep 11 08:22:12 MDT 2010",
bibsource = "http://www.cs.helsinki.fi/njc/njc12.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Nordic Journal of Computing",
}
@Article{Alvarez:2005:EBS,
author = "Rafael {\'A}lvarez and Joan-Josep Climent and Leandro
Tortosa and Antonio Zamora",
title = "An efficient binary sequence generator with
cryptographic applications",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "16--27",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2004.06.065",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300304004709",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Alvarez:2005:SSS,
author = "G. Alvarez and A. Hern{\'a}ndez Encinas and L.
Hern{\'a}ndez Encinas and A. Mart{\'\i}n del Rey",
title = "A secure scheme to share secret color images",
journal = j-COMP-PHYS-COMM,
volume = "173",
number = "1--2",
pages = "9--16",
day = "1",
month = dec,
year = "2005",
CODEN = "CPHCBZ",
DOI = "https://doi.org/10.1016/j.cpc.2005.07.002",
ISSN = "0010-4655 (print), 1879-2944 (electronic)",
ISSN-L = "0010-4655",
bibdate = "Mon Feb 13 23:42:03 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0010465505004224",
acknowledgement = ack-nhfb,
fjournal = "Computer Physics Communications",
journal-URL = "http://www.sciencedirect.com/science/journal/00104655",
}
@InProceedings{Alwen:2005:IFR,
author = "Jo{\"e} Alwen and Giuseppe Persiano and Ivan
Visconti",
title = "Impossibility and Feasibility Results for Zero
Knowledge with Public Keys",
crossref = "Shoup:2005:ACC",
pages = "135--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_9",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Misc{Anonymous:2005:CEC,
author = "Anonymous",
title = "The Case for Elliptic Curve Cryptography",
howpublished = "US National Security Agency World-Wide Web document",
month = oct,
year = "2005",
bibdate = "Sat Oct 15 18:59:19 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.nsa.gov/ia/industry/crypto_elliptic_curve.cfm",
acknowledgement = ack-nhfb,
remark = "From the document: ``Despite the many advantages of
elliptic curves and despite the adoption of elliptic
curves by many users, many vendors and academics view
the intellectual property environment surrounding
elliptic curves as a major roadblock to their
implementation and use. Various aspects of elliptic
curve cryptography have been patented by a variety of
people and companies around the world. Notably the
Canadian company, Certicom Inc. holds over 130 patents
related to elliptic curves and public key cryptography
in general.\par
As a way of clearing the way for the implementation of
elliptic curves to protect US and allied government
information, the National Security Agency purchased
from Certicom a license that covers all of their
intellectual property in a restricted field of use. The
license would be limited to implementations that were
for national security uses and certified under FIPS
140-2 or were approved by NSA. Further, the license
would be limited to only prime field curves where the
prime was greater than 2255. On the NIST list of curves
3 out of the 15 fit this field of use: the prime field
curves with primes of 256 bits, 384 bits and 521 bits.
Certicom identified 26 patents that covered this field
of use. NSA's license includes a right to sublicense
these 26 patents to vendors building products within
the restricted field of use. Certicom also retained a
right to license vendors both within the field of use
and under other terms that they may negotiate with
vendors.''",
remark2 = "When a spy agency recommends an encryption method,
does it mean that they know how to crack it, and
haven't told anyone?",
}
@Article{Anonymous:2005:SCB,
author = "Anonymous",
title = "Smart card based authentication --- any future?",
journal = j-COMPUT-SECUR,
volume = "24",
number = "3",
pages = "188--191",
month = may,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:59 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740480500043X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Anonymous:2005:WAS,
author = "Anonymous",
title = "Workshop on architectural support for security and
anti-virus {(WASSA)}",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "??--??",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Manual{ANSI:2005:AXP,
author = "{ANSI}",
title = "{ANSI X9.62:2005}: Public Key Cryptography for the
Financial Services Industry, The {Elliptic Curve
Digital Signature Algorithm (ECDSA)}",
organization = pub-ANSI,
address = pub-ANSI:adr,
year = "2005",
bibdate = "Thu Mar 22 11:17:32 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/encryption/dss/ecdsa/NISTReCur.pdf;
http://webstore.ansi.org/ansidocstore/product.asp?sku=ANSI+X9%2E62%3A2005",
abstract = "This Standard defines methods for digital signature
(signature) generation and verification for the
protection of messages and data using the Elliptic
Curve Digital Signature Algorithm (ECDSA). ECDSA is the
elliptic curve analogue of the Digital Signature
Algorithm (ANS X9.30). The ECDSA shall be used in
conjunction with an approved hash function, as
specified in X9 Registry Item 00003, Secure Hash
Standard (SHS). The hash functions approved at the time
of publication of this document are SHA-1 (see note),
SHA-224, SHA-256, SHA-384 and SHA-512. This ECDSA
Standard provides methods and criteria for the
generation of public and private keys that are required
by the ECDSA and the procedural controls required for
the secure use of the algorithm with these keys. This
ECDSA Standard also provides methods and criteria for
the generation of elliptic curve domain parameters that
are required by the ECDSA and the procedural controls
required for the secure use of the algorithm with these
domain parameters.",
acknowledgement = ack-nhfb,
}
@InProceedings{Appenzeller:2005:IBE,
author = "Guido Appenzeller",
title = "Identity-based encryption from algorithm to enterprise
deployment",
crossref = "Meadows:2005:CPA",
pages = "406--406",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Arazi:2005:RPK,
author = "Benjamin Arazi and Itamar Elhanany and Ortal Arazi and
Hairong Qi",
title = "Revisiting Public-Key Cryptography for Wireless Sensor
Networks",
journal = j-COMPUTER,
volume = "38",
number = "11",
pages = "103--105",
month = nov,
year = "2005",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2005.388",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:16:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{Arkin:2005:CND,
author = "William M. Arkin",
title = "Code names: deciphering {US} military plans, programs,
and operations in the 9/11 world",
publisher = "Steerforth Press",
address = "Hanover, NH, USA",
pages = "608",
year = "2005",
ISBN = "1-58642-083-6",
ISBN-13 = "978-1-58642-083-3",
LCCN = "UA23 .A689 2005",
bibdate = "Thu Jan 19 12:24:43 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip052/2004025039.html",
acknowledgement = ack-nhfb,
subject = "United States; armed forces; organization; military
planning; defenses; civil defense; war on terrorism,
2001--",
}
@InProceedings{Atallah:2005:DEK,
author = "Mikhail J. Atallah and Keith B. Frikken and Marina
Blanton",
title = "Dynamic and efficient key management for access
hierarchies",
crossref = "Meadows:2005:CPA",
pages = "190--202",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ateniese:2005:PRS,
author = "Giuseppe Ateniese and Susan Hohenberger",
title = "Proxy re-signatures: new definitions, algorithms, and
applications",
crossref = "Meadows:2005:CPA",
pages = "310--319",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ateniese:2005:URT,
author = "Giuseppe Ateniese and Jan Camenisch and Breno de
Medeiros",
title = "Untraceable {RFID} tags via insubvertible encryption",
crossref = "Meadows:2005:CPA",
pages = "92--101",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Backes:2005:PKS,
author = "Michael Backes and Christian Cachin",
title = "Public-Key Steganography with Active Attacks",
crossref = "Kilian:2005:TCS",
pages = "210--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Bajard:2005:AOP,
author = "Jean-Claude Bajard and Laurent Imbert and Thomas
Plantard",
title = "Arithmetic Operations in the Polynomial Modular Number
System",
crossref = "IEEE:2005:PIS",
pages = "??--??",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://arith17.polito.it/final/paper-168.pdf",
abstract = "We propose a new number representation and arithmetic
for the elements of the ring of integers modulo p. The
so-called Polynomial Modular Number System (PMNS)
allows for fast polynomial arithmetic and easy
parallelization. The most important contribution of
this paper is the fundamental theorem of a Modular
Number System, which provides a bound for the
coefficients of the polynomials used to represent the
set $ \mathbb {Z}_p $. However, we also propose a
complete set of algorithms to perform the arithmetic
operations over a PMNS, which make this system of
practical interest for people concerned about efficient
implementation of modular arithmetic.",
acknowledgement = ack-nhfb,
keywords = "Lattice theory; Modular arithmetic; Number system;
Table-based methods",
pagecount = "8",
}
@InProceedings{Banks:2005:TFC,
author = "William D. Banks",
title = "Towards faster cryptosystems, {II}",
crossref = "Garrett:2005:PKC",
pages = "139--152",
year = "2005",
MRclass = "94A60 (94-02)",
MRnumber = "2211875 (2007c:94179)",
MRreviewer = "Boris {\`E}. Kunyavski{\u\i}",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Bao:2005:PSS,
author = "Haiyong Bao and Zhenfu Cao and Rongxing Lu",
title = "Proxy signature scheme using self-certified public
keys",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "2",
pages = "1380--1389",
day = "15",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Bao:2005:RWH,
author = "Haiyong Bao and Zhenfu Cao and Shengbao Wang",
title = "Remarks on {Wu--Hsu}'s threshold signature scheme
using self-certified public keys",
journal = j-J-SYST-SOFTW,
volume = "78",
number = "1",
pages = "56--59",
month = oct,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Barak:2005:MAP,
author = "B. Barak and S. Halevi",
title = "A Model and Architecture for Pseudo-Ransom Generation
with Applications to {{\tt /dev/random}}",
crossref = "Meadows:2005:CPA",
pages = "203--212",
year = "2005",
bibdate = "Mon Apr 03 07:57:43 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Barak:2005:SCA,
author = "Boaz Barak and Ran Canetti and Yehuda Lindell and
Rafael Pass and Tal Rabin",
title = "Secure Computation Without Authentication",
crossref = "Shoup:2005:ACC",
pages = "361--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_22",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Barkol:2005:SCC,
author = "Omer Barkol and Yuval Ishai",
title = "Secure Computation of Constant-Depth Circuits with
Applications to Database Search Problems",
crossref = "Shoup:2005:ACC",
pages = "395--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_24",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Book{Barrett:2005:SSS,
author = "Daniel J. Barrett and Richard E. Silverman and Robert
G. Byrnes",
title = "{SSH}: The {Secure Shell}: The Definitive Guide",
publisher = pub-ORA,
address = pub-ORA:adr,
edition = "Second",
pages = "672 (est.)",
year = "2005",
ISBN = "0-596-00895-3",
ISBN-13 = "978-0-596-00895-6",
LCCN = "QA76.76.O63 B369 2001",
bibdate = "Thu Apr 21 09:15:39 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$39.95",
URL = "http://www.oreilly.com/catalog/9780596008956;
http://www.oreilly.com/catalog/sshtdg2/",
acknowledgement = ack-nhfb,
subject = "UNIX Shells; Data encryption (Computer science);
Computer networks; Security measures",
}
@Article{Barron:2005:DWP,
author = "David W. Barron",
title = "{David Wheeler}: a Personal Memoir",
journal = j-COMP-J,
volume = "48",
number = "6",
pages = "650--651",
month = nov,
year = "2005",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh131",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 8 05:58:50 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol48/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/full/48/6/650;
http://comjnl.oxfordjournals.org/cgi/reprint/48/6/650",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Burrows--Wheeler transform (BWT); bzip; bzip2;
Cambridge CAP computer; Tiny Encryption Algorithm
(TEA)",
remark = "From the article: ``Anderson described the history of
the Tiny Encryption Algorithm, developed by Wheeler and
the late Roger Needham (a former Wheeler research
student, later head of the Laboratory and the first
managing director of Microsoft Research Ltd). The
algorithm was designed in part to `inject some sanity'
into the imposition of export controls on encryption
software by the US Government in the late 1980s.
Wheeler's solution was to devise an encryption
algorithm so short, simple and general that it could be
memorized and encoded in any language. It proved
impossible to put an embargo on what ended up as just
eight lines of code---another masterpiece in
miniature.'' See \cite{Wheeler:1995:TTE} for the
algorithm.\par
``In an email collaboration, Wheeler and Burrows
devised a data compression technique based on BWT,
which was published as a research report in 1994. The
idea was picked up by Dr Dobb's Journal and soon
diffused into the commons of computing. Not long after,
Burrows received a call from Donald Knuth---asking if
he was working with {\em the\/} David Wheeler! Today
the technique is the basis of the widely used open
source bzip and bzip2 file formats.''",
}
@InProceedings{Baudet:2005:DSP,
author = "Mathieu Baudet",
title = "Deciding security of protocols against off-line
guessing attacks",
crossref = "Meadows:2005:CPA",
pages = "16--25",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Beebe:2005:CBPd,
author = "Nelson H. F. Beebe",
title = "A Complete Bibliography of Publications in {{\em
Designs, Codes, and Cryptography}}",
institution = inst-UTAH-MATH,
address = inst-UTAH-MATH:adr,
pages = "107",
day = "6",
month = jul,
year = "2005",
bibdate = "Wed Jul 06 19:00:56 2005",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.math.utah.edu/pub/tex/bib/index-table-d.html#designscodescryptogr",
acknowledgement = ack-nhfb,
}
@InProceedings{Beimel:2005:CIW,
author = "Amos Beimel and Tamir Tassa and Enav Weinreb",
title = "Characterizing Ideal Weighted Threshold Secret
Sharing",
crossref = "Kilian:2005:TCS",
pages = "600--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Beimel:2005:PNS,
author = "Amos Beimel and Yuval Ishai",
title = "On the Power of Nonlinear Secret-Sharing",
journal = j-SIAM-J-DISCR-MATH,
volume = "19",
number = "1",
pages = "258--280",
year = "2005",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480102412868",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Thu Dec 29 09:15:53 MST 2005",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/19/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/41286",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@InProceedings{Bellare:2005:ISA,
author = "Mihir Bellare and Krzysztof Pietrzak and Phillip
Rogaway",
title = "Improved Security Analyses for {CBC} {MACs}",
crossref = "Shoup:2005:ACC",
pages = "527--454",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_32",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Ben-Or:2005:UCS,
author = "Michael Ben-Or and Micha{\l} Horodecki and Debbie W.
Leung and Dominic Mayers and Jonathan Oppenheim",
title = "The Universal Composable Security of Quantum Key
Distribution",
crossref = "Kilian:2005:TCS",
pages = "386--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Bergadano:2005:DPL,
author = "Francesco Bergadano and Davide Cavagnino",
title = "Dealing with packet loss in the Interactive Chained
Stream Authentication protocol",
journal = j-COMPUT-SECUR,
volume = "24",
number = "2",
pages = "139--146",
month = mar,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001877",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Bhargavan:2005:SWS,
author = "Karthikeyan Bhargavan and C{\'e}dric Fournet and
Andrew D. Gordon",
title = "A semantics for web services authentication",
journal = j-THEOR-COMP-SCI,
volume = "340",
number = "1",
pages = "102--153",
day = "13",
month = jun,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jul 7 14:28:20 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Bicakci:2005:ISA,
author = "Kemal Bicakci and Nazife Baykal",
title = "Improved server assisted signatures",
journal = j-COMP-NET-AMSTERDAM,
volume = "47",
number = "3",
pages = "351--366",
day = "21",
month = feb,
year = "2005",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 14 17:03:06 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InProceedings{Bjorn:2005:BHM,
author = "Vance Bjorn",
title = "Biometrics hit the mainstream: an analysis of security
and privacy implications",
crossref = "Meadows:2005:CPA",
pages = "407--407",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Blackburn:2005:PNP,
author = "Simon R. Blackburn and Domingo Gomez-Perez and Jaime
Gutierrez and Igor E. Shparlinski",
title = "Predicting nonlinear pseudorandom number generators",
journal = j-MATH-COMPUT,
volume = "74",
number = "251",
pages = "1471--1494",
month = jul,
year = "2005",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Tue Aug 2 10:37:19 MDT 2005",
bibsource = "http://www.ams.org/mcom/2005-74-251;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/mathcomp2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/home.html;
http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.dvi;
http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.pdf;
http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.ps;
http://www.ams.org/mcom/2005-74-251/S0025-5718-04-01698-9/S0025-5718-04-01698-9.tex;
http://www.jstor.org/stable/pdfplus/4100190.pdf",
abstract = "Let $p$ be a prime and let $a$ and $b$ be elements of
the finite field $ \mathbb {F}_p $ of $p$ elements. The
inversive congruential generator (ICG) is a sequence $
(u_n) $ of pseudorandom numbers defined by the relation
$ u_{n + 1} \equiv a u_n^{-1} + b \bmod p $. We show
that if sufficiently many of the most significant bits
of several consecutive values $ u_n $ of the ICG are
given, one can recover the initial value $ u_0 $ (even
in the case where the coefficients $a$ and $b$ are not
known). We also obtain similar results for the
quadratic congruential generator (QCG), $ v_{n + 1}
\equiv f(v + n) \bmod p $, where $ f \in \mathbb
{F}_p[X] $. This suggests that for cryptographic
applications ICG and QCG should be used with great
care. Our results are somewhat similar to those known
for the linear congruential generator (LCG), $ x_{n +
1} \equiv a x_n + b \bmod p $, but they apply only to
much longer bit strings. We also estimate limits of
some heuristic approaches, which still remain much
weaker than those known for LCG.",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@Book{Blake:2005:AEC,
author = "Ian F. Blake and Gadiel Seroussi and Nigel P. Smart",
title = "Advances in elliptic curve cryptography",
volume = "317",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
edition = "Second",
pages = "xvi + 281",
month = apr,
year = "2005",
ISBN = "0-521-60415-X",
ISBN-13 = "978-0-521-60415-4",
LCCN = "QA76.9.A25 A375 2004",
bibdate = "Thu Feb 27 06:18:42 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "London Mathematical Society Lecture Note Series",
URL = "http://www.cambridge.org/us/academic/subjects/mathematics/number-theory/advances-elliptic-curve-cryptography",
acknowledgement = ack-nhfb,
subject = "Computer security; Public key cryptography",
tableofcontents = "Part I. Protocols \\
1. Elliptic curve base protocols / N. P. Smart \\
2. On the provable security of ECDSA / D. Brown \\
3. Proofs of security for ECIES / A. W. Dent \\
Part II. Implementation Techniques \\
4. Side channel analysis / E. Oswald \\
5. Defenses against side-channel analysis / M. Joye \\
Part III. Mathematical Foundations \\
6. Advances in point counting / F. Vercauteren \\
7. Hyperelliptic curves and the HCDLP / P. Guadry \\
8. Weil descent attacks / F. Hess \\
Part IV. Pairing Based Techniques \\
9. Pairings / S. Galbraith \\
10. Cryptography from pairings / K. G. Paterson",
}
@Article{Blanchet:2005:VCP,
author = "Bruno Blanchet and Andreas Podelski",
title = "Verification of cryptographic protocols: tagging
enforces termination",
journal = j-THEOR-COMP-SCI,
volume = "333",
number = "1--2",
pages = "67--90",
day = "1",
month = mar,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jul 7 14:28:16 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Bodei:2005:APS,
author = "C. Bodei and P. Degano and R. Focardi and C. Priami",
title = "Authentication primitives for secure protocol
specifications",
journal = j-FUT-GEN-COMP-SYS,
volume = "21",
number = "5",
pages = "645--653",
month = may,
year = "2005",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@InProceedings{Boldyreva:2005:ARO,
author = "Alexandra Boldyreva and Marc Fischlin",
title = "Analysis of Random Oracle Instantiation Scenarios for
{OAEP} and Other Practical Schemes",
crossref = "Shoup:2005:ACC",
pages = "412--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_25",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Boneh:2005:CRB,
author = "Dan Boneh and Craig Gentry and Brent Waters",
title = "Collusion Resistant Broadcast Encryption with Short
Ciphertexts and Private Keys",
crossref = "Shoup:2005:ACC",
pages = "258--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_16",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Boneh:2005:EDF,
author = "Dan Boneh and Eu-Jin Goh and Kobbi Nissim",
title = "Evaluating {$2$-DNF} Formulas on Ciphertexts",
crossref = "Kilian:2005:TCS",
pages = "325--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Book{Boone:2005:BHC,
author = "J. V. Boone",
title = "A brief history of cryptology",
publisher = "Naval Institute Press",
address = "Annapolis, MD, USA",
pages = "xi + 192",
year = "2005",
ISBN = "1-59114-084-6",
ISBN-13 = "978-1-59114-084-9",
LCCN = "TK5102.85 .B66 2005",
bibdate = "Mon Jun 16 16:48:49 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip055/2005000009.html",
acknowledgement = ack-nhfb,
subject = "Telecommunication; Security measures; Computer
security; Cryptography",
tableofcontents = "Overview \\
1200--1800: The introduction of mechanical aids \\
1800--1895: The introduction of the telegraph, the
telephone, and mechanical computing aids \\
1895--1939: The introduction of radio stimulates new
applications \\
Mid-1930s--1950: World War II accelerates developments
in all fields \\
1950--1969: The introduction of solid-state electronics
and satellite technologies \\
1970--2003: Extended networking concepts bring closer
integration to all three technologies \\
Summary \\
Appendix A: Introduction to cryptology \\
Appendix B: The origins of NSA",
}
@InProceedings{Borders:2005:CHP,
author = "Kevin Borders and Xin Zhao and Atul Prakash",
title = "{CPOL}: high-performance policy evaluation",
crossref = "Meadows:2005:CPA",
pages = "147--157",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Boyen:2005:DCC,
author = "Xavier Boyen and Qixiang Mei and Brent Waters",
title = "Direct chosen ciphertext security from identity-based
techniques",
crossref = "Meadows:2005:CPA",
pages = "320--329",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Breunesse:2005:FMS,
author = "C.-B. Breunesse and N. Cata{\~n}o and M. Huisman and
B. Jacobs",
title = "Formal methods for smart cards: an experience report",
journal = j-SCI-COMPUT-PROGRAM,
volume = "55",
number = "1--3",
pages = "53--80",
month = mar,
year = "2005",
CODEN = "SCPGD4",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Fri Apr 1 18:38:45 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01676423",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423",
}
@Book{Brown:2005:CEC,
author = "Christopher L. T. Brown",
title = "Computer evidence: collection and preservation",
publisher = "Charles River Media",
address = "Hingham, MA, USA",
pages = "????",
year = "2005",
ISBN = "1-58450-405-6 (pbk. with cd-rom)",
ISBN-13 = "978-1-58450-405-4 (pbk. with cd-rom)",
LCCN = "HV8079.C65 B76 2005",
bibdate = "Fri Dec 9 06:49:23 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0514/2005016674.html",
acknowledgement = ack-nhfb,
subject = "Computer crimes; Investigation",
}
@Book{Browne:2005:DEP,
author = "Graham T. Browne",
title = "Data encryption: a practical guide to protecting
sensitive information",
publisher = "Aaben Kryptografi",
address = "Cranage, UK",
pages = "????",
year = "2005",
ISBN = "0-9549513-0-1",
ISBN-13 = "978-0-9549513-0-6",
LCCN = "????",
bibdate = "Wed Sep 28 08:11:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "One CD-ROM.",
acknowledgement = ack-nhfb,
}
@Book{Brzezinski:2005:MRL,
author = "Zbigniew Brzezi{\'n}ski and Jan Stanis{\l}aw
Ciechanowski and Antoni Bohdanowicz and Witold
Zbirohowski-Ko{\'s}cia and others",
title = "{Marjan Rejewski} 1905--1980: living with the {Enigma}
secret",
publisher = "Wydawnictwo Tekst Sp. z o.o.",
address = "Bydgoszcz, Poland",
pages = "288",
year = "2005",
ISBN = "83-7208-117-4",
ISBN-13 = "978-83-7208-117-9",
LCCN = "????",
bibdate = "Sat Jun 6 12:17:40 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Introduction by Professor Zbigniew Brzezi{\'n}ski.",
acknowledgement = ack-nhfb,
subject = "Rejewski, Marian; Enigma (maszyna szyfruj{\k{a}}ca).",
subject-dates = "(1905--1980)",
}
@Article{Bugliesi:2005:NIP,
author = "Michele Bugliesi and Sabina Rossi",
title = "Non-interference proof techniques for the analysis of
cryptographic protocols",
journal = j-J-COMP-SECUR,
volume = "13",
number = "1",
pages = "87--113",
month = "????",
year = "2005",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2005-13104",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:39 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Burnside:2005:CCP,
author = "Matthew Burnside and Angelos D. Keromytis",
title = "The case for crypto protocol awareness inside the {OS}
kernel",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "58--64",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Camenisch:2005:FTO,
author = "Jan Camenisch and Anna Lysyanskaya",
title = "A Formal Treatment of Onion Routing",
crossref = "Shoup:2005:ACC",
pages = "169--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_11",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Canetti:2005:ASN,
author = "Ran Canetti and Shai Halevi and Jonathan Katz",
title = "Adaptively-Secure, Non-interactive Public-Key
Encryption",
crossref = "Kilian:2005:TCS",
pages = "150--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Canetti:2005:HAW,
author = "Ran Canetti and Shai Halevi and Michael Steiner",
title = "Hardness Amplification of Weakly Verifiable Puzzles",
crossref = "Kilian:2005:TCS",
pages = "17--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Castro:2005:NRG,
author = "Julio C{\'e}sar Hern{\'a}ndez Castro and Pedro Isasi
Vi{\~n}uela",
title = "New results on the genetic cryptanalysis of {TEA} and
reduced-round versions of {XTEA}",
journal = j-NEW-GEN-COMP,
volume = "23",
number = "3",
pages = "233--243",
year = "2005",
CODEN = "NGCOE5",
DOI = "https://doi.org/10.1007/BF03037657",
ISSN = "0288-3635 (print), 1882-7055 (electronic)",
ISSN-L = "0288-3635",
bibdate = "Wed Feb 01 16:35:39 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.springerlink.com/content/e018uh040400kh87/",
abstract = "Recently, a quick and simple way of creating very
efficient distinguishers for cryptographic primitives
such as block ciphers or hash functions, was presented
and proved useful by the authors. In this paper, this
cryptanalytic attack (named genetic cryptanalysis after
its use of genetic algorithms) is shown to be
successful when applied over reduced-round versions of
the block cipher XTEA. Efficient distinguishers for
XTEA are proposed for up to 4 cycles (8 rounds).
Additionally, a variant of this genetic attack is also
introduced, and their results over the block cipher TEA
presented, which are the most powerful published to
date.",
acknowledgement = ack-nhfb,
fjournal = "New Generation Computing",
keywords = "block ciphers; cryptanalysis; distinguishers; TEA;
XTEA",
}
@Article{Ceselli:2005:MAI,
author = "Alberto Ceselli and Ernesto Damiani and Sabrina {De
Capitani Di Vimercati} and Sushil Jajodia and Stefano
Paraboschi and Pierangela Samarati",
title = "Modeling and assessing inference exposure in encrypted
databases",
journal = j-TISSEC,
volume = "8",
number = "1",
pages = "119--152",
month = feb,
year = "2005",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Mar 24 15:53:55 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Challal:2005:HHC,
author = "Yacine Challal and Abdelmadjid Bouabdallah and Hatem
Bettahar",
title = "{$ H_2 A $}: Hybrid Hash-chaining scheme for Adaptive
multicast source authentication of media-streaming",
journal = j-COMPUT-SECUR,
volume = "24",
number = "1",
pages = "57--68",
month = feb,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001816",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chan:2005:MCM,
author = "Alvin T. S. Chan",
title = "Mobile cookies management on a smart card",
journal = j-CACM,
volume = "48",
number = "11",
pages = "38--43",
month = nov,
year = "2005",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Oct 25 06:20:33 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Chan:2005:STM,
author = "Chao-Wen Chan and Chin-Chen Chang",
title = "A scheme for threshold multi-secret sharing",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "1",
pages = "1--14",
day = "6",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Book{Chandra:2005:BWS,
author = "Praphul Chandra",
title = "Bulletproof wireless security: {GSM}, {UMTS}, 802.11
and ad hoc security",
publisher = pub-NEWNES,
address = pub-NEWNES:adr,
pages = "xxxiii + 237",
year = "2005",
ISBN = "0-7506-7746-5 (paperback)",
ISBN-13 = "978-0-7506-7746-2 (paperback)",
LCCN = "TK5103.2 .C445 2005",
bibdate = "Mon Oct 3 19:13:41 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Communications engineering series",
URL = "http://books.elsevier.com/us/mk/us/subindex.asp?isbn=0750677465",
acknowledgement = ack-nhfb,
subject = "Wireless communication systems; Security measures;
Wireless LANs; Security measures; Global system for
mobile communications; Security measures; Universal
Mobile Telecommunications System; Security measures;
IEEE 802.11 (Standard)",
}
@Article{Chang:2005:ASN,
author = "Ya-Fen Chang and Chin-Chen Chang",
title = "Authentication schemes with no verification table",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "2",
pages = "820--832",
day = "15",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chang:2005:CIA,
author = "Ting-Yi Chang and Chou-Chan Yang and Ya-Wen Yang",
title = "Cryptanalysis of the improved authenticated key
agreement protocol",
journal = j-APPL-MATH-COMP,
volume = "171",
number = "2",
pages = "771--774",
day = "15",
month = dec,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chang:2005:DSM,
author = "Ya-Fen Chang and Chin-Chen Chang and Hui-Feng Huang",
title = "Digital signature with message recovery using
self-certified public keys without trustworthy system
authority",
journal = j-APPL-MATH-COMP,
volume = "161",
number = "1",
pages = "211--227",
day = "4",
month = feb,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:40 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chang:2005:EAP,
author = "Ya-Fen Chang and Chin-Chen Chang",
title = "An efficient authentication protocol for mobile
satellite communication systems",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "70--84",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2005:ILW,
author = "Ting-Yi Chang and Min-Shiang Hwang and Wei-Pang Yang",
title = "An improvement on the {Lin--Wu} $ (t, n) $ threshold
verifiable multi-secret sharing scheme",
journal = j-APPL-MATH-COMP,
volume = "163",
number = "1",
pages = "169--178",
day = "5",
month = apr,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:43 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chang:2005:NMS,
author = "Ting-Yi Chang and Min-Shiang Hwang and Wei-Pang Yang",
title = "A new multi-stage secret sharing scheme using one-way
function",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "48--55",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chang:2005:SAK,
author = "Ting-Yi Chang and Wei-Pang Yang and Min-Shiang Hwang",
title = "Simple authenticated key agreement and protected
password change protocol",
journal = j-COMPUT-MATH-APPL,
volume = "49",
number = "5--6",
pages = "703--714",
month = apr # "\slash " # may,
year = "2005",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122105000842",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@InProceedings{Chawla:2005:TPP,
author = "Shuchi Chawla and Cynthia Dwork and Frank McSherry and
Adam Smith and Hoeteck Wee",
title = "Toward Privacy in Public Databases",
crossref = "Kilian:2005:TCS",
pages = "363--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Chen:2005:CLR,
author = "Chien-Yuan Chen and Cheng-Yuan Ku and David C. Yen",
title = "Cryptanalysis of large {RSA} exponent by using the
{LLL} algorithm",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "516--525",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chen:2005:EDS,
author = "Yi-Hwa Chen and Jinn-Ke Jan",
title = "Enhancement of digital signature with message recovery
using self-certified public keys and its variants",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "90--96",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Chen:2005:ENB,
author = "Yen-Cheng Chen and Lo-Yao Yeh",
title = "An efficient nonce-based authentication scheme with
key agreement",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "2",
pages = "982--994",
day = "15",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chen:2005:EUG,
author = "Tzer-Shyong Chen and Jen-Yan Huang and Tzer-Long
Chen",
title = "An efficient undeniable group-oriented signature
scheme",
journal = j-APPL-MATH-COMP,
volume = "165",
number = "1",
pages = "95--102",
day = "6",
month = jun,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Chen:2005:NVW,
author = "Zhenyong Chen and Junhui Deng and Long Tang and
Zesheng Tang",
title = "A Novel Video Watermarking Resistant to
Spatio-Temporal Desynchronization",
crossref = "Han:2005:PJI",
pages = "532--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Chen:2005:TSS,
author = "Tzer-Shyong Chen",
title = "A threshold signature scheme based on the elliptic
curve cryptosystem",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "3",
pages = "1119--1134",
day = "25",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Cheng:2005:RIC,
author = "Xiaorong Cheng and Huilan Zhao and Jitian Kou",
title = "Research and Improvement on Computer Intrusion
Detection Technology Based on Immune Principle",
crossref = "Han:2005:PJI",
pages = "167--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Cherry:2005:MDC,
author = "S. Cherry",
title = "My dad's computer: a conservation with {Internet}
security expert {William R. Cheswick}",
journal = j-IEEE-SPECTRUM,
volume = "42",
number = "8",
pages = "55--56",
month = aug,
year = "2005",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2005.1491229",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "authorisation; Books; Computer hacking; computer
network reliability; Computer security; Cryptography;
Data security; firewalls; Government; Internet;
Internet security; Keyboards; Lumeta Corp.; Probes;
telecommunication security; Telecommunications",
}
@Article{Chess:2005:SAC,
author = "David M. Chess",
title = "Security in autonomic computing",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "2--5",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Chevallier-Mames:2005:ECB,
author = "Beno{\^\i}t Chevallier-Mames",
title = "An Efficient {CDH}-Based Signature Scheme with a Tight
Security Reduction",
crossref = "Shoup:2005:ACC",
pages = "511--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_31",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Chien:2005:NRS,
author = "Hung-Yu Chien and Ren-Chiun Wang and Chou-Chen Yang",
title = "Note on Robust and Simple Authentication Protocol",
journal = j-COMP-J,
volume = "48",
number = "1",
pages = "27--29",
month = jan,
year = "2005",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 28 17:48:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/bxh061.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_01/pdf/bxh061.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Choi:2005:JMA,
author = "Hyung-Kyu Choi and Yoo C. Chung and Soo-Mook Moon",
title = "{Java} Memory Allocation with Lazy Worst Fit for Small
Objects",
journal = j-COMP-J,
volume = "48",
number = "4",
pages = "437--442",
month = jul,
year = "2005",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh101",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Nov 8 05:58:50 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol48/issue4/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/48/4/437;
http://comjnl.oxfordjournals.org/cgi/reprint/48/4/437",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Choie:2005:EIB,
author = "Young Ju Choie and Eunkyung Jeong and Eunjeong Lee",
title = "Efficient identity-based authenticated key agreement
protocol from pairings",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "1",
pages = "179--188",
day = "4",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:41 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Cimato:2005:ICV,
author = "Stelvio Cimato and Alfredo {De Santis} and Anna Lisa
Ferrara and Barbara Masucci",
title = "Ideal contrast visual cryptography schemes with
reversing",
journal = j-INFO-PROC-LETT,
volume = "93",
number = "4",
pages = "199--206",
day = "28",
month = feb,
year = "2005",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Clarke:2005:AUM,
author = "N. L. Clarke and S. M. Furnell",
title = "Authentication of users on mobile telephones --- a
survey of attitudes and practices",
journal = j-COMPUT-SECUR,
volume = "24",
number = "7",
pages = "519--527",
month = oct,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805001446",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Cojocaru:2005:ISM,
author = "Alina Cojocaru and Maruti Ram Murty",
title = "An introduction to sieve methods and their
applications",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "????",
year = "2005",
ISBN = "0-521-84816-4 (hardcover), 0-521-61275-6 (paperback)",
ISBN-13 = "978-0-521-84816-9 (hardcover), 978-0-521-61275-3
(paperback)",
LCCN = "????",
bibdate = "Wed Sep 14 14:36:09 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "London Mathematical Society student texts",
acknowledgement = ack-nhfb,
subject = "Sieves (Mathematics)",
}
@Article{Collberg:2005:SWF,
author = "Christian Collberg and Tapas Ranjan Sahoo",
title = "Software watermarking in the frequency domain:
Implementation, analysis, and attacks",
journal = j-J-COMP-SECUR,
volume = "13",
number = "5",
pages = "721--755",
month = "????",
year = "2005",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2005-13503",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:56 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Comon:2005:TAO,
author = "Hubert Comon and V{\'e}ronique Cortier",
title = "Tree automata with one memory set constraints and
cryptographic protocols",
journal = j-THEOR-COMP-SCI,
volume = "331",
number = "1",
pages = "143--214",
day = "15",
month = feb,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jul 7 14:28:15 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Contini:2005:SAA,
author = "Scott Contini and Igor E. Shparlinski",
editor = "Colin Boyd and Juan Manuel Gonz{\'a}lez Nieto",
title = "On {Stern}'s Attack Against Secret Truncated Linear
Congruential Generators",
journal = j-LECT-NOTES-COMP-SCI,
volume = "3574",
pages = "180--206",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11506157_5",
ISBN = "3-540-26547-3",
ISBN-13 = "978-3-540-26547-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "????",
bibdate = "Wed Dec 21 08:25:19 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "Information Security and Privacy 10th Australasian
Conference, ACISP 2005, Brisbane, Australia, July 4--6,
2005. Proceedings",
abstract = "In 1987, Stern \cite{Stern:1987:SLC} showed how the
parameters for secret truncated linear congruential
generators could be derived in polynomial time. Here,
we present a modification to that algorithm which makes
it simpler, more robust, and require less data. We then
present a more careful analysis of the algorithm, and
establish some limits of its applicability. Thus,
secret truncated linear congruential generators may not
necessarily be insecure for properly chosen parameters.
Unfortunately, as in the original algorithm, all the
results remain heuristic, however we present results of
numerical experiments which support our conclusions.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Cooper:2005:AAP,
author = "Brian F. Cooper and Mayank Bawa and Neil Daswani and
Sergio Marti and Hector Garcia-Molina",
title = "Authenticity and availability in {PIPE} networks",
journal = j-FUT-GEN-COMP-SYS,
volume = "21",
number = "3",
pages = "391--400",
day = "1",
month = mar,
year = "2005",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Fri Jul 15 08:00:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@InProceedings{Coron:2005:MDR,
author = "Jean-S{\'e}bastien Coron and Yevgeniy Dodis and
C{\'e}cile Malinaud and Prashant Puniya",
title = "{Merkle--Damg{\aa}rd} Revisited: How to Construct a
Hash Function",
crossref = "Shoup:2005:ACC",
pages = "430--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_26",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Cramer:2005:BBS,
author = "Ronald Cramer and Serge Fehr and Martijn Stam",
title = "Black-Box Secret Sharing from Primitive Sets in
Algebraic Number Fields",
crossref = "Shoup:2005:ACC",
pages = "344--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_21",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Cramer:2005:CMS,
author = "Ronald Cramer and Vanesa Daza and Ignacio Gracia and
Jorge Jim{\'e}nez Urroz and Gregor Leander and Jaume
Mart{\'\i}-Farr{\'e} and Carles Padr{\'o}",
title = "On Codes, Matroids and Secure Multi-party Computation
from Linear Secret Sharing Schemes",
crossref = "Shoup:2005:ACC",
pages = "327--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_20",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Cramer:2005:SCP,
author = "Ronald Cramer and Ivan Damg{\aa}rd and Yuval Ishai",
title = "Share Conversion, Pseudorandom Secret-Sharing and
Applications to Secure Computation",
crossref = "Kilian:2005:TCS",
pages = "342--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Crampton:2005:UDR,
author = "Jason Crampton",
title = "Understanding and developing role-based administrative
models",
crossref = "Meadows:2005:CPA",
pages = "158--167",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Crandall:2005:DUV,
author = "Jedidiah R. Crandall and Zhendong Su and S. Felix Wu",
title = "On deriving unknown vulnerabilities from zero-day
polymorphic and metamorphic worm exploits",
crossref = "Meadows:2005:CPA",
pages = "235--248",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Crandall:2005:SAM,
author = "Jedidiah R. Crandall and Frederic T. Chong",
title = "A security assessment of the {Minos} architecture",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "48--57",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Book{Cranor:2005:SUD,
author = "Lorrie Faith Cranor and Simson Garfinkel",
title = "Security and usability: designing secure systems that
people can use",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xviii + 714",
year = "2005",
ISBN = "0-596-00827-9 (paperback)",
ISBN-13 = "978-0-596-00827-7 (paperback)",
LCCN = "QA76.9.A25; QA76.9.A25 S3533 2005; QA76.9.A25 S43
2005eb; QA76.9.A25 S43 2005",
bibdate = "Thu Oct 06 09:06:53 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "US\$44.95, CDN\$62.95, UK\pounds 31.95",
acknowledgement = ack-nhfb,
}
@Article{Crawford:2005:FBS,
author = "Diane Crawford and Marius Matioc and Steven M.
Bellovin and Richard Hubert and Andrew D. {Wolfe, Jr.}
and David Foulser and Andrew R. Kilner",
title = "Forum: To Block Spam, Demand Sender Authentication;
Not Revolutionary (Thank Goodness); How to Know the
Known from the Unknowns; User First in User-Centered
Design",
journal = j-CACM,
volume = "48",
number = "3",
pages = "11--13",
month = mar,
year = "2005",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Mar 24 16:07:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Curtin:2005:BFC,
author = "Matt Curtin",
title = "Brute force: cracking the {Data Encryption Standard}",
publisher = pub-COPERNICUS,
address = pub-COPERNICUS:adr,
pages = "x + 291",
year = "2005",
ISBN = "0-387-20109-2",
ISBN-13 = "978-0-387-20109-2",
LCCN = "QA76.9.A25 C873 2005",
bibdate = "Wed Sep 28 07:16:15 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
reviewurl = "http://www.unixreview.com/documents/s=9884/ur0509k/ur0509k.html",
subject = "Computer security; Data encryption (Computer
science)",
}
@Article{Cvejic:2005:IRL,
author = "N. Cvejic and T. Sepp{\"a}nen",
title = "Increasing Robustness of {LSB} Audio Steganography by
Reduced Distortion {LSB} Coding",
journal = j-J-UCS,
volume = "11",
number = "1",
pages = "56--65",
day = "28",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Jul 6 08:14:47 MDT 2005",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_11_1/increasing_robustness_of_lsb",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@InProceedings{Damgaard:2005:CRM,
author = "Ivan Damg{\aa}rd and Yuval Ishai",
title = "Constant-Round Multiparty Computation Using a
Black-Box Pseudorandom Generator",
crossref = "Shoup:2005:ACC",
pages = "378--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_23",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Damgaard:2005:QCN,
author = "Ivan Damg{\aa}rd and Thomas Brochmann Pedersen and
Louis Salvail",
title = "A Quantum Cipher with Near Optimal Key-Recycling",
crossref = "Shoup:2005:ACC",
pages = "494--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_30",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Damgard:2005:CBQ,
author = "I. B. Damgard and S. Fehr and L. Salvail and C.
Schaffner",
title = "Cryptography in the bounded quantum-storage model",
crossref = "IEEE:2005:AIS",
pages = "449--458",
year = "2005",
DOI = "https://doi.org/10.1109/SFCS.2005.30",
bibdate = "Thu Apr 12 09:33:00 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10244",
}
@InProceedings{Datta:2005:RBN,
author = "Anupam Datta and Ralf K{\"u}sters and John C. Mitchell
and Ajith Ramanathan",
title = "On the Relationships Between Notions of
Simulation-Based Security",
crossref = "Kilian:2005:TCS",
pages = "476--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Dedic:2005:ULB,
author = "Nenad Dedi{\'c} and Gene Itkis and Leonid Reyzin and
Scott Russell",
title = "Upper and Lower Bounds on Black-Box Steganography:
Extended Abstract",
crossref = "Kilian:2005:TCS",
pages = "227--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{DelLungo:2005:GSP,
author = "Alberto {Del Lungo} and Guy Louchard and Claudio
Marini and Franco Montagna",
title = "The {Guessing Secrets} problem: a probabilistic
approach",
journal = j-J-ALG,
volume = "55",
number = "2",
pages = "142--176",
month = may,
year = "2005",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/j.jalgor.2004.03.001",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:21:47 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677404000422",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
@Article{delRey:2005:SSS,
author = "A. Mart{\'\i}n del Rey and J. Pereira Mateus and G.
Rodr{\'\i}guez S{\'a}nchez",
title = "A secret sharing scheme based on cellular automata",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "1356--1364",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2005.01.026",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300305000718",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Ding:2005:CTC,
author = "Cunsheng Ding and Xuesong Wang",
title = "A coding theory construction of new systematic
authentication codes",
journal = j-THEOR-COMP-SCI,
volume = "330",
number = "1",
pages = "81--99",
day = "31",
month = jan,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jul 7 14:28:13 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Ding:2005:ECB,
author = "Yan Zong Ding",
title = "Error Correction in the Bounded Storage Model",
crossref = "Kilian:2005:TCS",
pages = "578--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Ding:2005:NME,
author = "Yong Ding and Kwok-wo Wong and Yu-min Wang",
title = "A $w$-{NNAF} method for the efficient computation of
scalar multiplication in elliptic curve cryptography",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "81--93",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Ding:2005:RNM,
author = "J. Ding and D. Schmidt",
title = "{Rainbow}, a New Multivariable Polynomial Signature
Scheme",
journal = j-LECT-NOTES-COMP-SCI,
volume = "3531",
pages = "164--175",
year = "2005",
CODEN = "LNCSD9",
DOI = "",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 15:57:42 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
remark = "Proceedings of Applied Cryptography and Network
Security (ACNS 05).",
}
@InProceedings{DiRaimondo:2005:NAD,
author = "Mario {Di Raimondo} and Rosario Gennaro",
title = "New approaches for deniable authentication",
crossref = "Meadows:2005:CPA",
pages = "112--121",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dodis:2005:CCS,
author = "Yevgeniy Dodis and Jonathan Katz",
title = "Chosen-Ciphertext Security of Multiple Encryption",
crossref = "Kilian:2005:TCS",
pages = "188--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Dodis:2005:ESE,
author = "Yevgeniy Dodis and Adam Smith",
title = "Entropic Security and the Encryption of High Entropy
Messages",
crossref = "Kilian:2005:TCS",
pages = "556--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Dodis:2005:GIF,
author = "Yevgeniy Dodis and Roberto Oliveira and Krzysztof
Pietrzak",
title = "On the Generic Insecurity of the Full Domain Hash",
crossref = "Shoup:2005:ACC",
pages = "449--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_27",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@InProceedings{Du:2005:BRS,
author = "Xiaozhen Du and Weidong Kou and Kai Fan and Yuxia
Xiao",
title = "Breaking and Repairing of a Strong Proxy Signature
Scheme With Proxy Signer Privacy Protection",
crossref = "Han:2005:PJI",
pages = "100--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dwork:2005:PPW,
author = "Cynthia Dwork and Moni Naor and Hoeteck Wee",
title = "Pebbling and Proofs of Work",
crossref = "Shoup:2005:ACC",
pages = "37--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_3",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Eagleton:2005:BRD,
author = "Catherine Eagleton",
title = "Book Review: {David A. King, The Ciphers of the Monks:
A Forgotten Number-Notation of the Middle Ages.
Boethius, 44. Stuttgart: FranzSteiner Verlag, 2001. Pp.
506. ISBN 3-515-07640-9. DM 199.49, EUR 102.00
(hardcover)}",
journal = j-BRITISH-J-HIST-SCI,
volume = "38",
number = "3",
pages = "359--360",
month = sep,
year = "2005",
CODEN = "BJHSAT",
DOI = "https://doi.org/10.1017/S0007087405277270",
ISSN = "0007-0874 (print), 1474-001X (electronic)",
ISSN-L = "0007-0874",
bibdate = "Thu Sep 23 07:34:43 MDT 2010",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=BJH;
https://www.math.utah.edu/pub/tex/bib/bjhs2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jstor.org/stable/4028680",
acknowledgement = ack-nhfb,
fjournal = "British Journal for the History of Science",
journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=BJH",
}
@Article{Eberle:2005:ANG,
author = "Hans Eberle and Sheueling Shantz and Vipul Gupta and
Nils Gura and Leonard Rarick and Lawrence Spracklen",
title = "Accelerating Next-Generation Public-Key Cryptosystems
on General-Purpose {CPUs}",
journal = j-IEEE-MICRO,
volume = "25",
number = "2",
pages = "52--59",
month = mar # "\slash " # apr,
year = "2005",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2005.24",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Wed Apr 20 08:11:29 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/mi/2005/02/m2052abs.htm;
http://csdl.computer.org/dl/mags/mi/2005/02/m2052.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Echizen:2005:PAV,
author = "Isao Echizen and Yasuhiro Fujii and Takaaki Yamada and
Satoru Tezuka and Hiroshi Yoshiura",
title = "Perceptually Adaptive Video Watermarking Using Motion
Estimation",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "89--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Book{Eilam:2005:RSR,
author = "Eldad Eilam and Elliot J. Chikofsky",
title = "Reversing: secrets of reverse engineering",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxviii + 589",
year = "2005",
ISBN = "0-7645-7481-7 (paperback)",
ISBN-13 = "978-0-7645-7481-8 (paperback)",
LCCN = "QA76.758 .E35 2005",
bibdate = "Fri Nov 16 21:15:37 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0628/2005921595-b.html;
http://www.loc.gov/catdir/enhancements/fy0628/2005921595-d.html;
http://www.loc.gov/catdir/enhancements/fy0628/2005921595-t.html",
acknowledgement = ack-nhfb,
subject = "Software engineering; Reverse engineering; Computer
security",
}
@Article{Elbirt:2005:ILD,
author = "Adam J. Elbirt and Christof Paar",
title = "An Instruction-Level Distributed Processor for
Symmetric-Key Cryptography",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "16",
number = "5",
pages = "468--480",
month = may,
year = "2005",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2005.51",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Nov 10 08:30:30 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@InProceedings{Enck:2005:EOF,
author = "William Enck and Patrick Traynor and Patrick McDaniel
and Thomas La Porta",
title = "Exploiting open functionality in {SMS}-capable
cellular networks",
crossref = "Meadows:2005:CPA",
pages = "393--404",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Fair:2005:CST,
author = "Ted Fair and Michael Nordfelt and Sandra Ring and Eric
Cole",
title = "Cyber spying: tracking your family's (sometimes)
secret online lives",
publisher = pub-SYNGRESS,
address = pub-SYNGRESS:adr,
pages = "xxiii + 439",
year = "2005",
bibdate = "Thu Oct 6 07:25:38 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
http://site.ebrary.com/lib/ucsc/Doc?id=10074965",
acknowledgement = ack-nhfb,
subject = "Computer security; Internet",
}
@Article{Fan:2005:RRA,
author = "Chun-I Fan and Yung-Cheng Chan and Zhi-Kai Zhang",
title = "Robust remote authentication scheme with smart cards",
journal = j-COMPUT-SECUR,
volume = "24",
number = "8",
pages = "619--628",
month = nov,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805000477",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Feng:2005:NMS,
author = "Jen-Bang Feng and Hsien-Chu Wu and Chwei-Shyong Tsai
and Yen-Ping Chu",
title = "A new multi-secret images sharing scheme using
{Lagrange}'s interpolation",
journal = j-J-SYST-SOFTW,
volume = "76",
number = "3",
pages = "327--339",
month = jun,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:28 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Fischlin:2005:CEN,
author = "Marc Fischlin",
title = "Communication-Efficient Non-interactive Proofs of
Knowledge with Online Extractors",
crossref = "Shoup:2005:ACC",
pages = "152--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_10",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Book{Foster:2005:BOA,
editor = "James C. Foster and Vitaly Osipov and Nish Bhalla and
Niels Heinen",
title = "Buffer Overflow Attacks: Detect, Exploit, Prevent",
publisher = pub-SYNGRESS,
address = pub-SYNGRESS:adr,
pages = "xxii + 497",
year = "2005",
ISBN = "1-932266-67-4",
ISBN-13 = "978-1-932266-67-2",
LCCN = "QA76.9.A25 B83 2005",
bibdate = "Thu Jun 9 12:29:00 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.oreilly.com/catalog/1932266674/;
http://www.oreilly.com/catalog/1932266674/desc.html;
http://www.unixreview.com/documents/s=9772/ur0506c/ur0506c.html;
melvyl.cdlib.org:210/CDL90",
note = "Foreword by Dave Aitel.",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer viruses",
}
@InProceedings{Freedman:2005:KSO,
author = "Michael J. Freedman and Yuval Ishai and Benny Pinkas
and Omer Reingold",
title = "Keyword Search and Oblivious Pseudorandom Functions",
crossref = "Kilian:2005:TCS",
pages = "303--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Fu:2005:DHP,
author = "Yongzhi Fu and Xuejie Zhang and Lin Hao",
title = "Design of High Performance Reconfigurable {Triple DES}
Processor",
crossref = "Han:2005:PJI",
pages = "110--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Furht:2005:MEW,
author = "Borivoje (Borko) Furht and Edin Muharemagic and Daniel
Socek",
title = "Multimedia encryption and watermarking",
volume = "28",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2005",
ISBN = "0-387-24425-5; 0-387-26090-0",
ISBN-13 = "978-0-387-24425-9; 978-0-387-26090-7",
LCCN = "QA76.575 .F885 2005",
bibdate = "Wed Sep 28 08:38:41 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Multimedia systems and applications",
acknowledgement = ack-nhfb,
subject = "Multimedia systems; Computer security",
}
@Article{Furnell:2005:AOW,
author = "Steven Furnell",
title = "Authenticating ourselves: will we ever escape the
password?",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "3",
pages = "8--13",
month = mar,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)00212-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:11 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485805002126",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Ganapathy:2005:APA,
author = "Vinod Ganapathy and Trent Jaeger and Somesh Jha",
title = "Automatic placement of authorization hooks in the
{Linux} security modules framework",
crossref = "Meadows:2005:CPA",
pages = "330--339",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Gang:2005:CNI,
author = "Litao Gang and Ali N. Akansu",
title = "Cover Noise Interference Suppression in Multimedia
Data Hiding",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "191--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Garrett:2005:CP,
author = "Paul Garrett",
title = "Cryptographic primitives",
crossref = "Garrett:2005:PKC",
pages = "1--62",
year = "2005",
MRclass = "11T71 (94-02 94A60)",
MRnumber = "2211870 (2006m:11176)",
MRreviewer = "Igor E. Shparlinski",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ge:2005:CCO,
author = "Gennian Ge and Ying Miao and Lihua Wang",
title = "Combinatorial Constructions for Optimal Splitting
Authentication Codes",
journal = j-SIAM-J-DISCR-MATH,
volume = "18",
number = "4",
pages = "663--678",
year = "2005",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480103435469",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Thu Dec 29 09:15:51 MST 2005",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/18/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://epubs.siam.org/sam-bin/dbq/article/43546",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@InProceedings{Gebhardt:2005:NPV,
author = "M. Gebhardt and G. Illies and W. Schindler",
booktitle = "{NIST Cryptographic Hash Workshop 2005}",
title = "A Note on the Practical Value of Single Hash Function
Collisions for Special File Formats",
publisher = "????",
address = "????",
pages = "??--??",
year = "2005",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Apr 03 08:43:05 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "18 slides + 15-page paper.",
URL = "http://csrc.nist.gov/pki/HashWorkshop/2005/Oct31_Presentations/Illies_NIST_05.pdf",
abstract = "We investigate Merkle-Damgard hash functions and
different file formats. Our goal is to construct many
meaningful hash collisions with given semantic contents
from one single abstract collision. We show that this
is not only possible for PostScript ([DL1], [DL2]) but
also for PDF, TIFF and MS Word 97. Our results suggest
that this property might be typical for higher file
formats.",
acknowledgement = ack-nhfb,
remark = "The authors show explicit construction of PostScript,
PDF, TIFF, and Word 97 documents with identical hash
functions but different contents",
}
@Article{Gennaro:2005:BEG,
author = "Rosario Gennaro and Yael Gertner and Jonathan Katz and
Luca Trevisan",
title = "Bounds on the Efficiency of Generic Cryptographic
Constructions",
journal = j-SIAM-J-COMPUT,
volume = "35",
number = "1",
pages = "217--246",
month = "????",
year = "2005",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:18 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/35/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Gennaro:2005:SMS,
author = "Rosario Gennaro and Mario {Di Raimondo}",
title = "Secure multiplication of shared secrets in the
exponent",
journal = j-INFO-PROC-LETT,
volume = "96",
number = "2",
pages = "71--79",
day = "31",
month = oct,
year = "2005",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:41:04 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Gentry:2005:PAK,
author = "Craig Gentry and Philip Mackenzie and Zulfikar
Ramzan",
title = "Password authenticated key exchange using hidden
smooth subgroups",
crossref = "Meadows:2005:CPA",
pages = "299--309",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Goldstone:2005:FCR,
author = "Lawrence Goldstone and Nancy Bazelon Goldstone",
title = "The Friar and the Cipher: {Roger Bacon} and the
Unsolved Mystery of the Most Unusual Manuscript in the
World",
publisher = pub-DOUBLEDAY,
address = pub-DOUBLEDAY:adr,
pages = "xi + 320",
year = "2005",
ISBN = "0-7679-1473-2",
ISBN-13 = "978-0-7679-1473-4",
LCCN = "Z105.5.V65 G65 2005",
bibdate = "Mon Oct 5 21:14:57 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/random056/2004050164.html;
http://www.loc.gov/catdir/description/random051/2004050164.html;
http://www.loc.gov/catdir/enhancements/fy0618/2004050164-s.html",
acknowledgement = ack-nhfb,
subject = "Voynich manuscript; Bacon, Roger",
subject-dates = "1214?--1294",
tableofcontents = "Turmoil and opportunity: Roger Bacon's England \\
Logic and mysticism: Aristotle, Plato, and Christianity
\\
Logic and theology: the evolution of scholasticism \\
Dogma, drink, and dissent: the University of Paris \\
Rebels in gray robes: Oxford \\
Science goes mainstream: the rise of Albertus Magnus
\\
The dumb ox: Thomas Aquinas \\
The miraculous doctor: Roger Bacon at Oxford \\
Autocracy in the Order of St. Francis \\
Theology becomes a science: the logic of Thomas Aquinas
\\
The great work \\
Seeing the future: the Scientia Experimentalis of Roger
Bacon \\
Knowledge suppressed: the conservatives \\
Enigmas and espionage: the strange journey of Dr. Dee
\\
Brilliant braggart: Francis Bacon \\
The trail of the cipher manuscript \\
The making of the most mysterious manuscript in the
world \\
MS 408 \\
The unfinished legacy of Roger Bacon",
}
@InProceedings{Goldwasser:2005:PPK,
author = "Shafi Goldwasser and Dmitriy Kharchenko",
title = "Proof of Plaintext Knowledge for the {Ajtai--Dwork}
Cryptosystem",
crossref = "Kilian:2005:TCS",
pages = "529--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Book{Golomb:2005:SDG,
author = "Solomon W. (Solomon Wolf) Golomb and Guang Gong",
title = "Signal design for good correlation for wireless
communication, cryptography, and radar",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xviii + 438",
year = "2005",
ISBN = "0-521-82104-5 (hardcover)",
ISBN-13 = "978-0-521-82104-9 (hardcover)",
LCCN = "TK5102.92 .G65 2005",
bibdate = "Mon Sep 19 08:49:52 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "http://www.loc.gov/catdir/toc/ecip057/2005002719.html",
acknowledgement = ack-nhfb,
subject = "Signal theory (Telecommunication); Signal processing;
Digital techniques",
}
@Book{Gorman:2005:NSC,
author = "Sean P. Gorman",
title = "Networks, security, and complexity: the role of public
policy in critical infrastructure protection",
publisher = "Edward Elgar Publishers",
address = "Northhampton, MA, USA",
pages = "153 (est.)",
year = "2005",
ISBN = "1-84376-952-2",
ISBN-13 = "978-1-84376-952-1",
LCCN = "QA76.9.A25 G657 2005",
bibdate = "Tue Nov 15 14:51:34 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; United States; Computer networks;
Security measures; United States; Terrorism; United
States; Prevention",
}
@Article{Grabner:2005:ALC,
author = "Peter J. Grabner and Clemens Heuberger and Helmut
Prodinger and J{\"o}rg M. Thuswaldner",
title = "Analysis of linear combination algorithms in
cryptography",
journal = j-TALG,
volume = "1",
number = "1",
pages = "123--142",
month = jul,
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1145/1077464.1077473",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Tue Dec 13 18:19:55 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Several cryptosystems rely on fast calculations of
linear combinations in groups. One way to achieve this
is to use joint signed binary digit expansions of small
``weight.'' We study two algorithms, one based on
nonadjacent forms of the coefficients of the linear
combination, the other based on a certain joint sparse
form specifically adapted to this problem. Both methods
are sped up using the sliding windows approach combined
with precomputed lookup tables. We give explicit and
asymptotic results for the number of group operations
needed, assuming uniform distribution of the
coefficients. Expected values, variances and a central
limit theorem are proved using generating functions.
Furthermore, we provide a new algorithm that calculates
the digits of an optimal expansion of pairs of integers
from left to right. This avoids storing the whole
expansion, which is needed with the previously known
right-to-left methods, and allows an online
computation.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Algorithms (TALG)",
}
@InProceedings{Granger:2005:DLP,
author = "R. Granger and F. Vercauteren",
title = "On the Discrete Logarithm Problem on Algebraic Tori",
crossref = "Shoup:2005:ACC",
pages = "66--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_5",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Granger:2005:HSN,
author = "R. Granger and D. Page and M. Stam",
title = "Hardware and software normal basis arithmetic for
pairing-based cryptography in characteristic three",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "7",
pages = "852--860",
month = jul,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.120",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1432668",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Groth:2005:CS,
author = "Jens Groth",
title = "Cryptography in Subgroups of {$ \mathbb {Z}*_n $}",
crossref = "Kilian:2005:TCS",
pages = "50--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Guar:2005:PPL,
author = "Nalneesh Guar",
title = "Paranoid penguin: Limitations of {{\tt shc}}, a shell
encryption utility",
journal = j-LINUX-J,
volume = "2005",
number = "138",
pages = "11--11",
month = oct,
year = "2005",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:46:11 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Guerrero:2005:ECB,
author = "Jorge Herrer{\'\i}as Guerrero and Roberto G{\'o}mez
C{\'a}rdenas",
title = "An example of communication between security tools:
{IPTables} --- {Snort}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "3",
pages = "34--43",
month = jul,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Gutmann:2005:WHC,
author = "P. Gutmann and D. Naccache and C. C. Palmer",
title = "When hashes collide [applied cryptography]",
journal = j-IEEE-SEC-PRIV,
volume = "3",
number = "3",
pages = "68--71",
month = may # "/" # jun,
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2005.84",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 26 18:29:12 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8013/31002/01439506.pdf;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=31002&arnumber=1439506&count=20&index=13",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@InProceedings{Han:2005:PJIb,
author = "Yiliang Han and Xiaoyuan Yang and Jian Zhang",
title = "Joint Signature and Encryption on Elliptic Curve",
crossref = "Han:2005:PJI",
pages = "135--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Harkins:2005:ESU,
author = "Ryan Harkins and Eric Weber and Andrew Westmeyer",
title = "Encryption Schemes using Finite Frames and {Hadamard}
Arrays",
journal = j-EXP-MATH,
volume = "14",
number = "4",
pages = "423--433",
month = "????",
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1080/10586458.2005.10128935",
ISSN = "1058-6458 (print), 1944-950X (electronic)",
ISSN-L = "1058-6458",
bibdate = "Mon Mar 5 15:33:58 MST 2012",
bibsource = "http://projecteuclid.org/euclid.em;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/expmath.bib;
http://www.tandfonline.com/toc/uexm20/14/4",
URL = "http://projecteuclid.org/euclid.em/1136926973",
acknowledgement = ack-nhfb,
fjournal = "Experimental Mathematics",
journal-URL = "http://www.tandfonline.com/loi/uexm20",
onlinedate = "30 Jan 2011",
}
@Book{Harrington:2005:NSP,
author = "Jan L. Harrington",
title = "Network security: a practical approach",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
pages = "xv + 365",
year = "2005",
ISBN = "0-12-311633-3",
ISBN-13 = "978-0-12-311633-8",
LCCN = "TK5105.59 .H357 2005",
bibdate = "Mon Oct 3 19:07:08 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures",
}
@Book{Harris:2005:GHE,
editor = "Shon Harris",
title = "Gray hat hacking: the ethical hacker's handbook",
publisher = pub-OSBORNE-MCGRAW-HILL,
address = pub-OSBORNE-MCGRAW-HILL:adr,
pages = "xx + 434",
year = "2005",
ISBN = "0-07-225709-1 (paperback)",
ISBN-13 = "978-0-07-225709-0 (paperback)",
LCCN = "QA76.9.A25 G743 2005",
bibdate = "Fri Oct 21 06:43:58 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "All-in-one",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer hackers",
}
@InProceedings{Harris:2005:IUS,
author = "David Harris and Ram Krishnamurthy and Mark Anders and
Sanu Mathew and Steven Hsu",
title = "An Improved Unified Scalable Radix-$2$ {Montgomery}
Multiplier",
crossref = "IEEE:2005:PIS",
pages = "??--??",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://arith17.polito.it/final/paper-109.pdf",
abstract = "This paper describes an improved version of the
Tenca-Ko{\c{c}} unified scalable radix-2 Montgomery
multiplier with half the latency for small and moderate
precision operands and half the queue memory
requirement. Like the Tenca-Ko{\c{c}} multiplier, this
design is reconfigurable to accept any input precision
in either $ \mathrm {GF}(p) $ or $ \mathrm {GF}(2 n) $
up to the size of the on-chip memory. An FPGA
implementation can perform 1024-bit modular
exponentiation in 16 ms using 5598 4-input lookup
tables, making it the fastest unified scalable design
yet reported.",
acknowledgement = ack-nhfb,
pagecount = "7",
}
@InProceedings{He:2005:MCP,
author = "Changhua He and Mukund Sundararajan and Anupam Datta
and Ante Derek and John C. Mitchell",
title = "A modular correctness proof of {IEEE 802.11i} and
{TLS}",
crossref = "Meadows:2005:CPA",
pages = "2--15",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Heuberger:2005:AGE,
author = "Clemens Heuberger and Rajendra Katti and Helmut
Prodinger and Xiaoyu Ruan",
title = "The alternating greedy expansion and applications to
computing digit expansions from left-to-right in
cryptography",
journal = j-THEOR-COMP-SCI,
volume = "341",
number = "1--3",
pages = "55--72",
day = "5",
month = sep,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 06:48:48 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Hilley:2005:CRM,
author = "Sarah Hilley",
title = "Crypto race for mathematical infinity",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "4",
pages = "10--11",
month = apr,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)70223-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:12 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485805702233",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
remark = "Discussion of the breaking of the SHA-1 cryptographic
hash algorithm.",
}
@InProceedings{Hofheinz:2005:CTN,
author = "Dennis Hofheinz and Dominique Unruh",
title = "Comparing Two Notions of Simulatability",
crossref = "Kilian:2005:TCS",
pages = "86--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Hohenberger:2005:HSO,
author = "Susan Hohenberger and Anna Lysyanskaya",
title = "How to Securely Outsource Cryptographic Computations",
crossref = "Kilian:2005:TCS",
pages = "264--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Holenstein:2005:OWS,
author = "Thomas Holenstein and Renato Renner",
title = "One-Way Secret-Key Agreement and Applications to
Circuit Polarization and Immunization of Public-Key
Encryption",
crossref = "Shoup:2005:ACC",
pages = "478--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_29",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Book{Hollar:2005:EWS,
author = "Rickland Hollar and Richard Murphy",
title = "Enterprise {Web} services security",
publisher = "Charles River Media",
address = "Hingham, MA, USA",
pages = "????",
year = "2005",
ISBN = "1-58450-413-7 (pbk. with CD-ROM)",
ISBN-13 = "978-1-58450-413-9 (pbk. with CD-ROM)",
LCCN = "TK5105.59 .H66 2005",
bibdate = "Fri Dec 9 06:49:14 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0515/2005018419.html",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Web sites;
Security measures; Web services",
}
@Book{Hook:2005:BCP,
author = "David Hook",
title = "Beginning cryptography and {PKI} in {Java}",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxvi + 448",
year = "2005",
ISBN = "0-7645-9633-0",
ISBN-13 = "978-0-7645-9633-9",
LCCN = "QA76.9.A25 H645 2005",
bibdate = "Tue Oct 11 05:21:48 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0511/2005011272.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; Public key
infrastructure (Computer security); Java (Computer
program language)",
}
@Article{Horan:2005:NRN,
author = "D. M. Horan and R. A. Guinee",
title = "A novel random number generator based on pseudonoise
sequences",
journal = "IEE Conference Publications",
volume = "2005",
number = "CP511",
pages = "431--436",
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1049/cp:20050349",
ISSN = "????",
bibdate = "Mon Jan 16 15:57:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://link.aip.org/link/abstract/IEECPS/v2005/iCP511/p431/s1",
acknowledgement = ack-nhfb,
keywords = "classical linear feedback shift register;
cryptanalytic attacks; cryptographic applications;
keystream generation; maximal length sequence;
pseudonoise sequences; random number generator;
statistical tests",
}
@InProceedings{Howgrave-Graham:2005:PKC,
author = "Nick Howgrave-Graham",
title = "Public-key cryptography and proofs of security",
crossref = "Garrett:2005:PKC",
pages = "73--89",
year = "2005",
MRclass = "94A60 (68P25 94-02)",
MRnumber = "2211872 (2006k:94088)",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Hromkovic:2005:DAR,
author = "Juraj Hromkovi{\v{c}}",
title = "Design and analysis of randomized algorithms:
introduction to design paradigms",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 274",
year = "2005",
ISBN = "3-540-23949-9",
ISBN-13 = "978-3-540-23949-9",
LCCN = "QA274 .H76 2005",
bibdate = "Mon Jun 12 18:08:09 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Texts in theoretical computer science",
acknowledgement = ack-nhfb,
subject = "algorithms; fingerprinting; random sampling;
stochastic processes",
}
@Article{Hsu:2005:CIT,
author = "Chien-Lung Hsu",
title = "Cryptanalysis and improvement of the {Tzeng--Hwang}
authenticated encryption scheme based on elliptic curve
discrete logarithm problem",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "2",
pages = "882--890",
day = "15",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hsu:2005:NPM,
author = "Chien-Lung Hsu and Tzong-Sun Wu and Wei-Hua He",
title = "New proxy multi-signature scheme",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "3",
pages = "1201--1206",
day = "25",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hsu:2005:SCT,
author = "Chien-Lung Hsu and Tzong-Sun Wu",
title = "Self-certified threshold proxy signature schemes with
message recovery, nonrepudiation, and traceability",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "1",
pages = "201--225",
day = "5",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hsu:2005:UFR,
author = "Chien-Lung Hsu",
title = "A user friendly remote authentication scheme with
smart cards against impersonation attacks",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "135--143",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Hu:2005:USA,
author = "Ruo Hu and Xingsan Qian",
title = "Using Smart Agent-Based Method to Implement Dynamic
Information Security Policy",
crossref = "Han:2005:PJI",
pages = "131--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Huang:2005:ASE,
author = "Qiang Huang and David Jao and Helen J. Wang",
title = "Applications of secure electronic voting to automated
privacy-preserving troubleshooting",
crossref = "Meadows:2005:CPA",
pages = "68--80",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InCollection{Huang:2005:EMP,
author = "Liusheng Huang and Hong Zhong and Hong Shen and
Yonglong Luo",
editor = "Hong Shen and Koji Nakano",
booktitle = "{Sixth International Conference on Parallel and
Distributed Computing, Applications and Technologies,
2005. PDCAT 2005: 5--8 December 2005, Dalian, China}",
title = "An Efficient Multiple-Precision Division Algorithm",
publisher = pub-IEEE,
address = pub-IEEE:adr,
bookpages = "xxvi + 1091",
pages = "971--974",
year = "2005",
DOI = "https://doi.org/10.1109/PDCAT.2005.79",
ISBN = "0-7695-2405-2",
ISBN-13 = "978-0-7695-2405-4",
LCCN = "QA76.58 .I5752 2005",
bibdate = "Mon Dec 09 14:30:16 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib",
note = "The authors present an integer-division algorithm that
runs three to five times faster than Knuth's 1981
original. However, there is an error in the
renormalization algorithm that is corrected in
\cite{Mukhopadhyay:2014:EMP}, while retaining the
speedup.",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=10544",
}
@Article{Hunt:2005:JFE,
author = "K. Hunt",
title = "A {Java} Framework for Experimentation with
Steganography",
journal = j-SIGCSE,
volume = "37",
number = "1",
pages = "282--286",
year = "2005",
CODEN = "SIGSD3",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
bibdate = "Tue Apr 26 10:50:23 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InProceedings{Hwang:2005:GTS,
author = "Jung Yeon Hwang and Dong Hoon Lee and Jongin Lim",
title = "Generic Transformation for Scalable Broadcast
Encryption Schemes",
crossref = "Shoup:2005:ACC",
pages = "276--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_17",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Hwang:2005:ITA,
author = "Shin-Jia Hwang",
title = "Improvement of {Tseng} et al.'s authenticated
encryption scheme",
journal = j-APPL-MATH-COMP,
volume = "165",
number = "1",
pages = "1--4",
day = "6",
month = jun,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hwang:2005:SHW,
author = "Shin-Jia Hwang and Hao-Chih Liao",
title = "Security of {Hsu--Wu}'s authenticated encryption
scheme with $ (t, n) $ shared verification",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "281--285",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hwang:2005:STH,
author = "Shin-Jia Hwang and Hao-Chih Liao",
title = "Security of {Tzeng--Hwang}'s authenticated encryption
scheme based on elliptic curve discrete logarithm
problems",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "717--721",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Hwang:2005:TAU,
author = "Kuo-Feng Hwang and I-En Liao",
title = "Two attacks on a user friendly remote authentication
scheme with {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "2",
pages = "94--96",
month = apr,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Hwang:2005:TSP,
author = "Min-Shiang Hwang and Kuo-Feng Hwang and Chin-Chen
Chang",
title = "A time-stamping protocol for digital watermarking",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "2",
pages = "1276--1284",
day = "15",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Inoue:2005:EST,
author = "Koji Inoue",
title = "Energy-security tradeoff in a secure cache
architecture against buffer overflow attacks",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "81--89",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Irwin:2005:PAI,
author = "Keith Irwin and Ting Yu",
title = "Preventing attribute information leakage in automated
trust negotiation",
crossref = "Meadows:2005:CPA",
pages = "36--45",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Ishai:2005:SCC,
author = "Yuval Ishai and Eyal Kushilevitz and Rafail
Ostrovsky",
title = "Sufficient Conditions for Collision-Resistant
Hashing",
crossref = "Kilian:2005:TCS",
pages = "445--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Book{ISO:2005:IDM,
author = "{ISO}",
title = "{ISO 19005-1:2005}, Document management---Electronic
document file format for long-term preservation---Part
1: Use of {PDF 1.4 (PDF/A-1)}",
publisher = pub-ISO,
address = pub-ISO:adr,
year = "2005",
ISBN = "",
ISBN-13 = "",
LCCN = "",
bibdate = "Wed Sep 21 08:32:04 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.aiim.org/documents/standards/ISO_19005-1_(E).doc;
http://www.aiim.org/pdf_a/",
abstract = "PDF/A is a constrained form of Adobe PDF version 1.4
intended to be suitable for long-term preservation of
page-oriented documents for which PDF is already being
used in practice. The proposed standard is being
developed by an ISO working group with representatives
from government, industry, and academia and active
support from Adobe Systems Incorporated.\par
PDF/A attempts to maximize:\\
* Device independence \\
* Self-containment \\
* Self-documentation The constraints include: \\
* Audio and video content are forbidden \\
* Javascript and executable file launches are
prohibited \\
* All fonts must be embedded and also must be legally
embeddable for unlimited, universal rendering \\
* Colorspaces specified in a device-independent manner
\\
* Encryption is disallowed \\
* Use of standards-based metadata is mandated",
acknowledgement = ack-nhfb,
remark = "Not yet on ISO Web site.",
}
@InProceedings{Jarecki:2005:FSP,
author = "Stanis{\l}aw Jarecki and Nitesh Saxena",
title = "Further Simplifications in Proactive {RSA}
Signatures",
crossref = "Kilian:2005:TCS",
pages = "510--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Jiang:2005:RNP,
author = "Zhengtao Jiang and Mingsen Xiang and Yumin Wang",
title = "A research on new public-key encryption schemes",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "51--61",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Jiang:2005:SAI,
author = "Zhengtao Jiang and Xi Sun and Yumin Wang",
title = "Security analysis and improvement of a double-trapdoor
encryption scheme",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "41--50",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Jiang:2005:TMD,
author = "Zhengtao Jiang and Yang Zhan and Dan Chen and Yumin
Wang",
title = "Two methods of directly constructing probabilistic
public-key encryption primitives based on third-order
{LFSR} sequences",
journal = j-APPL-MATH-COMP,
volume = "171",
number = "2",
pages = "900--911",
day = "15",
month = dec,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Jin:2005:EAW,
author = "Cong Jin and Kaihua Xu",
title = "Estimation and Application of the Watermark Embedding
Strength",
crossref = "Han:2005:PJI",
pages = "147--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Jing-mei:2005:CRB,
author = "Liu Jing-mei and Wei Bao-dian and Cheng Xiang-guo and
Wang Xin-mei",
title = "Cryptanalysis of {Rijndael} {S}-box and improvement",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "958--975",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Joglekar:2005:PEM,
author = "S. P. Joglekar and S. R. Tate",
title = "{ProtoMon}: Embedded Monitors for Cryptographic
Protocol Intrusion Detection and Prevention",
journal = j-J-UCS,
volume = "11",
number = "1",
pages = "83--??",
day = "28",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Jul 6 08:14:47 MDT 2005",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_11_1/protomon_embedded_monitors_for",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Johnson:2005:OSV,
author = "Thomas K. Johnson",
title = "An Open-Secret Voting System",
journal = j-COMPUTER,
volume = "38",
number = "3",
pages = "100--??",
month = mar,
year = "2005",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2005.78",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 4 16:02:15 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/co/2005/03/r3100.htm;
http://csdl.computer.org/dl/mags/co/2005/03/r3100.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Book{Jones:2005:RDF,
author = "Keith J. (Keith John) Jones and Richard Bejtlich and
Curtis W. Rose",
title = "Real Digital Forensics: Computer Security and Incident
Response",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxx + 650",
year = "2005",
ISBN = "0-321-24069-3 (paperback)",
ISBN-13 = "978-0-321-24069-9 (paperback)",
LCCN = "HV8079.C65 J66 2005",
bibdate = "Mon Apr 3 07:35:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer crimes; Investigation; Computer security",
}
@InProceedings{Juels:2005:APD,
author = "Ari Juels and Stephen A. Weis",
title = "Authenticating Pervasive Devices with Human
Protocols",
crossref = "Shoup:2005:ACC",
pages = "293--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_18",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@PhdThesis{Junod:2005:SCB,
author = "Pascal Junod",
title = "Statistical cryptanalysis of block ciphers",
type = "Th{\`e}se sciences",
school = "Facult{\'e} Informatique et communications IC, Section
des syst{\`e}mes de communication (Institut de
syst{\`e}mes de communication), EPF Lausanne",
address = "Lausanne, Switzerland",
pages = "267",
year = "2005",
bibdate = "Sat May 14 07:05:06 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://library.epfl.ch/theses/?nr=3179",
acknowledgement = ack-nhfb,
advisor = "S. Vaudenay",
}
@Book{Kapera:2005:MRP,
author = "Zdzis{\l}aw Jan Kapera",
title = "{Marian Rejewski} pogromca {Enigmy}. ({Polish})
[{Marian Rejewski} tamer of {Enigma}]",
volume = "2",
publisher = "Enigma Press",
address = "Krak{\'o}w, Poland",
pages = "96",
year = "2005",
ISBN = "83-86110-60-0",
ISBN-13 = "978-83-86110-60-5",
LCCN = "D810.C88 R455 2005",
bibdate = "Sat Jun 6 12:14:39 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Biblioteczka Enigmy",
acknowledgement = ack-nhfb,
subject = "Rejewski, Marian; Cryptographers; Poland; Biography;
Great Britain; Enigma cipher system; World War,
1939--1945; Cryptography",
subject-dates = "1905--1980",
}
@Article{Katos:2005:RTB,
author = "Vasilios Katos",
title = "A randomness test for block ciphers",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "1",
pages = "29--35",
day = "4",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:41 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Katz:2005:CBR,
author = "Jonathan Katz",
title = "Comparative book review: {{\booktitle{Cryptography: An
Introduction}}, by V. V. Yaschenko (American
Mathematical Society, 2002); \booktitle{Cryptanalysis
of Number Theoretic Ciphers}, by S. S. Wagstaff, Jr.
(Chapman \& Hall\slash CRC Press, 2003); \booktitle{RSA
and Public-Key Cryptography}, by R. A. Mollin (Chapman
\& Hall/CRC Press, 2003); \booktitle{Foundations of
Cryptography, vol. 1: Basic Tools}, by O. Goldreich,
(Cambridge University Press, 2001)}",
journal = j-SIGACT,
volume = "36",
number = "2",
pages = "14--19",
month = jun,
year = "2005",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1067309.1067316",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:27 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Katz05;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See
\cite{Goldreich:2001:FCBa,Wagstaff:2003:CNT,Mollin:2003:RPK}.",
URL = "http://doi.acm.org/10.1145/1067309.1067316",
abstract = "With the growing interest in cryptography --- from
students and researchers as well as from the general
public --- there has been a corresponding increase in
the number of cryptography textbooks available. Many of
these, however, remain somewhat mired in the past, and
present cryptography from a pre-1980s point of view.
Indeed, there are very few published books which even
make an attempt (let alone a successful one) at
covering modern cryptography. This unfortunate state of
affairs results in a serious lack of books describing
the fundamental advances in the field that have taken
place since the mid-1980's; this is especially true at
the undergraduate and beginning graduate levels, where
there is a severe need for suitable texts in this area.
The central contributions of modern (i.e., post-1980)
cryptography include an emphasis on precise
definitions, formalizations of cryptographic goals, and
provably-secure constructions of higher-level tasks
(e.g., signatures) from lower-level primitives (e.g.,
one-way functions). Without precise definitions and
rigorous proofs of security, cryptography is reduced to
a ``game'' in which the goal is merely to design a
scheme that one's friend or colleague cannot ``break''.
Any exposition of cryptography failing to recognize and
emphasize the difference between the former and the
latter approaches misses a substantial fraction of what
current cryptographic research is about, and is a
disservice to the field. Sadly, however, almost all
cryptography textbooks of which I am aware fall into
this category. A classic example of the problems with
an ``ad-hoc'' approach to cryptography is the following
simple test I often use to discriminate ``good''
cryptography books from ``poor'' ones: flip to the
section on digital signatures and see whether it is
stated anywhere that ``textbook RSA'' signatures are
completely insecure. It is a simple exercise to show
that this is the case (the same holds for ``textbook
RSA'' encryption, but it is somewhat more difficult to
demonstrate), yet most books make no mention of this
(central!) fact, and instead leave the reader with the
impression that secure signature schemes based on the
RSA problem are easy to design. Some might argue that
there is no place for rigorous definitions and proofs
in a book directed toward undergraduates, but I take
this misconception as a thinly-guised insult to
undergraduate computer science majors. Undergraduates
in other majors are taught quantum mechanics,
thermodynamics, analysis, and abstract algebra, to name
a few, all difficult subjects that are taught
rigorously (to varying degrees, perhaps). Why should an
undergraduate course on cryptography be expected to be
any less rigorous than these? Continuing the
disappointing trend discussed above, neither of the
first three books reviewed here qualify as (what I
would consider) appropriate for introducing the
interested reader to the field of cryptography.
Cryptography: An Introduction gets a number of things
right, but overall is a muddled, poorly written, and
disorganized text whose intended audience is unclear.
Cryptanalysis\ldots{} is a useful book which I am glad
to have on my shelf, but it fails at its stated goal of
serving as a suitable text for an introductory
cryptography course. It would serve better as a book on
elementary number theory (with applications to
cryptography, perhaps), and I wish it had been
advertised and organized as such. A somewhat similar
book, RSA and Public-Key Cryptography suffers from the
same criticisms; furthermore, I found its treatment of
number theory to be not quite on par with that in
Wagstaff's book. In contrast to these, Foundations of
Cryptography presents a clear and accurate picture of
the foundations underlying modern cryptography; in
fact, it is currently the only published book I am
aware of which does so. Its primary drawback is that it
is likely to be inaccessible to the beginning student;
it is more appropriate for a researcher or an advanced
graduate student who has previously been exposed to the
basics of cryptography, either of whom would benefit
from a careful reading of this book cover-to-cover.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@InProceedings{Katz:2005:HEP,
author = "Jonathan Katz and Yehuda Lindell",
title = "Handling Expected Polynomial-Time Strategies in
Simulation-Based Security Proofs",
crossref = "Kilian:2005:TCS",
pages = "128--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Katz:2005:MIA,
author = "Jonathan Katz and Ji Sun Shin",
title = "Modeling insider attacks on group key-exchange
protocols",
crossref = "Meadows:2005:CPA",
pages = "180--189",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Kawachi:2005:UTQ,
author = "Akinori Kawachi and Hirotada Kobayashi and Takeshi
Koshiba and Raymond H. Putra",
title = "Universal test for quantum one-way permutations",
journal = j-THEOR-COMP-SCI,
volume = "345",
number = "2--3",
pages = "370--385",
day = "22",
month = nov,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 06:48:50 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Book{Keefe:2005:CDS,
author = "Patrick Radden Keefe",
title = "Chatter: dispatches from the secret world of global
eavesdropping",
publisher = pub-RANDOM-HOUSE,
address = pub-RANDOM-HOUSE:adr,
pages = "xvii + 300",
year = "2005",
ISBN = "1-4000-6034-6",
ISBN-13 = "978-1-4000-6034-4",
LCCN = "JK468.I6 K37 2005",
bibdate = "Thu Jan 19 12:16:35 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/bios/random051/2004058481.html;
http://www.loc.gov/catdir/description/random051/2004058481.html",
acknowledgement = ack-nhfb,
subject = "Echelon; intelligence service; United States;
eavesdropping; wiretapping; civil rights; National
Security Agency",
}
@Manual{Kellar:2005:NRR,
author = "Sharon S. Kellar",
title = "{NIST}-Recommended Random Number Generator Based on
{ANSI X9.31 Appendix A.2.4} Using the 3-Key {Triple
DES} and {AES} Algorithms",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "4",
day = "31",
month = jan,
year = "2005",
bibdate = "Thu Aug 18 07:16:02 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/cryptval/rng/931rngext.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography",
}
@Manual{Keller:2005:NRR,
author = "Sharon S. Keller",
title = "{NIST}-Recommended Random Number Generator Based on
{ANSI X9.31 Appendix A.2.4} Using the 3-Key {Triple
DES} and {AES} Algorithms",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "4",
day = "31",
month = jan,
year = "2005",
bibdate = "Thu Apr 30 08:10:57 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://csrc.nist.gov/cryptval/rng/931rngext.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography",
}
@Article{Khaw:2005:EDA,
author = "L. T. Khaw",
title = "Of Encryption and Devices: The Anti-Circumvention
Provision of the {Malaysian Copyright Act 1987}",
journal = "European intellectual property review",
volume = "27",
number = "2",
pages = "53--64",
year = "2005",
ISSN = "0142-0461",
bibdate = "Wed Sep 28 08:40:15 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Kiltz:2005:SCM,
author = "Eike Kiltz and Gregor Leander and John Malone-Lee",
title = "Secure Computation of the Mean and Related
Statistics",
crossref = "Kilian:2005:TCS",
pages = "283--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Kiltz:2005:TCL,
author = "Eike Kiltz and Hans Ulrich Simon",
title = "Threshold circuit lower bounds on cryptographic
functions",
journal = j-J-COMP-SYS-SCI,
volume = "71",
number = "2",
pages = "185--212",
month = aug,
year = "2005",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2005.03.001",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:26:58 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000005000292",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Kim:2005:CLL,
author = "Kee-Won Kim and Eun-Kyung Ryu and Kee-Young Yoo",
title = "Cryptanalysis of {Lee--Lee} authenticated key
agreement scheme",
journal = j-APPL-MATH-COMP,
volume = "163",
number = "1",
pages = "193--198",
day = "5",
month = apr,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:43 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Kim:2005:IYA,
author = "Kee-Won Kim and Jun-Cheol Jeon and Kee-Young Yoo",
title = "An improvement on {Yang} et al.'s password
authentication schemes",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "207--215",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Kim:2005:SMA,
author = "Byung-Gi Kim and Sang-Sun Hong",
title = "Secure Mutual Authentication for Ad hoc Wireless
Networks",
journal = j-J-SUPERCOMPUTING,
volume = "33",
number = "1",
pages = "123--132",
month = jul,
year = "2005",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-005-0225-z",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 6 10:36:21 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=33&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=33&issue=1&spage=123",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@InProceedings{Kissner:2005:PPS,
author = "Lea Kissner and Dawn Song",
title = "Privacy-Preserving Set Operations",
crossref = "Shoup:2005:ACC",
pages = "241--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_15",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@TechReport{Koblitz:2005:PBC,
author = "Neal Koblitz and Alfred Menezes",
title = "Pairing-Based Cryptography at High Security Levels",
type = "Report",
number = "??",
institution = "Department of Mathematics, Box 354350, University of
Washington",
address = "Seattle, WA 98195, USA",
day = "11",
month = may,
year = "2005",
bibdate = "Fri Feb 15 10:47:55 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.mathnet.or.kr/mathnet/preprint_file/cacr/2005/cacr2005-08.pdf",
acknowledgement = ack-nhfb,
}
@InProceedings{Krawczyk:2005:HHP,
author = "Hugo Krawczyk",
title = "{HMQV}: a High-Performance Secure {Diffie--Hellman}
Protocol",
crossref = "Shoup:2005:ACC",
pages = "546--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_33",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@MastersThesis{Kreitz:2005:OBE,
author = "Gunnar Kreitz",
title = "Optimization of broadcast encryption schemes",
type = "Examensarbete",
school = "Numerisk analys och datalogi, Kungliga Tekniska
h{\"o}gskolan",
address = "Stockholm, Sweden",
pages = "61",
year = "2005",
bibdate = "Wed Sep 28 07:45:30 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Krukow:2005:FCR,
author = "Karl Krukow and Mogens Nielsen and Vladimiro Sassone",
title = "A framework for concrete reputation-systems with
applications to history-based access control",
crossref = "Meadows:2005:CPA",
pages = "260--269",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ku:2005:CFR,
author = "Wei-Chi Ku and Shuai-Min Chen",
title = "Cryptanalysis of a flexible remote user authentication
scheme using {Smart Cards}",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "90--96",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Ku:2005:WYR,
author = "Wei-Chi Ku and Min-Hung Chiang and Shen-Tien Chang",
title = "Weaknesses of {Yoon--Ryu--Yoo}'s hash-based password
authentication scheme",
journal = j-OPER-SYS-REV,
volume = "39",
number = "1",
pages = "85--89",
month = jan,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@Article{Kwon:2005:CLK,
author = "Jeoung Ok Kwon and Jung Yeon Hwang and Changwook Kim
and Dong Hoon Lee",
title = "Cryptanalysis of {Lee--Kim--Yoo} password-based key
agreement scheme",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "2",
pages = "858--865",
day = "15",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Laskari:2005:TTC,
author = "E. C. Laskari and G. C. Meletiou and D. K. Tasoulis
and M. N. Vrahatis",
title = "Transformations of two cryptographic problems in terms
of matrices",
journal = j-SIGSAM,
volume = "39",
number = "4",
pages = "127--130",
month = dec,
year = "2005",
CODEN = "SIGSBZ",
ISSN = "0163-5824 (print), 1557-9492 (electronic)",
ISSN-L = "0163-5824",
bibdate = "Wed Aug 23 14:11:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIGSAM Bulletin",
issue = "154",
}
@InProceedings{Laud:2005:STS,
author = "Peeter Laud",
title = "Secrecy types for a simulatable cryptographic
library",
crossref = "Meadows:2005:CPA",
pages = "26--35",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Lawton:2005:MAH,
author = "George Lawton",
title = "{E}-Mail Authentication Is Here, but Has It Arrived
Yet?",
journal = j-COMPUTER,
volume = "38",
number = "11",
pages = "17--19",
month = nov,
year = "2005",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2005.377",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:16:18 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/co/2005/11/ry017.pdf",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Lee:2005:APC,
author = "Ruby B. Lee and Peter C. S. Kwan and John P. McGregor
and Jeffrey Dwoskin and Zhenghong Wang",
title = "Architecture for Protecting Critical Secrets in
Microprocessors",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "2",
pages = "2--13",
month = may,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Lee:2005:CMA,
author = "Keon-Jik Lee and Byeong-Jik Lee",
title = "Cryptanalysis of the modified authenticated key
agreement scheme",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "280--284",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2005:ENB,
author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo",
title = "Efficient nonce-based remote user authentication
scheme using smart cards",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "355--361",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2005:EVB,
author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo",
title = "Efficient verifier-based key agreement protocol for
three parties without server's public key",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "2",
pages = "996--1003",
day = "15",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2005:IEC,
author = "B. K. Lee and L. K. John",
title = "Implications of executing compression and encryption
applications on general purpose processors",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "7",
pages = "917--922",
month = jul,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.121",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1432674",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Lee:2005:IHA,
author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo",
title = "Improvement of {HWWM}-authenticated key agreement
protocol",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "3",
pages = "1315--1320",
day = "25",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2005:ILL,
author = "Sung-Woon Lee and Hyun-Sung Kim and Kee-Young Yoo",
title = "Improvement of {Lee} and {Lee}'s authenticated key
agreement scheme",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "3",
pages = "1049--1053",
day = "25",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2005:IWR,
author = "Choong-Hoon Lee and Heung-Kyu Lee and Youngho Suh",
title = "Image Watermarking Resistant to Combined Geometric and
Removal Attacks",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "37--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Lee:2005:NBS,
author = "Cheng-Chi Lee and Min-Shiang Hwang and Wei-Pang Yang",
title = "A new blind signature based on the discrete logarithm
problem for untraceability",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "3",
pages = "837--841",
day = "25",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lee:2005:NIW,
author = "Joong-Jae Lee and Won Kim and Na-Young Lee and
Gye-Young Kim",
title = "A New Incremental Watermarking Based on Dual-Tree
Complex Wavelet Transform",
journal = j-J-SUPERCOMPUTING,
volume = "33",
number = "1",
pages = "133--140",
month = jul,
year = "2005",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-005-0226-y",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 6 10:36:21 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=33&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=33&issue=1&spage=133",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@Article{Lee:2005:SSP,
author = "Narn-Yih Lee and Ming-Feng Lee",
title = "The security of a strong proxy signature scheme with
proxy signer privacy protection",
journal = j-APPL-MATH-COMP,
volume = "161",
number = "3",
pages = "807--812",
day = "25",
month = feb,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:40 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Lepinski:2005:FZK,
author = "Matt Lepinski and Silvio Micali and Abhi Shelat",
title = "Fair-Zero Knowledge",
crossref = "Kilian:2005:TCS",
pages = "245--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Lesniewski-Laas:2005:SSS,
author = "Chris Lesniewski-Laas and M. Frans Kaashoek",
title = "{SSL} splitting: Securely serving data from untrusted
caches",
journal = j-COMP-NET-AMSTERDAM,
volume = "48",
number = "5",
pages = "763--779",
day = "5",
month = aug,
year = "2005",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 14 17:03:09 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InProceedings{Li:2005:AAU,
author = "Zude Li and Xiaojun Ye",
title = "Attribute Analysis of Usage Control ({UCON})",
crossref = "Han:2005:PJI",
pages = "59--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2005:ATN,
author = "Jiangtao Li and Ninghui Li and William H.
Winsborough",
title = "Automated trust negotiation using cryptographic
credentials",
crossref = "Meadows:2005:CPA",
pages = "46--57",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Li:2005:AWP,
author = "Zhitang Li and Huijun Jiang and Hanju Li",
title = "Active Worm Propagation Model With Discrete Time",
crossref = "Han:2005:PJI",
pages = "122--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Li:2005:BPC,
author = "Ninghui Li and John C. Mitchell and William H.
Winsborough",
title = "Beyond proof-of-compliance: security analysis in trust
management",
journal = j-J-ACM,
volume = "52",
number = "3",
pages = "474--514",
month = may,
year = "2005",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1066100.1066103",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Tue Jul 5 06:39:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Trust management is a form of distributed access
control that allows one principal to delegate some
access decisions to other principals. While the use of
delegation greatly enhances flexibility and
scalability, it may also reduce the control that a
principal has over the resources it owns. Security
analysis asks whether safety, availability, and other
properties can be maintained while delegating to
partially trusted principals. We show that in contrast
to the undecidability of classical
Harrison--Ruzzo--Ullman safety properties, our primary
security properties are decidable. In particular, most
security properties we study are decidable in
polynomial time. The computational complexity of
containment analysis, the most complicated security
property we study, varies according to the expressive
power of the trust management language.",
acknowledgement = ack-nhfb,
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@InProceedings{Li:2005:FCR,
author = "Ying Li and Jintao Li",
title = "Further Cryptanalysis of a Remote Login Authentication
Scheme Based on Geometric Approach",
crossref = "Han:2005:PJI",
pages = "143--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Li:2005:ISS,
author = "Li-Hua Li and Shiang-Feng Tzeng and Min-Shiang Hwang",
title = "Improvement of signature scheme based on factoring and
discrete logarithms",
journal = j-APPL-MATH-COMP,
volume = "161",
number = "1",
pages = "49--54",
day = "4",
month = feb,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:40 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Li:2005:IWR,
author = "Haifeng Li and Shuxun Wang and Weiwei Song",
title = "Image Watermarking Resistant to Global Geometrical
Attacks",
crossref = "Han:2005:PJI",
pages = "911--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Li:2005:MCK,
author = "Mingyan Li and Radha Poovendran and David A. McGrew",
title = "Minimizing center key storage in hybrid one-way
function based group key management with communication
constraints",
journal = j-INFO-PROC-LETT,
volume = "93",
number = "4",
pages = "191--198",
day = "28",
month = feb,
year = "2005",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Li:2005:ULC,
author = "Chung-Chih Li and Bo Sun",
editor = "Gongzhu Hu",
booktitle = "{Computers and their applications: proceedings of the
ISCA 20th international conference ; New Orleans,
Louisiana, USA, March 16--18, 2005}",
title = "Using Linear Congruential Generators for Cryptographic
Purposes",
publisher = "International Society for Computers and Their
Applications",
address = "Cary, NC, USA",
bookpages = "vi + 499",
pages = "13--19",
year = "2005",
ISBN = "1-880843-54-4",
ISBN-13 = "978-1-880843-54-3",
LCCN = "QA76.76.A65 I83 2005",
bibdate = "Tue Mar 06 06:57:02 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/conf/cata/cata2005.html#LiS05;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Liang:2005:FAG,
author = "Zhenkai Liang and R. Sekar",
title = "Fast and automated generation of attack signatures: a
basis for building self-protecting servers",
crossref = "Meadows:2005:CPA",
pages = "213--222",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Liang:2005:PAC,
author = "Wei Liang and Wenye Wang",
title = "On performance analysis of challenge\slash response
based authentication in wireless networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "48",
number = "2",
pages = "267--288",
day = "6",
month = jun,
year = "2005",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Thu Jul 14 17:03:08 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Licks:2005:GAI,
author = "Vinicius Licks and Ramiro Jordan",
title = "Geometric Attacks on Image Watermarking Systems",
journal = j-IEEE-MULTIMEDIA,
volume = "12",
number = "3",
pages = "68--78",
month = jul # "\slash " # sep,
year = "2005",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2005.46",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Nov 10 07:41:20 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@InProceedings{Lieman:2005:CRW,
author = "Daniel Lieman",
title = "Cryptography in the real world today",
crossref = "Garrett:2005:PKC",
pages = "63--72",
year = "2005",
MRclass = "94A60 (94-02 94A62)",
MRnumber = "2211871 (2006k:94099)",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lin:2005:HAO,
author = "Henry Lin and Luca Trevisan and Hoeteck Wee",
title = "On Hardness Amplification of One-Way Functions",
crossref = "Kilian:2005:TCS",
pages = "34--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Lin:2005:NIB,
author = "Chih-Yin Lin and Tzong-Chen Wu and Fangguo Zhang and
Jing-Jang Hwang",
title = "New identity-based society oriented signature schemes
from pairings on elliptic curves",
journal = j-APPL-MATH-COMP,
volume = "160",
number = "1",
pages = "245--260",
day = "5",
month = jan,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:39 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@TechReport{Lindskog:2005:DIT,
author = "Stefan Lindskog and Anna Brunstr{\"o}m",
title = "Design and implementation of a tunable encryption
service for networked applications",
type = "Technical report",
number = "2005:03",
institution = "Chalmers tekniska h{\"o}gskola",
address = "G{\"o}teborg, Sweden",
pages = "17",
year = "2005",
ISSN = "1652-926X",
bibdate = "Wed Sep 28 07:43:27 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Liu:2005:DBV,
author = "Hongmei Liu and Jiwu Huang and Yun Q. Shi",
title = "{DWT}-Based Video Data Hiding Robust to {MPEG}
Compression and Frame Loss",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "111--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Liu:2005:RBU,
author = "Linlan Liu and Jian Shu and Jianxiang Zheng",
title = "The {RBAC}-Based User Authorization in {Sanxin ERP}
System",
crossref = "Han:2005:PJI",
pages = "155--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Liu:2005:SWA,
author = "Sanya Liu and Zhenyu Liu and Zhongren Su",
title = "Securing {Web} Application System: a Solution Based on
{SMS} for Identifying Users",
crossref = "Han:2005:PJI",
pages = "104--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Lixin:2005:FLA,
author = "Xu Lixin and Zhang Xincheng and He Min and Wu Xianglin
and Qingyun Ru",
title = "A Four-Layer Architecture for {Web} Application System
Security Assurance: a Safeguard Mechanism Research",
crossref = "Han:2005:PJI",
pages = "87--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Loepp:2005:PIC,
author = "Susan Loepp and William Wootters",
title = "Protecting Information: From Classical Error
Correction to Quantum Cryptography",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "????",
year = "2005",
ISBN = "0-521-82740-X (hardcover), 0-521-53476-3 (paperback)",
ISBN-13 = "978-0-521-82740-9 (hardcover), 978-0-521-53476-5
(paperback)",
LCCN = "????",
bibdate = "Wed Sep 14 14:40:44 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Long:2005:DTC,
author = "Yu Long and Zhenfu Cao and Kefei Chen",
title = "A dynamic threshold commercial key escrow scheme based
on conic",
journal = j-APPL-MATH-COMP,
volume = "171",
number = "2",
pages = "972--982",
day = "15",
month = dec,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lu:2005:BIW,
author = "Haiping Lu and Yun Q. Shi and Alex C. Kot and Lihui
Chen",
title = "Binary Image Watermarking Through Blurring and Biased
Binarization",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "67--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@InProceedings{Lu:2005:CCA,
author = "Yi Lu and Willi Meier and Serge Vaudenay",
title = "The Conditional Correlation Attack: a Practical Attack
on {Bluetooth} Encryption",
crossref = "Shoup:2005:ACC",
pages = "97--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_7",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Motivated by the security of the nonlinear filter
generator, the concept of correlation was previously
extended to the conditional correlation, that studied
the linear correlation of the inputs conditioned on a
given (short) output pattern of some specific nonlinear
function. Based on the conditional correlations,
conditional correlation attacks were shown to be
successful and efficient against the nonlinear filter
generator. In this paper, we further generalize the
concept of conditional correlations by assigning it
with a different meaning, i.e. the correlation of the
output of an arbitrary function conditioned on the
unknown (partial) input which is uniformly distributed.
Based on this generalized conditional correlation, a
general statistical model is studied for dedicated
key-recovery distinguishers. It is shown that the
generalized conditional correlation is no smaller than
the unconditional correlation. Consequently, our
distinguisher improves on the traditional one (in the
worst case it degrades into the traditional one). In
particular, the distinguisher may be successful even if
no ordinary correlation exists. As an application, a
conditional correlation attack is developed and
optimized against Bluetooth two-level E0. The attack is
based on a recently detected flaw in the
resynchronization of E0, as well as the investigation
of conditional correlations in the Finite State Machine
(FSM) governing the keystream output of E0. Our best
attack finds the original encryption key for two-level
E0 using the first 24 bits of $ 2^{23.8} $ frames and
with $ 2^{38} $ computations. This is clearly the
fastest and only practical known-plaintext attack on
Bluetooth encryption compared with all existing
attacks. Current experiments confirm our analysis.",
acknowledgement = ack-nhfb,
keywords = "Bluetooth; Correlation; Crypto '2005; cryptography;
E0; Stream Ciphers",
}
@Article{Lu:2005:ERU,
author = "Rongxing Lu and Zhenfu Cao",
title = "Efficient remote user authentication scheme using
smart card",
journal = j-COMP-NET-AMSTERDAM,
volume = "49",
number = "4",
pages = "535--540",
day = "15",
month = nov,
year = "2005",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:08 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Lu:2005:NDA,
author = "Rongxing Lu and Zhenfu Cao",
title = "A new deniable authentication protocol from bilinear
pairings",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "2",
pages = "954--961",
day = "15",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lu:2005:NPS,
author = "Eric Jui-Lin Lu and Min-Shiang Hwang and Cheng-Jian
Huang",
title = "A new proxy signature scheme with revocation",
journal = j-APPL-MATH-COMP,
volume = "161",
number = "3",
pages = "799--806",
day = "25",
month = feb,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:40 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lu:2005:PBM,
author = "RongXing Lu and ZhenFu Cao and Yuan Zhou",
title = "Proxy blind multi-signature scheme without a secure
channel",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "1",
pages = "179--187",
day = "5",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lu:2005:RTP,
author = "RongXing Lu and ZhenFu Cao and HaoJin Zhu",
title = "A robust $ (k, n) + 1 $ threshold proxy signature
scheme based on factoring",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "1",
pages = "35--45",
day = "6",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lu:2005:TUS,
author = "Rong Xing Lu and Zhen Fu Cao and Yuan Zhou",
title = "Threshold undeniable signature scheme based on conic",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "1",
pages = "165--177",
day = "4",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:41 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Ludvig:2005:PWF,
author = "Michal Ludvig",
title = "{VIA} {PadLock}-wicked fast encryption",
journal = j-LINUX-J,
volume = "2005",
number = "133",
pages = "4--4",
month = may,
year = "2005",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:46:07 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Lv:2005:PCA,
author = "Jiqiang Lv and Xinmei Wang and Kwangjo Kim",
title = "Practical convertible authenticated encryption schemes
using self-certified public keys",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "2",
pages = "1285--1297",
day = "15",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lv:2005:SMS,
author = "Jiqiang Lv and Xinmei Wang and Kwangjo Kim",
title = "Security of a multisignature scheme for specified
group of verifiers",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "1",
pages = "58--63",
day = "6",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lyuu:2005:CIH,
author = "Yuh-Dauh Lyuu and Ming-Luen Wu",
title = "Cryptanalysis of and improvement on the {Hwang--Chen}
multi-proxy multi-signature schemes",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "729--739",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Ma:2005:NCD,
author = "Yiping Ma and Jiqing Han",
title = "A New Capability Description for Audio Information
Hiding",
crossref = "Han:2005:PJI",
pages = "65--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Macchetti:2005:QPH,
author = "Marco Macchetti and Luigi Dadda",
title = "Quasi-Pipelined Hash Circuits",
crossref = "IEEE:2005:PIS",
pages = "??--??",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://arith17.polito.it/final/paper-149.pdf",
abstract = "Hash functions are an important cryptographic
primitive. They are used to obtain a fixed-size
fingerprint, or hash value, of an arbitrary long
message. We focus particularly on the class of
dedicated hash functions, whose general construction is
presented; the peculiar arrangement of sequential and
combinational units makes the application of pipelining
techniques to these constructions not trivial. We
formalize here an optimization technique called
quasipipelining, whose goal is to optimize the critical
path and thus to increase the clock frequency in
dedicated hardware implementations. The SHA-2 algorithm
has been previously examined by Dadda et al., with
specific versions of quasipipelining; here, a full
generalization of the technique is presented, along
with application to the SHA-1 algorithm.
Quasi-pipelining could be as well applied to future
hashing algorithms, provided they are designed along
the same lines as those of the SHA family.",
acknowledgement = ack-nhfb,
pagecount = "8",
}
@Article{Mares:2005:BRA,
author = "Peter Mares",
title = "Book Review: {{\em Art of Java Web Development}, by N.
Ford}",
journal = j-COMP-J,
volume = "48",
number = "2",
pages = "253--253",
month = mar,
year = "2005",
CODEN = "CMPJA6",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 28 17:48:36 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/free_pdf/bxh071.pdf;
http://www3.oup.co.uk/computer_journal/hdb/Volume_48/Issue_02/bxh071.sgm.abs.html",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@PhdThesis{Martin:2005:STA,
author = "Thomas Martin",
title = "A set theoretic approach to broadcast encryption",
type = "Thesis ({Ph.D.})",
school = "University of London",
address = "London, UK",
pages = "235",
year = "2005",
bibdate = "Wed Sep 28 08:14:04 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Mathieson:2005:UCR,
author = "SA Mathieson",
title = "{UK} crypto regulation option dies",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "6",
pages = "2--2",
month = jun,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)70241-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:15 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485805702415",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Matula:2005:TLS,
author = "David Matula and Alex Fit-Florea and Mitchell
Thornton",
title = "Table Lookup Structures for Multiplicative Inverses
Modulo $ 2^k $",
crossref = "IEEE:2005:PIS",
pages = "??--??",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://arith17.polito.it/final/paper-160.pdf",
abstract = "We introduce an inheritance property and related table
lookup structures applicable to simplified evaluation
of the modular operations ``multiplicative inverse'',
``discrete log'', and ``exponential residue'' in the
particular modulus $ 2^k $. Regarding applications, we
describe an integer representation system of Benschop
for transforming integer multiplications into additions
which benefits from our table lookup function
evaluation procedures.\par We focus herein on the
multiplicative inverse modulo $ 2^k $ to exhibit
simplifications in hardware implementations realized
from the inheritance property. A table lookup structure
given by a bit string that can be interpreted with
reference to a binary tree is described and analyzed.
Using observed symmetries, the lookup structure size is
reduced allowing a novel direct lookup process for
multiplicative inverses for all 16-bit odd integers to
be obtained from a table of size less than two KBytes.
The 16-bit multiplicative inverse operation is also
applicable for providing a seed inverse for obtaining
32/64-bit multiplicative inverses by one/two iterations
of a known quadratic refinement algorithm.",
acknowledgement = ack-nhfb,
pagecount = "8",
}
@InProceedings{Maughan:2005:HSC,
author = "Douglas Maughan",
title = "Homeland security: cyber security {R\&D} initiatives",
crossref = "Meadows:2005:CPA",
pages = "1--1",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{McGregor:2005:PCK,
author = "John P. McGregor and Ruby B. Lee",
title = "Protecting cryptographic keys and computations via
virtual secure coprocessing",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "16--26",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@InProceedings{Micali:2005:OEC,
author = "Silvio Micali and Chris Peikert and Madhu Sudan and
David A. Wilson",
title = "Optimal Error Correction Against Computationally
Bounded Noise",
crossref = "Kilian:2005:TCS",
pages = "1--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Micciancio:2005:ASS,
author = "Daniele Micciancio and Saurabh Panjwani",
title = "Adaptive Security of Symbolic Encryption",
crossref = "Kilian:2005:TCS",
pages = "169--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Milenkovic:2005:UIB,
author = "Milena Milenkovi{\'c} and Aleksandar Milenkovi{\'c}
and Emil Jovanov",
title = "Using instruction block signatures to counter code
injection attacks",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "108--117",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Book{Mirkovic:2005:IDS,
editor = "Jelena Mirkovic",
title = "{Internet} denial of service: attack and defense
mechanisms",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
pages = "xxii + 372",
year = "2005",
ISBN = "0-13-147573-8 (paperback)",
ISBN-13 = "978-0-13-147573-1 (paperback)",
LCCN = "TK5105.59 .I5455 2004",
bibdate = "Mon Oct 3 18:58:21 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "The Radia Perlman series in computer networking and
security",
URL = "http://www.loc.gov/catdir/toc/ecip0422/2004020335.html",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Internet;
Security measures; Computer crimes; Prevention",
}
@Article{Moffie:2005:AAS,
author = "Micha Moffie and David Kaeli",
title = "{ASM}: application security monitor",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "5",
pages = "21--26",
month = dec,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:41:24 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Book{Mollin:2005:CGS,
author = "Richard A. Mollin",
title = "Codes: the guide to secrecy from ancient to modern
times",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xx + 678",
year = "2005",
ISBN = "1-58488-470-3",
ISBN-13 = "978-1-58488-470-5",
LCCN = "QA76.9.A25 M67 2005",
bibdate = "Sun Dec 13 08:48:25 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0647/2005041403-d.html",
acknowledgement = ack-nhfb,
subject = "computer security; data encryption (computer
science)",
}
@MastersThesis{Moritz:2005:KAE,
author = "Hannes Moritz",
title = "{Kryptoanalyse des Advanced Encryption Standard}.
({German}) [Cryptanalysis of the {Advanced Encryption
Standard}]",
type = "{Diplom-Arbeit}",
school = "Technische Universit{\"a}t Wien",
address = "Wien, Austria",
pages = "iii + 116",
year = "2005",
bibdate = "Wed Sep 28 08:36:15 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
language = "German",
}
@Book{Moyle:2005:CLD,
author = "Ed Moyle and Diana Kelley",
title = "Cryptographic libraries for developers",
publisher = "Charles River Media",
address = "Hingham, MA, USA",
pages = "????",
year = "2005",
ISBN = "1-58450-409-9",
ISBN-13 = "978-1-58450-409-2",
LCCN = "QA76.76.D47 M72 2005",
bibdate = "Fri Dec 9 06:46:15 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0519/2005026626.html",
acknowledgement = ack-nhfb,
subject = "Computer software; Development; Cryptography",
}
@Book{Mrayati:2005:IDB,
editor = "M. Mrayati and Y. Meer Alam and M. H. at-Tayyan",
title = "{Ibn Dunaynir}'s book: Expositive chapters on
cryptanalysis : ({Maqasid} al-fusul al-mutargima an
hall at-targama)",
volume = "4",
publisher = "KFCRIS \& KACST",
address = "Riyadh, Saudi Arabia",
pages = "xii + 189",
year = "2005",
ISBN = "9960-890-44-9",
ISBN-13 = "978-9960-890-44-9",
LCCN = "????",
bibdate = "Thu May 12 06:53:13 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "{Arabic} origins of cryptology",
acknowledgement = ack-nhfb,
keywords = "cryptography / Arab countries / history",
language = "English and Arabic",
}
@InProceedings{Myasnikov:2005:PAB,
author = "Alexei Myasnikov and Vladimir Shpilrain and Alexander
Ushakov",
title = "A Practical Attack on a Braid Group Based
Cryptographic Protocol",
crossref = "Shoup:2005:ACC",
pages = "86--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_6",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Myles:2005:ETS,
author = "Ginger Myles and Christian Collberg and Zachary
Heidepriem and Armand Navabi",
title = "The evaluation of two software watermarking
algorithms",
journal = j-SPE,
volume = "35",
number = "10",
pages = "923--938",
month = aug,
year = "2005",
CODEN = "SPEXBL",
DOI = "https://doi.org/10.1002/spe.657",
ISSN = "0038-0644 (print), 1097-024X (electronic)",
ISSN-L = "0038-0644",
bibdate = "Tue Oct 4 05:39:37 MDT 2005",
bibsource = "http://www.interscience.wiley.com/jpages/0038-0644;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www3.interscience.wiley.com/journalfinder.html",
abstract = "In this paper we analyze the effectiveness of two
different software watermarking algorithms. The first
is an algorithm proposed by Akito Monden et al. and the
second an algorithm proposed by Robert L. Davidson and
Nathan Myhrvold of the Microsoft Corporation. We have
implemented these techniques within the SANDMARK
framework, a system designed to study the effectiveness
of software protection algorithms on Java bytecode. To
the best of our knowledge this is the first
implementation and empirical evaluation of these
algorithms with respect to a set of properties such as
bit-rate, stealth, and resilience to attack. We
demonstrate through the use of the SANDMARK framework
that both of these algorithms have a high bit-rate but
are unstealthy and easy to attack.",
acknowledgement = ack-nhfb,
fjournal = "Software---Practice and Experience",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
onlinedate = "14 Apr 2005",
}
@Book{Naftali:2005:BSS,
author = "Timothy J. Naftali",
title = "Blind spot: the secret history of {American}
counterterrorism",
publisher = "Basic Books",
address = "New York, NY, USA",
pages = "xv + 399",
year = "2005",
ISBN = "0-465-09281-0 (hardcover)",
ISBN-13 = "978-0-465-09281-9 (hardcover)",
LCCN = "HV6432 .N34 2005",
bibdate = "Thu Jan 19 12:26:43 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip057/2005003248.html",
acknowledgement = ack-nhfb,
subject = "terrorism; United States; prevention; history;
government policy",
tableofcontents = "The plot to kill General
Eisenhower\par
Hijacking\par
The lessons of Munich 1972\par
``There's very little we can do''\par
Lull before the storm\par
False start\par
Striking back\par
The silent struggle\par
The new terrorism\par
Clinton versus bin Laden\par
George W. Bush and bin Laden\par
Conclusion: Blindspots and 9/11",
}
@InProceedings{Nagao:2005:UCS,
author = "Waka Nagao and Yoshifumi Manabe and Tatsuaki Okamoto",
title = "A Universally Composable Secure Channel Based on the
{KEM--DEM} Framework",
crossref = "Kilian:2005:TCS",
pages = "426--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Naor:2005:ECH,
author = "Moni Naor and Asaf Nussboim and Eran Tromer",
title = "Efficiently Constructible Huge Graphs That Preserve
First Order Properties of Random Graphs",
crossref = "Kilian:2005:TCS",
pages = "66--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Narayanan:2005:FDA,
author = "Arvind Narayanan and Vitaly Shmatikov",
title = "Fast dictionary attacks on passwords using time-space
tradeoff",
crossref = "Meadows:2005:CPA",
pages = "364--372",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Narayanan:2005:ODG,
author = "Arvind Narayanan and Vitaly Shmatikov",
title = "Obfuscated databases and group privacy",
crossref = "Meadows:2005:CPA",
pages = "102--111",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Nedjah:2005:SHC,
author = "N. Nedjah and L. {de, Macedo, Mourelle}",
title = "Software\slash Hardware Co-Design of Efficient and
Secure Cryptographic Hardware",
journal = j-J-UCS,
volume = "11",
number = "1",
pages = "66--??",
day = "28",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Jul 6 08:14:47 MDT 2005",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_11_1/software_hardware_co_design",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Nenadic:2005:RBC,
author = "A. Nenadic and N. Zhang and B. Cheetham and C. Goble",
title = "{RSA}-based Certified Delivery of {E}-Goods Using
Verifiable and Recoverable Signature Encryption",
journal = j-J-UCS,
volume = "11",
number = "1",
pages = "175--192",
day = "28",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Jul 6 08:14:47 MDT 2005",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_11_1/rsa_based_certified_delivery",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Nenadic:2005:RBV,
author = "Aleksandra Nenadi{\'c} and Ning Zhang and Qi Shi",
title = "{RSA-based Verifiable and Recoverable Encryption of
Signatures} and its application in certified e-mail
delivery",
journal = j-J-COMP-SECUR,
volume = "13",
number = "5",
pages = "757--777",
month = "????",
year = "2005",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2005-13504",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:22:56 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Nguyen:2005:FPL,
author = "P. Nguyen and D. Stehle",
title = "Floating-Point {LLL} Revisited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "3494",
pages = "215--233",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11426639_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Jun 24 14:51:11 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The Lenstra-Lenstra-Lov{\'a}sz lattice basis reduction
algorithm (LLL or $ L^3 $ ) is a very popular tool in
public-key cryptanalysis and in many other fields.
Given an integer $d$-dimensional lattice basis with
vectors of norm less than $B$ in an $n$-dimensional
space, $ L^3 $ outputs a so-called $ L^3 $-reduced
basis in polynomial time $ O(d^5 n \log^3 B) $, using
arithmetic operations on integers of bit-length $ O(d l
o g B) $. This worst-case complexity is problematic for
lattices arising in cryptanalysis where $d$ or/and $
\log B $ are often large. As a result, the original $
L^3 $ is almost never used in practice. Instead, one
applies floating-point variants of $ L^3 $, where the
long-integer arithmetic required by Gram--Schmidt
orthogonalisation (central in $ L^3 $ ) is replaced by
floating-point arithmetic. Unfortunately, this is known
to be unstable in the worst-case: the usual
floating-point $ L^3 $ is not even guaranteed to
terminate, and the output basis may not be $ L^3
$-reduced at all. In this article, we introduce the $
L^2 $ algorithm, a new and natural floating-point
variant of $ L^3 $ which provably outputs $ L^3
$-reduced bases in polynomial time $ O(d^4 n (d + \log
B) \log B) $. This is the first $ L^3 $ algorithm whose
running time (without fast integer arithmetic) provably
grows only quadratically with respect to $ \log B $,
like the well-known Euclidean and Gaussian algorithms,
which it generalizes.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
keywords = "$L^3$; Lattice Reduction; LLL; Public-Key
Cryptanalysis",
}
@Article{Nguyen:2005:PSE,
author = "L. Nguyen and R. Safavi-Naini and K. Kurosawa",
title = "A Provably Secure and Efficient Verifiable Shuffle
based on a Variant of the {Paillier} Cryptosystem",
journal = j-J-UCS,
volume = "11",
number = "6",
pages = "986--1010",
month = "????",
year = "2005",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:40 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_11_6/a_provably_secure_and",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@InProceedings{Nguyen:2005:RBP,
author = "Minh-Huyen Nguyen",
title = "The Relationship Between Password-Authenticated Key
Exchange and Other Cryptographic Primitives",
crossref = "Kilian:2005:TCS",
pages = "457--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Book{Oppliger:2005:CC,
author = "Rolf Oppliger",
title = "Contemporary cryptography",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "xxv + 503",
year = "2005",
ISBN = "1-58053-642-5",
ISBN-13 = "978-1-58053-642-4",
LCCN = "Z103 .O66 2005",
bibdate = "Thu May 12 10:35:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Artech House computer security series",
URL = "http://www.artechhouse.com/Detail.aspx?strIsbn=978-1-58053-642-4",
acknowledgement = ack-nhfb,
subject = "cryptography",
}
@InProceedings{Ostrovsky:2005:PSS,
author = "Rafail Ostrovsky and William E. {Skeith III}",
title = "Private Searching on Streaming Data",
crossref = "Shoup:2005:ACC",
pages = "223--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_14",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@TechReport{Osvik:2005:CAC,
author = "Dag Arne Osvik and Adi Shamir and Eran Tromer",
title = "Cache Attacks and Countermeasures: the Case of {AES}:
(Extended Version)",
type = "Technical report",
institution = "Department of Computer Science and Applied
Mathematics, Weizmann Institute of Science",
address = "Rehovot 76100, Israel",
day = "8",
month = oct,
year = "2005",
bibdate = "Mon Nov 21 09:00:00 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.wisdom.weizmann.ac.il/~tromer/papers/cache.pdf",
abstract = "We describe several software side-channel attacks
based on inter-process leakage through the state of the
CPU's memory cache. This leakage reveals memory access
patterns, which can be used for cryptanalysis of
cryptographic primitives that employ data-dependent
table lookups. The attacks allow an unprivileged
process to attack other processes running in parallel
on the same processor, despite partitioning methods
such as memory protection, sandboxing and
virtualization. Some of our methods require only the
ability to trigger services that perform encryption or
MAC using the unknown key, such as encrypted disk
partitions or secure network links. Moreover, we
demonstrate an extremely strong type of attack, which
requires knowledge of neither the specific plaintexts
nor ciphertexts, and works by merely monitoring the
effect of the cryptographic process on the cache. We
discuss in detail several such attacks on AES, and
experimentally demonstrate their applicability to real
systems, such as OpenSSL and Linux's {\tt dm-crypt}
encrypted partitions (in the latter case, the full key
can be recovered after just 800 writes to the
partition, taking 65 milliseconds). Finally, we
describe several countermeasures which can be used to
mitigate such attacks.",
acknowledgement = ack-nhfb,
}
@Article{Ouellette:2005:PPM,
author = "John Ouellette",
title = "Paranoid penguin: Managing {SSH} for scripts and {{\tt
cron}} jobs",
journal = j-LINUX-J,
volume = "2005",
number = "137",
pages = "13--13",
month = sep,
year = "2005",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:46:11 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Pang:2005:NMS,
author = "Liao-Jun Pang and Yu-Min Wang",
title = "A new $ (t n) $ multi-secret sharing scheme based on
{Shamir}'s secret sharing",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "2",
pages = "840--848",
day = "15",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2004.06.120",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300304005338",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Papanikolaou:2005:BRBa,
author = "Nikolaos Papanikolaou",
title = "Book Review: {{\booktitle{Data Privacy and Security}},
by David Salomon; Spring-Verlag, 2003, \$51.48,
Hardcover}",
journal = j-SIGACT,
volume = "36",
number = "2",
pages = "8--13",
month = jun,
year = "2005",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1067309.1067315",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:27 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact36.html#Papanikolaou05;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Salomon:2003:DPS}.",
URL = "http://doi.acm.org/10.1145/1067309.1067315",
abstract = "The field of cryptology and data security hardly needs
any introduction; numerous popular accounts of the
subject have appeared over the years, and it is already
a core topic in undergraduate computer science. The
very term ``cryptology'' is testimony to the long
history of the field; the term is derived from the
words \kappa \sigma \nu \pi \tau {\'o}s (meaning
hidden), and \lambda {\'o} \gamma os (meaning speech),
which have retained their meaning in the Greek language
for many centuries.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Park:2005:CZA,
author = "Je Hong Park and Bo Gyeong Kang and Jae Woo Han",
title = "Cryptanalysis of {Zhou} et al.'s proxy-protected
signature schemes",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "192--197",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Park:2005:NDS,
author = "Je Hong Park and Seongtaek Chee",
title = "A note on digital signature scheme using a
self-pairing map",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "472--475",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Pass:2005:NIC,
author = "Rafael Pass and Alon Rosen",
title = "New and improved constructions of non-malleable
cryptographic protocols",
crossref = "ACM:2005:SPA",
pages = "533--542",
year = "2005",
bibdate = "Wed Apr 5 05:59:22 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Pass:2005:UCN,
author = "Rafael Pass and abhi shelat",
title = "Unconditional Characterizations of Non-interactive
Zero-Knowledge",
crossref = "Shoup:2005:ACC",
pages = "118--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_8",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
xxnote = "Yes, second author is lowercase name.",
}
@InProceedings{Peng:2005:SES,
author = "Kun Peng and Colin Boyd and Ed Dawson",
title = "Simple and Efficient Shuffling with Provable
Correctness and {ZK} Privacy",
crossref = "Shoup:2005:ACC",
pages = "188--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_12",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@TechReport{Perlman:2005:EMD,
author = "Radia Perlman",
title = "The Ephemerizer: Making Data Disappear",
type = "Technical report",
institution = "Sun Labs",
address = "16 Network Circle, Menlo Park, CA 94025, USA",
pages = "20",
year = "2005",
bibdate = "Mon Mar 28 11:13:11 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.research.sun.com/techrep/2005/smll-tr02005-140.pdf",
abstract = "This paper is about how to keep data for a finite
time, and then make it unrecoverable after that. It is
difficult to ensure that data is completely destroyed.
To be available before expiration it is desirable to
create backup copies. Then absolute deletion becomes
difficult, because even after explicitly deleting it,
copies might remain on backup media, or in swap space,
or be forensically recoverable. The obvious solution is
to store the data encrypted, and then delete the key
after expiration. The key is somewhat easier to manage,
because it is smaller, but there is still the issue of
needing to make the key reliably available for some
time, and then reliably destroyed. It is difficult
enough for a user to manage one key, much less
different keys for different data expiration times. The
user could keep each key on a tamper-proof smart card
with no copies, but then the data will be lost
prematurely if the user loses the smart card. And smart
cards are expensive. So the idea in this paper is to
concentrate all the key management expense and
expertise in one place, a server we call an
``ephemerizer''. The ephemerizer creates keys, makes
them available for encryption, aids in decryption, and
destroys the keys at the appropriate time. The design
in this paper ensure that even if a client's machine
gets compromised, and everything in stable storage
(including long term user keys) is stolen, any data
that has expired before the compromise remains
unrecoverable.\par
The paper starts with a description of an existing
commercial scheme, and presents improvements to that
scheme to eliminate the necessity for per-message
state. Then it presents a new approach, based on public
keys, and presents an initial design, and then a more
efficient version using a new concept closely related
to blind signatures, that we call ``blind
decryption''.",
acknowledgement = ack-nhfb,
}
@Article{Perry:2005:DCP,
author = "Tekla S. Perry",
title = "{DVD} copy protection: take 2",
journal = j-IEEE-SPECTRUM,
volume = "42",
number = "1",
pages = "38--39",
month = jan,
year = "2005",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2005.1377873",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "advanced access content system; Advanced Encryption
Standards; Cascading style sheets; copy protection;
cryptography; Decoding; digital versatile discs; DVD;
DVD copy protection; Hardware; Law; Legal factors;
Manufacturing; Motion pictures; optical disc; Portable
computers; portable video player; Protection; video
discs; video server",
}
@Article{Petullo:2005:EYR,
author = "Mike Petullo",
title = "Encrypt your root filesystem",
journal = j-LINUX-J,
volume = "2005",
number = "129",
pages = "4--4",
month = jan,
year = "2005",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:46:03 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Phatak:2005:FMR,
author = "Dhananjay Phatak and Tom Goff",
title = "Fast Modular Reduction for Large Wordlengths via One
Linear and One Cyclic Convolution",
crossref = "IEEE:2005:PIS",
pages = "??--??",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://arith17.polito.it/final/paper-156.pdf",
abstract = "Modular reduction is a fundamental operation in
cryptographic systems. Most well known modular
reduction methods including Barrett's and Montgomery's
algorithms leverage some-pre computations to avoid
divisions so that the main complexity of these methods
lies in a sequence of two long multiplications. For
large wordlengths a multiplication which is tantamount
to a linear convolution is performed via the Fast
Fourier Transform (FFT) or other transform-based
techniques as in the Schonhage-Strassen multiplication
algorithm.\par
We show a fundamental property (the separation
principle): in a modular reduction based on long
multiplications, the linear convolution required by one
of the two long multiplications can be replaced by a
cyclic convolution, and the halves can be separated
using other information available due to the intrinsic
redundancy of the operations. This reduces the number
of operations by about 25\%. We demonstrate that both
Barrett's and Montgomery's methods can be sped up by
using the aforementioned fundamental principle. It is
shown that a direct application of this algorithm to
modular exponentiation (either using Barrett's or
Montgomery's methods) can be expected to yield about
17\% speedup.",
acknowledgement = ack-nhfb,
keywords = "cryptography; cyclic convolution; elliptic-curve; fast
modular reduction; FFT multiply; large wordlength;
linear convolution; number theoretic transforms;
principle of separation",
pagecount = "8",
}
@InProceedings{Pietrzak:2005:CDI,
author = "Krzysztof Pietrzak",
title = "Composition Does Not Imply Adaptive Security",
crossref = "Shoup:2005:ACC",
pages = "55--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_4",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Piva:2005:SRA,
author = "Alessandro Piva and Franco Bartolini and Roberto
Caldelli",
title = "Self Recovery Authentication of Images in the {DWT}
Domain",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "149--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Pon:2005:MDS,
author = "Shun-Fu Pon and Erl-Huei Lu and Albert B. Jeng",
title = "{Meta-He} digital signatures based on factoring and
discrete logarithms",
journal = j-APPL-MATH-COMP,
volume = "165",
number = "1",
pages = "171--176",
day = "6",
month = jun,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Pon:2005:OPK,
author = "Shun-Fu Pon and Erl-Huei Lu and Albert B. Jeng",
title = "One private-key for all {DL}-based cryptosystems",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "666--672",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Potter:2005:QCS,
author = "Bruce Potter",
title = "Quantum crypto: Star trek or real science?",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "7",
pages = "4--5",
month = jul,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)70257-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:16 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485805702579",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Prabhakaran:2005:RES,
author = "Manoj Prabhakaran and Amit Sahai",
title = "Relaxing Environmental Security: Monitored
Functionalities and Client-Server Computation",
crossref = "Kilian:2005:TCS",
pages = "104--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@Article{Qian:2005:CLT,
author = "Haifeng Qian and ZhenFu Cao and Haiyong Bao",
title = "Cryptanalysis of {Li--Tzeng--Hwang}'s improved
signature schemes based on factoring and discrete
logarithms",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "3",
pages = "501--505",
day = "26",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Qian:2005:SPL,
author = "Haifeng Qian and Zhenfu Cao and Haiyong Bao",
title = "Security of {Pon--Lu--Jeng}'s {Meta-He} digital
signature schemes",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "724--730",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Quisquater:2005:SCC,
author = "Micha{\"e}l Quisquater and Bart Preneel and Joos
Vandewalle",
title = "Spectral characterization of cryptographic {Boolean}
functions satisfying the (extended) propagation
criterion of degree $l$ and order $k$",
journal = j-INFO-PROC-LETT,
volume = "93",
number = "1",
pages = "25--28",
day = "16",
month = jan,
year = "2005",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:40:58 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Regev:2005:LLE,
author = "Oded Regev",
title = "On lattices, learning with errors, random linear
codes, and cryptography",
crossref = "ACM:2005:SPA",
pages = "84--93",
year = "2005",
bibdate = "Wed Apr 5 05:59:22 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Renner:2005:UCP,
author = "Renato Renner and Robert K{\"o}nig",
title = "Universally Composable Privacy Amplification Against
Quantum Adversaries",
crossref = "Kilian:2005:TCS",
pages = "407--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Ringenburg:2005:PFS,
author = "Michael F. Ringenburg and Dan Grossman",
title = "Preventing format-string attacks via automatic and
efficient dynamic checking",
crossref = "Meadows:2005:CPA",
pages = "354--363",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Rittinghouse:2005:IIM,
author = "John Rittinghouse and James Ransome",
title = "{IM Instant Messaging} Security",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
pages = "432 (est.)",
year = "2005",
ISBN = "1-55558-338-5",
ISBN-13 = "978-1-55558-338-5",
LCCN = "????",
bibdate = "Mon Oct 03 19:10:50 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://books.elsevier.com/us/mk/us/subindex.asp?isbn=1555583385",
acknowledgement = ack-nhfb,
}
@Article{Rogers:2005:MPH,
author = "Brian Rogers and Yan Solihin and Milos Prvulovic",
title = "Memory predecryption: hiding the latency overhead of
memory encryption",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "27--33",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
remark = "Workshop on Architectural Support for Security and
Anti-Virus (WASSA)",
}
@Book{Rogers:2005:NSE,
editor = "Russ Rogers and Bryan Cunningham",
title = "Network security evaluation using the {NSA IEM}",
publisher = pub-SYNGRESS,
address = pub-SYNGRESS:adr,
pages = "xxvi + 437",
year = "2005",
ISBN = "1-59749-035-0",
ISBN-13 = "978-1-59749-035-1",
LCCN = "TK5105.59 .N33 2005",
bibdate = "Thu Oct 6 07:25:29 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
remark = "Security Horizon. Network security evaluation using
the National Security Agency INFOSEC evaluation
methodology.",
subject = "Computer networks; Security measures; Evaluation,;
Computer security; Evaluation; Information resources
management; Evaluation",
}
@Book{Rothe:2005:CTC,
author = "J{\"o}rg Rothe",
title = "Complexity Theory and Cryptology: an Introduction to
Cryptocomplexity",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 478",
year = "2005",
ISBN = "3-540-22147-6, 3-540-28520-2 (e-book)",
ISBN-13 = "978-3-540-22147-0, 978-3-540-28520-5 (e-book)",
LCCN = "QA76.9.A25 R672 2005",
bibdate = "Fri Mar 23 10:26:29 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Texts in theoretical computer science: an EATCS
series",
URL = "http://www.myilibrary.com?id=133022;
http://www.springerlink.com/openurl.asp?genre=book\%26isbn=978-3-540-22147-0",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; Computational
complexity",
tableofcontents = "Introduction to cryptocomplexity \\
Foundations of computer science and mathematics \\
Foundations of complexity theory \\
Foundations of cryptology \\
Hierarchies based on NP \\
Randomized algorithms and complexity classes \\
RSA cryptosystem, primality, and factoring \\
Other public-key cryptosystems and protocols",
}
@InProceedings{Rubin:2005:ARS,
author = "Shai Rubin and Mihai Christodorescu and Vinod
Ganapathy and Jonathon T. Giffin and Louis Kruger and
Hao Wang and Nicholas Kidd",
title = "An auctioning reputation system based on anomaly",
crossref = "Meadows:2005:CPA",
pages = "270--279",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ryabko:2005:NTA,
author = "B. Y. Ryabko and V. A. Monarev and Y. I. Shokin",
title = "A New Type of Attack on Block Ciphers",
journal = j-PROBL-INF-TRANSM,
volume = "41",
number = "4",
pages = "385--394",
month = "????",
year = "2005",
CODEN = "PRITA9",
ISSN = "0032-9460 (print), 1608-3253 (electronic)",
ISSN-L = "0032-9460",
bibdate = "Fri Mar 09 12:26:31 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "Problems of Information Transmission",
}
@Article{Sale:2005:RCB,
author = "Anthony E. Sale",
title = "The Rebuilding of {Colossus} at {Bletchley Park}",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "27",
number = "3",
pages = "61--69",
month = jul # "\slash " # sep,
year = "2005",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2005.47",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Mon Nov 7 18:51:49 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Sallee:2005:MBM,
author = "Phil Sallee",
title = "Model-Based Methods for Steganography and
Steganalysis",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "167--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Book{Salomon:2005:CDC,
author = "David Salomon",
title = "Coding for data and computer communications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 548",
year = "2005",
ISBN = "0-387-21245-0",
ISBN-13 = "978-0-387-21245-6",
LCCN = "TK5102.94 .S35 2005",
bibdate = "Mon Apr 25 16:20:33 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.DavidSalomon.name/Codes/Codes.html;
http://www.ecs.csun.edu/~dsalomon/",
acknowledgement = ack-nhfb,
subject = "Telecommunication systems; Coding theory;
Cryptography",
tableofcontents = "Preface vii \\
\\
Part I: Channel Coding 1 \\
\\
1 Error-Control Codes 3 \\
2 Check Digits for Error Detection 35 \\
\\
Part II: Source Codes 59 \\
\\
3 Statistical Methods 67 \\
4 Dictionary Methods 111 \\
5 Image Compression 133 \\
\\
Part III: Secure Codes 197 \\
\\
6 Basic Concepts 199 \\
7 Monoalphabetic Substitution Ciphers 213 \\
8 Transposition Ciphers 227 \\
9 Polyalphabetic Substitution Ciphers 243 \\
10 Stream Ciphers 269 \\
11 Block Ciphers 289 \\
12 Public-Key Cryptography 311 \\
13 Data Hiding 341 \\
14 Data Hiding in Images 365 \\
15 Data Hiding: Other Methods 417 \\
\\
Part IV: Essential Resources 445 \\
\\
Appendixes \\
\\
A Symmetry Groups 447 \\
B Galois Fields 451 \\
B.1 Field Definitions and Operations 451 \\
B.2 Polynomial Arithmetic 459 \\
C Cyclic Redundancy Codes 461 \\
D Projects 465 \\
\\
Answers to Exercises 471 \\
\\
Glossary 503 \\
\\
Bibliography 523 \\
\\
Index 533",
}
@Book{Salomon:2005:FCS,
author = "David Salomon",
title = "Foundations of computer security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxi + 368",
year = "2005",
ISBN = "1-84628-193-8, 1-84628-341-8",
ISBN-13 = "978-1-84628-193-8, 978-1-84628-341-3",
LCCN = "QA76.9.A25 S2656 2005",
bibdate = "Sat Jan 7 09:42:09 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.springer.com/sgw/cda/frontpage/0,11855,4-40007-22-65173048-0,00.html;
http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166687-p65173048,00.pdf;
http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166688-p65173048,00.pdf;
http://www.springer.com/sgw/cda/pageitems/document/cda_downloaddocument/0,11855,0-0-45-166689-p65173048,00.pdf",
acknowledgement = ack-nhfb,
keywords = "authentication; computer security; cryptography;
encryption; firewalls; identity theft; malware;
physical security; spyware; trojan horses; viruses;
worms",
publishersummary = "Anyone with a computer has heard of viruses, had
to deal with several, and has been struggling with
spam, spyware, and disk crashes. This book is intended
as a starting point for those familiar with basic
concepts of computers and computations and who would
like to extend their knowledge into the realm of
computer and network security. Its comprehensive
treatment of all the major areas of computer security
aims to give readers a complete foundation in the field
of Computer Security. Exercises are given throughout
the book and are intended to strengthening the reader?s
knowledge - answers are also provided.\par
Written in a clear, easy to understand style, aimed
towards advanced undergraduates and non-experts who
want to know about the security problems confronting
them everyday. The technical level of the book is low
and requires no mathematics, and only a basic concept
of computers and computations. Foundations of Computer
Security will be an invaluable tool for students and
professionals alike.",
}
@Article{Santini:2005:WSI,
author = "Simone Santini",
title = "We Are Sorry to Inform You \ldots{}",
journal = j-COMPUTER,
volume = "38",
number = "12",
pages = "128, 126--127",
month = dec,
year = "2005",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2005.423",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:16:19 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/shannon-claude-elwood.bib;
https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/computer2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/computer",
remark = "With a byline of `How much damage could be caused by a
peer reviewer having a bad day?', this article is an
amusing collection of spoofed referee reports that
might have been written to reject some of the most
famous papers in computer science: E. W. Dijkstra,
\booktitle{Goto Statement Considered Harmful}; E. F.
Codd, \booktitle{A Relational Model of Data for Large
Shared Data Banks}; A. Turing, \booktitle{On Computable
Numbers, with an Application to the
Entscheidungsproblem}; C. E. Shannon, \booktitle{A
Mathematical Theory of Communication}; C. A. R. Hoare,
\booktitle{An Axiomatic Basis for Computer
Programming}; R. L. Rivest, A. Shamir, and L. Adelman,
\booktitle{A Method for Obtaining Digital Signatures
and Public-Key Cryptosystems}.",
}
@Article{Savage:2005:IPWa,
author = "P. R. Savage",
title = "Invention: Patent Watch",
journal = j-IEEE-SPECTRUM,
volume = "42",
number = "1",
pages = "70--71",
month = jan,
year = "2005",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2005.1377882",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computer displays; Computer science; Cryptography;
Design engineering; Humans; Laser theory; Physics;
Power engineering and energy; Resource management;
Watches",
}
@Article{Savage:2005:IPWb,
author = "P. R. Savage",
title = "Inventions: Patent Watch",
journal = j-IEEE-SPECTRUM,
volume = "42",
number = "3",
pages = "64--64",
month = mar,
year = "2005",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2005.1402723",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Electronic mail; Patents; Radiofrequency
identification; RFID tags; Technological innovation;
TV; Watches; Wireless networks",
}
@Article{Schielzeth:2005:RQN,
author = "Daniel Schielzeth and Michael E. Pohst",
title = "On Real Quadratic Number Fields Suitable for
Cryptography",
journal = j-EXP-MATH,
volume = "14",
number = "2",
pages = "189--197",
month = "????",
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1080/10586458.2005.10128914",
ISSN = "1058-6458 (print), 1944-950X (electronic)",
ISSN-L = "1058-6458",
bibdate = "Mon Mar 5 15:33:58 MST 2012",
bibsource = "http://projecteuclid.org/euclid.em;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/expmath.bib;
http://www.tandfonline.com/toc/uexm20/14/2",
URL = "http://projecteuclid.org/euclid.em/1128100131",
acknowledgement = ack-nhfb,
fjournal = "Experimental Mathematics",
journal-URL = "http://www.tandfonline.com/loi/uexm20",
onlinedate = "30 Jan 2011",
}
@Article{Schneier:2005:AE,
author = "B. Schneier",
title = "Authentication and Expiration",
journal = j-IEEE-SEC-PRIV,
volume = "3",
number = "1",
pages = "88--88",
month = jan # "/" # feb,
year = "2005",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2005.4",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Jul 26 18:29:12 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8013/30310/01392710.pdf;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=30310&arnumber=1392710&count=17&index=16",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Schneier:2005:TFA,
author = "Bruce Schneier",
title = "Two-factor authentication: too little, too late",
journal = j-CACM,
volume = "48",
number = "4",
pages = "136--136",
month = apr,
year = "2005",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Mar 24 16:07:27 MST 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Seacord:2005:SCC,
author = "Robert C. Seacord",
title = "Secure coding in {C} and {C++}",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxiv + 341",
year = "2005",
ISBN = "0-321-33572-4 (paperback)",
ISBN-13 = "978-0-321-33572-2 (paperback)",
LCCN = "QA76.9.A25 S368 2005",
bibdate = "Thu Aug 31 10:52:01 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.cert.org/books/secure-coding/;
http://www.loc.gov/catdir/toc/ecip0513/2005015012.html",
acknowledgement = ack-nhfb,
subject = "Computer security; C (Computer program language); C++
(Computer program language)",
tableofcontents = "Contents \\
Preface ix \\
1 Running with Scissors 1 \\
1.1 Gauging the Threat 4 \\
1.2 Security Concepts 9 \\
1.3 C and C++ 14 \\
1.4 Development Platforms 17 \\
1.5 Summary 21 \\
1.6 For Further Reading 21 \\
2 Strings 23 \\
2.1 String Characteristics 23 \\
2.2 Common String Manipulation Errors 24 \\
2.3 String Vulnerabilities 30 \\
2.4 Process Memory Organization 33 \\
2.5 Stack Smashing 37 \\
2.6 Code Injection 42 \\
2.7 Arc Injection 45 \\
2.8 Mitigation Strategies 48 \\
2.9 Notable Vulnerabilities 66 \\
2.10 Summary 68 \\
2.11 For Further Reading 70 \\
3 Pointer Subterfuge 71 \\
3.1 Data Locations 72 \\
3.2 Function Pointers 73 \\
3.3 Data Pointers 74 \\
3.4 Modifying the Instruction Pointer 75 \\
3.5 Global Offset Table 76 \\
3.6 The .dtors Section 78 \\
3.7 Virtual Pointers 80 \\
3.8 The atexit() and on_exit() Functions 82 \\
3.9 The longjmp() Function 84 \\
3.10 Exception Handling 85 \\
3.11 Mitigation Strategies 89 \\
3.12 Summary 89 \\
3.13 For Further Reading 90 \\
4 Dynamic Memory Management 91 \\
4.1 Dynamic Memory Management 92 \\
4.2 Common Dynamic Memory Management Errors 94 \\
4.3 Doug Lea's Memory Allocator 100 \\
4.4 RtlHeap 113 \\
4.5 Mitigation Strategies 129 \\
4.6 Notable Vulnerabilities 138 \\
4.7 Summary 140 \\
4.8 For Further Reading 141 \\
5 Integer Security 143 \\
5.1 Integers 144 \\
5.2 Integer Conversions 151 \\
5.3 Integer Error Conditions 156 \\
5.4 Integer Operations 159 \\
5.5 Vulnerabilities 172 \\
5.6 Non-Exceptional Integer Logic Errors 177 \\
5.7 Mitigation Strategies 178 \\
5.8 Notable Vulnerabilities 187 \\
5.9 Summary 190 \\
5.10 For Further Reading 191 \\
6 Formatted Output 193 \\
6.1 Variadic Functions 194 \\
6.2 Formatted Output Functions 198 \\
6.3 Exploiting Formatted Output Functions 203 \\
6.4 Stack Randomization 214 \\
6.5 Mitigation Strategies 220 \\
6.6 Notable Vulnerabilities 230 \\
6.7 Summary 231 \\
6.8 For Further Reading 233 \\
7 File I/O 235 \\
7.1 Concurrency 235 \\
7.2 Time of Check, Time of Use 238 \\
7.3 Files as Locks and File Locking 240 \\
7.4 File System Exploits 242 \\
7.5 Mitigation Strategies 249 \\
7.6 Summary 259 \\
8 Recommended Practices 261 \\
8.1 Secure Software Development Principles 263 \\
8.2 Systems Quality Requirements Engineering 267 \\
8.3 Threat Modeling 269 \\
8.4 Use/Misuse Cases 270 \\
8.5 Architecture and Design 271 \\
8.6 Off-the-Shelf Software 273 \\
8.7 Compiler Checks 275 \\
8.8 Input Validation 275 \\
8.9 Data Sanitization 277 \\
8.10 Static Analysis 280 \\
8.11 Quality Assurance 283 \\
8.12 Memory Permissions 286 \\
8.13 Defense in Depth 288 \\
8.14 TSP-Secure 289 \\
8.15 Summary 292 \\
8.16 Further Reading 292",
}
@Book{Sebag-Montefiore:2005:EBC,
author = "Hugh Sebag-Montefiore",
title = "{Enigma}: the battle for the code",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "352 + 16",
year = "2005",
ISBN = "0-471-49035-0",
ISBN-13 = "978-0-471-49035-7",
LCCN = "????",
bibdate = "Tue Sep 4 05:57:38 MDT 2012",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
subject = "World War, 1939--1945; Electronic intelligence; Great
Britain; Cryptography; Secret service",
}
@InProceedings{Seifert:2005:ACR,
author = "Jean-Pierre Seifert",
title = "On authenticated computing and {RSA}-based
authentication",
crossref = "Meadows:2005:CPA",
pages = "122--127",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Shao:2005:CXY,
author = "Zuhua Shao",
title = "Cryptanalysis of {Xia--You} group signature scheme",
journal = j-J-SYST-SOFTW,
volume = "75",
number = "1--2",
pages = "89--94",
day = "15",
month = feb,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:27 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Shao:2005:IEP,
author = "Zuhua Shao",
title = "Improvement of efficient proxy signature schemes using
self-certified public keys",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "222--234",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shao:2005:NEV,
author = "Jun Shao and Zhenfu Cao",
title = "A new efficient $ (t n) $ verifiable multi-secret
sharing {(VMSS)} based on {YCH} scheme",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "135--140",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
DOI = "https://doi.org/10.1016/j.amc.2004.08.023",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/applmathcomput2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
URL = "http://www.sciencedirect.com/science/article/pii/S0096300304005922",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shao:2005:NKA,
author = "Zuhua Shao",
title = "A new key authentication scheme for cryptosystems
based on discrete logarithms",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "143--152",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shao:2005:SMD,
author = "Zuhua Shao",
title = "Security of {Meta-He} digital signature scheme based
on factoring and discrete logarithms",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "976--984",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Shehab:2005:SCM,
author = "Mohamed Shehab and Elisa Bertino and Arif Ghafoor",
title = "Secure collaboration in mediator-free environments",
crossref = "Meadows:2005:CPA",
pages = "58--67",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Shen:2005:NCB,
author = "Victor R. L. Shen and Tzer-Shyong Chen and Kai-Quan
Shai",
title = "A novel cryptosystem based on grey system theory and
genetic algorithm",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "1290--1302",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shen:2005:NIW,
author = "Rui-min Shen and Yong-gang Fu and Hong-tao Lu",
title = "A novel image watermarking scheme based on support
vector regression",
journal = j-J-SYST-SOFTW,
volume = "78",
number = "1",
pages = "1--8",
month = oct,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Sherwood:2005:MTR,
author = "Rob Sherwood and Bobby Bhattacharjee and Ryan Braud",
title = "Misbehaving {TCP} receivers can cause {Internet}-wide
congestion collapse",
crossref = "Meadows:2005:CPA",
pages = "383--392",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Shi:2005:HEC,
author = "Weidong Shi and Hsien-Hsin S. Lee and Mrinmoy Ghosh
and Chenghuai Lu and Alexandra Boldyreva",
title = "High Efficiency Counter Mode Security Architecture via
Prediction and Precomputation",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "2",
pages = "14--24",
month = may,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Shim:2005:LPG,
author = "Kyungah Shim",
title = "Off-line password-guessing attacks on the generalized
key agreement and password authentication protocol",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "511--515",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shim:2005:SFA,
author = "Kyungah Shim and Young-Ran Lee",
title = "Security flaws in authentication and key establishment
protocols for mobile communications",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "62--74",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shim:2005:WIB,
author = "Kyungah Shim and Sungsik Woo",
title = "Weakness in {ID}-based one round authenticated
tripartite multiple-key agreement protocol with
pairings",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "3",
pages = "523--530",
day = "26",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Shirase:2005:AEC,
author = "Masaaki Shirase and Yasushi Hibino",
title = "An architecture for elliptic curve cryptography
computation",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "124--133",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Book{Shoup:2005:CIN,
author = "Victor Shoup",
title = "A computational introduction to number theory and
algebra",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xvi + 517",
year = "2005",
ISBN = "0-521-85154-8 (hardcover), 0-521-61725-1 (paperback)",
ISBN-13 = "978-0-521-85154-1 (hardcover), 978-0-521-61725-3
(paperback)",
LCCN = "QA241 .V53 2005",
bibdate = "Mon Sep 19 08:51:00 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
subject = "computer science; mathematics; number theory;
cryptography; error-correcting codes",
}
@InProceedings{Shparlinski:2005:PHS,
author = "Igor E. Shparlinski",
title = "Playing ``hide-and-seek'' with numbers: the hidden
number problem, lattices, and exponential sums",
crossref = "Garrett:2005:PKC",
pages = "153--177",
year = "2005",
MRclass = "11T23 (11H71 11T71 68P25 94A60)",
MRnumber = "2211876 (2007c:11142)",
MRreviewer = "Igor Wigman",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Silverman:2005:ECC,
author = "Joseph H. Silverman",
title = "Elliptic curves and cryptography",
crossref = "Garrett:2005:PKC",
pages = "91--112",
year = "2005",
MRclass = "14G50 (94A60)",
MRnumber = "2211873 (2006m:14034)",
MRreviewer = "Annegret Weng",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Six:2005:HGS,
author = "J. M. Six",
title = "Hidden gems [science and technology museums]",
journal = j-IEEE-SPECTRUM,
volume = "42",
number = "1",
pages = "70--71",
month = jan,
year = "2005",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2005.1377881",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Computer displays; Computer science; Cryptography;
Design engineering; Engineering management;
exhibitions; history; Humans; IEEE Spectrum; Laser
theory; Physics; Power engineering and energy; Resource
management; reviews; science and technology museums",
}
@Article{Sklavos:2005:ISH,
author = "N. Sklavos and O. Koufopavlou",
title = "Implementation of the {SHA-2} Hash Family Standard
Using {FPGAs}",
journal = j-J-SUPERCOMPUTING,
volume = "31",
number = "3",
pages = "227--248",
month = mar,
year = "2005",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-005-0086-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 6 10:36:20 MDT 2005",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=31&issue=3;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=31&issue=3&spage=227",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
}
@InProceedings{Song:2005:ISG,
author = "Lin Song and Biao Wang and Dequan He",
title = "An Improved Scheme for Group Signature",
crossref = "Han:2005:PJI",
pages = "96--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Srivatsa:2005:SPS,
author = "Mudhakar Srivatsa and Ling Liu",
title = "Securing publish-subscribe overlay services with
{EventGuard}",
crossref = "Meadows:2005:CPA",
pages = "289--298",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Stanik:2005:NLO,
author = "John Stanik",
title = "News 2.0: Losing our Edge? The Real Cost of {Linux};
Say No to Crackberries",
journal = j-QUEUE,
volume = "3",
number = "5",
pages = "14--14",
month = jun,
year = "2005",
CODEN = "AQCUAE",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Mon Aug 1 06:01:27 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@InProceedings{Stavrou:2005:CAS,
author = "Angelos Stavrou and Angelos D. Keromytis",
title = "Countering {DoS} attacks with stateless multipath
overlays",
crossref = "Meadows:2005:CPA",
pages = "249--259",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Steele:2005:PPT,
author = "Corey Steele",
title = "Paranoid penguin: Two-factor authentication",
journal = j-LINUX-J,
volume = "2005",
number = "139",
pages = "10--10",
month = nov,
year = "2005",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:46:12 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@TechReport{Steil:2005:MMM,
author = "Michael Steil",
title = "17 Mistakes {Microsoft} Made in the {Xbox} Security
System",
type = "Report",
institution = "Xbox Linux Project",
pages = "13",
month = dec,
year = "2005",
bibdate = "Fri Jan 31 08:12:04 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
URL = "http://events.ccc.de/congress/2005/fahrplan/attachments/591-paper_xbox.pdf",
acknowledgement = ack-nhfb,
keywords = "Microsoft; Northbridge; RC4; RC5; Southbridge; TEA;
virtual machine; Xbox gaming console; Xbox Linux
Project",
}
@Article{Stephanides:2005:GAK,
author = "George Stephanides and Nicolae Constantinescu",
title = "The {GN}-authenticated key agreement",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "531--544",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Stern:2005:MLF,
author = "Richard H. Stern",
title = "Micro Law: {FTC} cracks down on spyware and {PC}
hijacking, but not true lies",
journal = j-IEEE-MICRO,
volume = "25",
number = "1",
pages = "6--7, 100--101",
month = jan # "\slash " # feb,
year = "2005",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2005.11",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Wed Apr 20 08:11:28 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/dl/mags/mi/2005/01/m1006.htm;
http://csdl.computer.org/dl/mags/mi/2005/01/m1006.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
}
@Article{Stevenson:2005:SCI,
author = "Daniel E. Stevenson and Michael R. Wick and Steven J.
Ratering",
title = "Steganography and cartography: interesting assignments
that reinforce machine representation, bit
manipulation, and discrete structures concepts",
journal = j-SIGCSE,
volume = "37",
number = "1",
pages = "277--281",
month = mar,
year = "2005",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1047124.1047443",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:13 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "Today's generation of students crave assignments that
are relevant to their world, both in terms of graphical
interfaces and, more importantly, the application area.
To be fully engaged they must find the application of
importance. However, we have found that many
assignments in computer science attempt to engage the
students by moving further and further away from the
underlying machine representations. This causes a
disconnect between the applications our students write
and the material we present on machine representations
and architecture. We present examples of assignments
based from the fields of Steganography and Cartography
that we have found to be valuable in helping to
reinforce the importance of machine representations
with today's students. We found that the students were
excited and intrigued to see how their discipline could
play a vital role in the war on terrorism and how what
they were learning in their CS 1 course was directly
relevant to what they heard on the nightly news and
experience on a daily basis via the Internet.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InProceedings{Stoklosa:2005:CIC,
author = "Janusz Stoklosa and Jaroslaw Bubicz",
editor = "Hamid R. Arabnia and Liwen He and Youngsong Mun",
booktitle = "{Proceedings of the 2005 International Conference on
Security and Management, SAM '05: Las Vegas, Nevada,
USA, June 20-23, 2005}",
title = "Compound inversive congruential generator as a source
of keys for stream ciphers",
publisher = "CSREA Press",
address = "Las Vegas, NV, USA",
bookpages = "528",
pages = "473--478",
year = "2005",
ISBN = "1-932415-82-3",
ISBN-13 = "978-1-932415-82-7",
LCCN = "TK5105.59 .I57 2005",
bibdate = "Mon Mar 5 22:02:35 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/conf/csreaSAM/csreaSAM2005.html#StoklosaB05;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
}
@Article{Stuck:2005:HVC,
author = "B. Stuck and M. Weingarten",
title = "How venture capital thwarts innovation",
journal = j-IEEE-SPECTRUM,
volume = "42",
number = "4",
pages = "50--55",
month = apr,
year = "2005",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2005.1413731",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; e-commerce business models; Explosions;
innovation management; Internet; Investments; Lucent
Technologies Inc.; Microcomputers; organizational
structures; Research and development; Search engines;
Silicon; Surface acoustic waves; Technological
innovation; VC-funded start-ups; venture capital;
Venture capital",
}
@Article{Su:2005:IBT,
author = "Pin-Chang Su and Henry Ker-Chang Chang and Erl-Huei
Lu",
title = "{ID}-based threshold digital signature schemes on the
elliptic curve discrete logarithm problem",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "3",
pages = "757--772",
day = "25",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Su:2005:KPK,
author = "Pin-Chang Su and Erl-Huei Lu and Henry Ker-Chang
Chang",
title = "A knapsack public-key cryptosystem based on elliptic
curve discrete logarithm",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "40--46",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Sucurovic:2005:JCX,
author = "S. Sucurovic and Z. Jovanovic",
title = "{Java} Cryptography \& {X.509} Authentication",
journal = j-DDJ,
volume = "30",
number = "2",
pages = "40--42",
year = "2005",
CODEN = "DDJOEB",
ISSN = "1044-789X",
bibdate = "Thu Mar 24 17:43:34 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
Ingenta database",
acknowledgement = ack-nhfb,
fjournal = "Dr. Dobb's Journal of Software Tools",
}
@Article{Sullivan:2005:CFI,
author = "Roger K. Sullivan",
title = "The case for federated identity",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "9",
pages = "15--19",
month = sep,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)70283-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:18 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580570283X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Sun:2005:CCL,
author = "Da-Zhi Sun and Zhen-Fu Cao and Yu Sun",
title = "Comment: cryptanalysis of {Lee--Hwang--Li}'s key
authentication scheme",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "3",
pages = "675--678",
day = "25",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
note = "See \cite{Zhang:2005:CLH}.",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Sun:2005:CSS,
author = "Qibin Sun and Shuiming Ye and Ching-Yung Lin and
Shih-Fu Chang",
title = "A Crypto Signature Scheme for Image Authentication
over Wireless Channel",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "135--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Sun:2005:IPK,
author = "Da-Zhi Sun and Zhen-Fu Cao",
title = "Improved public key authentication scheme for
non-repudiation",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "2",
pages = "927--932",
day = "15",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Sun:2005:RNK,
author = "Da-Zhi Sun and Zhen-Fu Cao and Yu Sun",
title = "Remarks on a new key authentication scheme based on
discrete logarithms",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "572--575",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Sun:2005:SSP,
author = "Hung-Min Sun and Bin-Tsan Hsieh and Shin-Mu Tseng",
title = "On the security of some proxy blind signature
schemes",
journal = j-J-SYST-SOFTW,
volume = "74",
number = "3",
pages = "297--302",
day = "1",
month = feb,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:26 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Sun:2005:UMS,
author = "Qibin Sun",
title = "Understanding Multimedia Security",
journal = j-IEEE-MULTIMEDIA,
volume = "12",
number = "4",
pages = "88--89",
month = oct # "\slash " # dec,
year = "2005",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2005.85",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Nov 10 07:41:20 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/mu/2005/04/u4088.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE MultiMedia",
}
@Article{Sun:2005:WIW,
author = "Da-Zhi Sun and Ji-Dong Zhong and Yu Sun",
title = "Weakness and improvement on {Wang--Li--Tie}'s
user-friendly remote authentication scheme",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "1185--1193",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Swire:2005:SMI,
author = "Peter P. Swire",
title = "Security market: incentives for disclosure of
vulnerabilities",
crossref = "Meadows:2005:CPA",
pages = "405--405",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Tattersall:2005:ENT,
author = "James J. (James Joseph) Tattersall",
title = "Elementary number theory in nine chapters",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
edition = "Second",
pages = "xi + 430",
year = "2005",
ISBN = "0-521-85014-2 (hardcover), 0-521-61524-0 (paperback),
0-511-75634-8 (e-book)",
ISBN-13 = "978-0-521-85014-8 (hardcover), 978-0-521-61524-2
(paperback), 978-0-511-75634-4 (e-book)",
LCCN = "????",
bibdate = "Tue Sep 20 18:43:26 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.ox.ac.uk:210/ADVANCE",
acknowledgement = ack-nhfb,
remark = "Previous edition 1999.",
subject = "Number theory",
tableofcontents = "Frontmatter: i--v \\
Contents: vi--viii \\
Preface: ix--xii \\
1: The intriguing natural numbers: 1--54 \\
2: Divisibility: 55--86 \\
3: Prime numbers: 87--135 \\
4: Perfect and amicable numbers: 136--160 \\
5: Modular arithmetic: 161--195 \\
6: Congruences of higher degree: 196--225 \\
7: Cryptology: 226--257 \\
8: Representations: 258--303 \\
9: Partitions: 304--325 \\
Tables: 326--335 \\
Answers to selected exercises: 336--410 \\
Bibliography: 411--420 \\
Index: 421--430",
}
@InProceedings{Tian:2005:NDF,
author = "Junfeng Tian and Weidong Zhao and Ruizhong Du and Zhe
Zhang",
title = "A New Data Fusion Model of Intrusion
Detection---{IDSFM}",
crossref = "Han:2005:PJI",
pages = "73--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Tian:2005:RWS,
author = "Junfeng Tian and Guofu Ma and Shengfu Ma and Yahui
Meng",
title = "Research on {Web} Server Attacking-Based Intrusion
Detection",
crossref = "Han:2005:PJI",
pages = "159--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Trappe:2005:ICC,
author = "Wade Trappe and Lawrence C. Washington",
title = "Introduction to cryptography: with coding theory",
publisher = pub-PPH,
address = pub-PPH:adr,
edition = "Second",
pages = "xiv + 577",
year = "2005",
ISBN = "0-13-186239-1",
ISBN-13 = "978-0-13-186239-5",
LCCN = "QA268 .T73 2005",
bibdate = "Mon Jul 14 11:45:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography",
}
@Article{Tsai:2005:CAE,
author = "Chwei-Shyong Tsai and Shu-Chen Lin and Min-Shiang
Hwang",
title = "Cryptanalysis of an authenticated encryption scheme
using self-certified public keys",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "1",
pages = "118--122",
day = "6",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Tsaur:2005:EAS,
author = "Woei-Jiunn Tsaur and Chih-Ho Chou",
title = "Efficient algorithms for speeding up the computations
of elliptic curve cryptosystems",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "2",
pages = "1045--1064",
day = "15",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Tsaur:2005:EUA,
author = "Woei-Jiunn Tsaur and Chia-Chun Wu and Wei-Bin Lee",
title = "An enhanced user authentication scheme for
multi-server {Internet} services",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "258--266",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Tsaur:2005:SSS,
author = "Woei-Jiunn Tsaur",
title = "Several security schemes constructed using {ECC}-based
self-certified public key cryptosystems",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "447--464",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Book{Tynan:2005:CPA,
author = "Dan Tynan",
title = "Computer privacy annoyances: how to avoid the most
annoying invasions of your personal and online
privacy",
publisher = pub-ORA-MEDIA,
address = pub-ORA-MEDIA:adr,
pages = "xii + 177",
year = "2005",
ISBN = "0-596-00775-2 (paperback)",
ISBN-13 = "978-0-596-00775-1 (paperback)",
LCCN = "QA76.9.A25 T96 2005",
bibdate = "Thu Oct 6 07:23:16 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
subject = "Computer security; Computers; Access control; Data
protection; Identity theft",
}
@Book{Uhl:2005:IVE,
author = "Andreas Uhl and Andreas Pommer",
title = "Image and video encryption: from digital rights
management to secured personal communication",
volume = "15",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 161",
year = "2005",
ISBN = "0-387-23402-0",
ISBN-13 = "978-0-387-23402-1",
LCCN = "TA1637 .U72 2005",
bibdate = "Wed Sep 28 07:48:07 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Advances in information security",
acknowledgement = ack-nhfb,
subject = "Image processing; Security measures; Data encryption
(Computer science)",
}
@Book{vanTilborg:2005:ECS,
editor = "Henk C. A. van Tilborg",
title = "Encyclopedia of cryptography and security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 684",
year = "2005",
ISBN = "0-387-23473-X (hardcover)",
ISBN-13 = "978-0-387-23473-1 (hardcover)",
LCCN = "Z103 .E53 2005",
bibdate = "Fri Oct 28 18:17:56 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$299.00",
acknowledgement = ack-nhfb,
subject = "Cryptography; Encyclopedias; Data protection;
Encyclopedias",
}
@InProceedings{Vasco:2005:NCS,
author = "Mar{\'\i}a Isabel Gonz{\'a}lez Vasco and Consuelo
Mart{\'\i}nez and Rainer Steinwandt and Jorge L.
Villar",
title = "A New {Cramer--Shoup} Like Methodology for Group Based
Provably Secure Encryption Schemes",
crossref = "Kilian:2005:TCS",
pages = "495--??",
year = "2005",
bibdate = "Tue Apr 4 19:15:40 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Theory of cryptography (TCC 2005)",
}
@InProceedings{Vaudenay:2005:SCI,
author = "Serge Vaudenay",
title = "Secure Communications over Insecure Channels Based on
Short Authenticated Strings",
crossref = "Shoup:2005:ACC",
pages = "309--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_19",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Voice:2005:OAM,
author = "Chris Voice",
title = "Online authentication: matching security levels to the
risk",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "12",
pages = "15--18",
month = dec,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)70315-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:21 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485805703159",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Voloshynovskiy:2005:ITD,
author = "Sviatoslav Voloshynovskiy and Frederic Deguillaume and
Oleksiy Koval and Thierry Pun",
title = "Information-Theoretic Data-Hiding: Recent Achievements
and Open Problems",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "5",
number = "1",
pages = "5--??",
month = jan,
year = "2005",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Jan 12 05:16:34 MST 2005",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Wachsmann:2005:CAK,
author = "Alf Wachsmann",
title = "Centralized authentication with {Kerberos 5}, {Part
I}",
journal = j-LINUX-J,
volume = "2005",
number = "130",
pages = "6--6",
month = feb,
year = "2005",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Sat Dec 24 17:46:04 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@InProceedings{Walter:2005:DDP,
author = "Colin Walter and David Samyde",
title = "Data Dependent Power Use in Multipliers",
crossref = "IEEE:2005:PIS",
pages = "??--??",
year = "2005",
bibdate = "Wed Jun 22 07:02:55 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://arith17.polito.it/final/paper-126.pdf",
abstract = "Recent research has demonstrated the vulnerability of
certain smart card architectures to power and
electromagnetic analysis when multiplier operations are
insufficiently shielded from external monitoring. Here
several standard multipliers are investigated in more
detail in order to provide the foundation for
understanding potential weaknesses and enabling the
subsequent successful repair of those systems. A model
is built which accurately predicts power use as a
function of the Hamming weights of inputs without the
combinatorial explosion of exhaustive simulation. This
confirms that power use is indeed data dependent at
least for those multipliers. Laboratory experiments
confirm that EMR also corresponds closely to these
power predictions over a wide range of frequencies.",
acknowledgement = ack-nhfb,
keywords = "Differential power analysis; DPA; EMA; multiplication;
multiplier; RSA cryptosystem.; smart card",
pagecount = "9",
}
@Article{Wang:2005:CHY,
author = "Shyh-Yih Wang and Chi-Sung Laih",
title = "Cryptanalysis of {Hwang--Yang} scheme for controlling
access in large partially ordered hierarchies",
journal = j-J-SYST-SOFTW,
volume = "75",
number = "1--2",
pages = "189--192",
day = "15",
month = feb,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:27 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@TechReport{Wang:2005:CSA,
author = "Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu",
title = "Collision Search Attacks on {SHA1}",
type = "Technical report",
institution = "Shandong University",
address = "Shandong, China",
year = "2005",
bibdate = "Thu Mar 24 07:53:53 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://theory.csail.mit.edu/~yiqun/shanote.pdf",
acknowledgement = ack-nhfb,
remark = "From the paper: ``We have developed a set of new
techniques that are very effective for searching
collisions in SHA1. Our analysis shows that collisions
of SHA1 can be found with complexity less than $ 2^{69}
$ hash operations. This is the first attack on the full
80-step SHA1 with complexity less than the $ 2^{80} $
theoretical bound. Based on our estimation, we expect
that real collisions of SHA1 reduced to 70-steps can be
found using today's supercomputers.''.",
}
@InProceedings{Wang:2005:DIC,
author = "Xuebing Wang and Linhua Zhang and Yong Wu",
title = "Design and Implementation of a Chaos-Based Public Key
Encryption Scheme",
crossref = "Han:2005:PJI",
pages = "79--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:EAS,
author = "Fei Wang and Yupu Hu and Ying Liu and Zhanpeng Hu",
title = "An Efficient Algorithm for Software Generation of the
Generalized Self-Shrinking Sequence",
crossref = "Han:2005:PJI",
pages = "163--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:ECSa,
author = "Xiaoyun Wang and Hongbo Yu and Yiqun Lisa Yin",
title = "Efficient Collision Search Attacks on {SHA-0}",
crossref = "Shoup:2005:ACC",
pages = "1--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_1",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this paper, we present new techniques for collision
search in the hash function SHA-0. Using the new
techniques, we can find collisions of the full 80-step
SHA-0 with complexity less than $ 2^{39} $ hash
operations.",
acknowledgement = ack-nhfb,
keywords = "Collision search attacks; Crypto '2005; cryptography;
Hash functions; SHA-0; SHA-1",
}
@Article{Wang:2005:ECSb,
author = "Chih-Hung Wang and Yan-Sheng Kuo",
title = "An efficient contract signing protocol using the
aggregate signature scheme to protect signers' privacy
and promote reliability",
journal = j-OPER-SYS-REV,
volume = "39",
number = "4",
pages = "66--79",
month = oct,
year = "2005",
CODEN = "OSRED8",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Sat Aug 26 08:55:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
}
@TechReport{Wang:2005:FCFa,
author = "Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu",
title = "Finding Collisions in the Full {SHA-1}",
type = "Technical report",
institution = "Shandong University",
address = "Shandong, China",
day = "22",
month = jun,
year = "2005",
bibdate = "Fri Jul 15 14:04:29 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://cryptome.org/wang_sha1_v2.zip",
abstract = "In this paper, we present new collision search attacks
on the hash function SHA-1. We show that collisions of
SHA-1 can be found with complexity less than $ 2^{69} $
hash operations. This is the first attack on the full
80-step SHA-1 with complexity less than the $ 2^{80} $
theoretical bound.",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:FCFb,
author = "Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu",
title = "Finding Collisions in the Full {SHA-1}",
crossref = "Shoup:2005:ACC",
pages = "17--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_2",
bibdate = "Mon Apr 3 08:32:34 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this paper, we present new collision search attacks
on the hash function SHA-1. We show that collisions of
SHA-1 can be found with complexity less than $ 2^{69} $
hash operations. This is the first attack on the full
80-step SHA-1 with complexity less than the $ 2^{80} $
theoretical bound.",
acknowledgement = ack-nhfb,
keywords = "Collision search attacks; Crypto '2005; cryptography;
Hash functions; SHA-0; SHA-1",
}
@InProceedings{Wang:2005:RST,
author = "Lijun Wang and Chao Gao",
title = "Rough Set Theory's Application on Intrusion Detection
Based on System Calls",
crossref = "Han:2005:PJI",
pages = "83--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Wang:2005:SAI,
author = "Yingjie Wang and J. H. Li and L. Tie",
title = "Security analysis and improvement of a user-friendly
remote authentication protocol",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "47--50",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Wang:2005:SCR,
author = "Shiuh-Jeng Wang",
title = "Steganography of capacity required using modulo
operator for embedding secret image",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "1",
pages = "99--116",
day = "5",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Wang:2005:SDR,
author = "Kun Wang and Zhen Cai and Lihua Zhou",
title = "Study on Disaster Recovery Planning Model",
crossref = "Han:2005:PJI",
pages = "151--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:TAP,
author = "Xinyuan Wang and Shiping Chen and Sushil Jajodia",
title = "Tracking anonymous peer-to-peer {VoIP} calls on the
{Internet}",
crossref = "Meadows:2005:CPA",
pages = "81--91",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Wang:2005:TSP,
author = "Yu Wang and Yichao Li and Xiaosong Zhang and Jiazhi
Zeng",
title = "Tracing Single-Packet Attacks to Their Sources",
crossref = "Han:2005:PJI",
pages = "118--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Weierud:2005:BPS,
author = "Frode Weierud",
title = "{Bletchley Park}'s {Sturgeon}, the Fish that Laid No
Eggs",
journal = j-RUTHERFORD-J,
volume = "1",
number = "??",
pages = "??--??",
month = "????",
year = "2005--2006",
CODEN = "????",
ISSN = "1177-1380",
ISSN-L = "1177-1380",
bibdate = "Mon Jan 4 09:52:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/rutherfordj.bib",
URL = "http://rutherfordjournal.org/article010106.html",
acknowledgement = ack-nhfb,
fjournal = "Rutherford Journal",
journal-URL = "http://rutherfordjournal.org/",
}
@InCollection{Weierud:2005:BSF,
author = "Frode Weierud",
title = "{BP}'s Sturgeon, The {FISH} That Laid No Eggs",
crossref = "Copeland:2005:CSB",
pages = "??--??",
year = "2005",
bibdate = "Mon Nov 07 18:31:18 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "BP (Bletchley Park); cryptography",
}
@Book{Welschenbach:2005:CCC,
author = "Michael Welschenbach",
title = "Cryptography in {C} and {C++}",
publisher = pub-APRESS,
address = pub-APRESS:adr,
edition = "Second",
pages = "xxv + 478",
year = "2005",
ISBN = "1-59059-502-5",
ISBN-13 = "978-1-59059-502-2",
LCCN = "QA76.9.A25 W4313 2005",
bibdate = "Thu Mar 22 12:02:53 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0663/2005002553-d.html;
http://www.loc.gov/catdir/toc/ecip057/2005002553.html",
acknowledgement = ack-nhfb,
remark = "The first American edition is a translation of the
second German edition, which has been revised and
expanded from the first German edition.",
subject = "Computer security; Cryptography; C (Computer program
language); C++ (Computer program language)",
}
@Article{Wen:2005:TRB,
author = "Hsiang-An Wen and Kuo-Chang Lee and Sheng-Yu Hwang and
Tzonelih Hwang",
title = "On the traceability on {RSA}-based partially signature
with low computation",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "1",
pages = "421--425",
day = "4",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:41 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Wen:2005:URE,
author = "Hsiang-An Wen and Sheng-Yu Hwang and Tzonelih Hwang",
title = "On the unlinkability of randomization-enhanced
{Chaum}'s blind signature scheme",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "3",
pages = "799--803",
day = "25",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:45 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Whyte:2005:TFC,
author = "William Whyte",
title = "Towards faster cryptosystems, {I}",
crossref = "Garrett:2005:PKC",
pages = "113--137",
year = "2005",
MRclass = "94A60 (94-02)",
MRnumber = "2211874 (2007c:94178)",
MRreviewer = "Boris {\`E}. Kunyavski{\u\i}",
bibdate = "Fri Sep 17 09:12:06 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Windley:2005:DI,
author = "Phillip J. Windley",
title = "Digital identity",
publisher = pub-ORA,
address = pub-ORA:adr,
pages = "xviii + 234",
year = "2005",
ISBN = "0-596-00878-3",
ISBN-13 = "978-0-596-00878-9",
LCCN = "TK5105.59 .W45 2005",
bibdate = "Thu Oct 6 07:23:49 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
remark = "Unmasking Identity Management Architecture (IMA).",
subject = "Computer networks; Security measures",
}
@Book{Winkel:2005:GEC,
editor = "Brian J. Winkel",
title = "The {German Enigma} cipher machine",
publisher = pub-ARTECH,
address = pub-ARTECH:adr,
pages = "????",
year = "2005",
ISBN = "1-58053-996-3",
ISBN-13 = "978-1-58053-996-8",
LCCN = "D810.C88 G47 2005",
bibdate = "Mon May 8 07:05:27 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Artech House computer security series",
acknowledgement = ack-nhfb,
remark = "Reprints of papers originally published in
Cryptologia.",
subject = "Enigma cipher system; ULTRA (Intelligence system);
World War, 1939--1945; Cryptography; Electronic
intelligence; Germany; Great Britain; Secret service",
}
@Book{Winkler:2005:SAU,
author = "Ira Winkler",
title = "Spies among us: how to stop the spies, terrorists,
hackers, and criminals you don't even know you
encounter every day",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xix + 326",
year = "2005",
ISBN = "0-7645-8468-5 (cloth)",
ISBN-13 = "978-0-7645-8468-8 (cloth)",
LCCN = "UB250 .W55 2005",
bibdate = "Mon Nov 7 17:31:20 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip054/2004028735.html;
http://www.wiley.com/WileyCDA/WileyTitle/productCd-0764584685.html",
acknowledgement = ack-nhfb,
subject = "Espionage; Business intelligence; Computer crimes;
Prevention; Terrorism; Prevention",
}
@InProceedings{Winslett:2005:PLD,
author = "Marianne Winslett and Charles C. Zhang and Piero A.
Bonatti",
title = "{PeerAccess}: a logic for distributed authorization",
crossref = "Meadows:2005:CPA",
pages = "168--179",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Wolf:2005:NML,
author = "Stefan Wolf and J{\"u}rg Wullschleger",
title = "New Monotones and Lower Bounds in Unconditional
Two-Party Computation",
crossref = "Shoup:2005:ACC",
pages = "467--??",
year = "2005",
DOI = "https://doi.org/10.1007/11535218_28",
bibdate = "Mon Apr 3 09:26:13 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "Crypto '2005; cryptography",
}
@Article{Wollinger:2005:CVH,
author = "T. Wollinger and J. Pelzl and C. Paar",
title = "{Cantor} versus {Harley}: optimization and analysis of
explicit formulae for hyperelliptic curve
cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "7",
pages = "861--872",
month = jul,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.109",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1432669",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Wood:2005:IIM,
author = "Peter Wood",
title = "Implementing identity management security --- an
ethical hacker's view",
journal = j-NETWORK-SECURITY,
volume = "2005",
number = "9",
pages = "12--15",
month = sep,
year = "2005",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(05)70282-8",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:18 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485805702828",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Wrixon:2005:CCO,
author = "Fred B. Wrixon",
title = "Codes, Ciphers and Other Cryptic and Clandestine
Communication: Making and Breaking Secret Messages from
Hieroglyphs to the {Internet}",
publisher = "Black Dog \& Leventhal Publishers",
address = "New York, NY, USA",
pages = "704",
year = "2005",
ISBN = "1-57912-485-2",
ISBN-13 = "978-1-57912-485-4",
LCCN = "Z103.3 .W75 1998",
bibdate = "Mon Nov 21 06:05:56 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
remark = "Originally published 1998.",
}
@Article{Wu:2005:CTR,
author = "Lin-Chuan Wu and Yi-Shiung Yeh",
title = "Comment on traceability on {RSA}-based partially
signature with low computation",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "1344--1348",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Wu:2005:IAW,
author = "Qiong Wu and Guohui Li and Dan Tu",
title = "An Image Authentication Watermarking With
Self-Localization and Recovery",
crossref = "Han:2005:PJI",
pages = "960--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Wu:2005:NDI,
author = "Hsien-Chu Wu and Chin-Chen Chang",
title = "A novel digital image watermarking scheme based on the
vector quantization technique",
journal = j-COMPUT-SECUR,
volume = "24",
number = "6",
pages = "460--471",
month = sep,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:00 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805000672",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Wu:2005:SSP,
author = "Hsien-Chu Wu and Min-Shiang Hwang and Chia-Hsin Liu",
title = "A Secure Strong-Password Authentication Protocol",
journal = j-FUND-INFO,
volume = "68",
number = "4",
pages = "399--406",
month = jun,
year = "2005",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:03:41 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Book{Wyler:2005:ANS,
author = "Neil R. Wyler",
title = "Aggressive network self-defense",
publisher = pub-SYNGRESS,
address = pub-SYNGRESS:adr,
pages = "xxx + 383",
year = "2005",
ISBN = "1-931836-20-5",
ISBN-13 = "978-1-931836-20-3",
LCCN = "QA76.9.A25 A38 2005; QA76.9.A25 A447 2005",
bibdate = "Thu Oct 6 07:25:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "http://site.ebrary.com/lib/ucsc/Doc?id=10075669",
acknowledgement = ack-nhfb,
subject = "Internet; Security measures; Computer security",
}
@Article{Xiao:2005:SPA,
author = "Lu Xiao and Howard M. Heys",
title = "A simple power analysis attack against the key
schedule of the {Camellia} block cipher",
journal = j-INFO-PROC-LETT,
volume = "95",
number = "3",
pages = "409--412",
day = "16",
month = aug,
year = "2005",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:41:02 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Xu:2005:ADR,
author = "Jun Xu and Peng Ning and Chongkyung Kil and Yan Zhai
and Chris Bookholt",
title = "Automatic diagnosis and response to memory corruption
vulnerabilities",
crossref = "Meadows:2005:CPA",
pages = "223--234",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Xu:2005:ETR,
author = "Qiu-Liang Xu and Tzer-Shyong Chen",
title = "An efficient threshold {RSA} digital signature
scheme",
journal = j-APPL-MATH-COMP,
volume = "166",
number = "1",
pages = "25--34",
day = "6",
month = jul,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:46 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yang:2005:CIA,
author = "Chou-Chen Yang and Ren-Chiun Wang",
title = "Cryptanalysis of improved authenticated multiple-key
agreement protocol without using conventional one-way
function",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "1",
pages = "211--214",
day = "4",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:41 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yang:2005:IME,
author = "Jun Yang and Lan Gao and Youtao Zhang",
title = "Improving memory encryption performance in secure
processors",
journal = j-IEEE-TRANS-COMPUT,
volume = "54",
number = "5",
pages = "630--640",
month = may,
year = "2005",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2005.80",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 16:17:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1407851",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Yang:2005:IYS,
author = "Chou-Chen Yang and Ren-Chiun Wang and Ting-Yi Chang",
title = "An improvement of the {Yang-Shieh} password
authentication schemes",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "3",
pages = "1391--1396",
day = "25",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yang:2005:SAS,
author = "Chou-Chen Yang and Ren-Chiun Wang and Wei-Ting Liu",
title = "Secure authentication scheme for session initiation
protocol",
journal = j-COMPUT-SECUR,
volume = "24",
number = "5",
pages = "381--386",
month = aug,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:59 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804002640",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Yang:2005:SEA,
author = "Chou-Chen Yang and Yuan-Liang Tang and Ren-Chiun Wang
and Hung-Wen Yang",
title = "A secure and efficient authentication protocol for
anonymous channel in wireless communications",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "2",
pages = "1431--1439",
day = "15",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Misc{Yang:2005:TFN,
author = "JiXian Yang",
title = "{TWOBLOCK}: a Fast New Hash Function",
pages = "7",
year = "2005",
bibdate = "Thu Sep 22 08:14:45 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "World-Wide Web document.",
URL = "http://yjxonline.hostrocket.com/Hash2005.pdf",
abstract = "In this paper, the author studies the fast
cryptographic hash function. This work suggests a
different notion with respect to the traditional hash
functions, MD5, SHA-1, and Whirlpool. The notion of
block cipher based hash function is abandoned.
According to the flexibility of attack, it shows how
this hash function is no longer vulnerable to the known
collision attacks. Finally, the author proves that the
TWOBLOCK output bit value problem is NP-hard.",
acknowledgement = ack-nhfb,
keywords = "Block cipher; Collision; Design principle; Fast;
Flexibility of attack; Hash function; NP-hard; Provable
security; Two block",
}
@Article{Yoon:2005:CFI,
author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo",
title = "Cryptanalysis and further improvement of {Peinado}'s
improved {LHL}-key authentication scheme",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "2",
pages = "788--794",
day = "15",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yoon:2005:CZX,
author = "Eun-Jun Yoon and Kee-Young Yoo",
title = "Cryptanalysis of {Zhang--Xiao}'s multisignature scheme
for specified group of verifiers",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "226--229",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yoon:2005:ICJ,
author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo",
title = "Improvement of {Chien--Jan}'s authenticated
multiple-key agreement protocol without using
conventional one-way function",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "711--715",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yoon:2005:IFA,
author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo",
title = "Improvement of {Fan} et al.'s deniable authentication
protocol based on {Diffie--Hellman} algorithm",
journal = j-APPL-MATH-COMP,
volume = "167",
number = "1",
pages = "274--280",
day = "5",
month = aug,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:47 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Yoon:2005:IHL,
author = "Eun-Jun Yoon and Eun-Kyung Ryu and Kee-Young Yoo",
title = "An improvement of {Hwang--Lee--Tang}'s simple remote
user authentication scheme",
journal = j-COMPUT-SECUR,
volume = "24",
number = "1",
pages = "50--56",
month = feb,
year = "2005",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:45:58 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404804001749",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Yoon:2005:SWL,
author = "Eun-Jun Yoon and Kee-Young Yoo",
title = "On the security of {Wu-Lin}'s robust key
authentication scheme",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "1",
pages = "1--7",
day = "1",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Yu:2005:EHI,
author = "Jia Yu and Daxing Li and Rong Hao",
title = "An Efficient Hierarchical {ID}-Based Signature
Scheme",
crossref = "Han:2005:PJI",
pages = "92--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Yurkewych:2005:CIR,
author = "Matthew Yurkewych and Brian N. Levine and Arnold L.
Rosenberg",
title = "On the cost-ineffectiveness of redundancy in
commercial {P2P} computing",
crossref = "Meadows:2005:CPA",
pages = "280--288",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Zafeiriou:2005:BRW,
author = "Stefanos Zafeiriou and Anastasios Tefas and Ioannis
Pitas",
title = "Blind Robust Watermarking Schemes for Copyright
Protection of {$3$D} Mesh Objects",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "11",
number = "5",
pages = "596--607",
month = sep # "\slash " # oct,
year = "2005",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2005.71",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Thu Nov 10 07:58:55 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransviscomputgraph.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@InProceedings{Zhang:2005:AES,
author = "Zhikun Zhang and Youping Geng and Tingyan Li and
Jianguo Xiao",
title = "Analysis of Enhanced Separation of Duty In Role-Based
Access Control Model",
crossref = "Han:2005:PJI",
pages = "69--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Zhang:2005:ASP,
author = "Youtao Zhang and Jun Yang and Yongjing Lin and Lan
Gao",
title = "Architectural support for protecting user privacy on
trusted processors",
journal = j-COMP-ARCH-NEWS,
volume = "33",
number = "1",
pages = "118--123",
month = mar,
year = "2005",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Fri May 12 09:40:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Zhang:2005:CHC,
author = "Fangguo Zhang and Xiaofeng Chen",
title = "Cryptanalysis of {Huang--Chang} partially blind
signature scheme",
journal = j-J-SYST-SOFTW,
volume = "76",
number = "3",
pages = "323--325",
month = jun,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:28 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Zhang:2005:CLH,
author = "Fangguo Zhang and Kwangjo Kim",
title = "Cryptanalysis of {Lee--Hwang--Li}'s key authentication
scheme",
journal = j-APPL-MATH-COMP,
volume = "161",
number = "1",
pages = "101--107",
day = "4",
month = feb,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:40 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
note = "See comment \cite{Sun:2005:CCL}.",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Zhang:2005:CSS,
author = "Zhenfeng Zhang and Dengguo Feng",
title = "Cryptanalysis of some signature schemes with message
recovery",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "1",
pages = "103--114",
day = "1",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Zhang:2005:DMC,
author = "Zhiyong Zhang and Jiexin Pu",
title = "Delegation Model for {CSCW} Based on {RBAC} Policies
and Visual Modeling",
crossref = "Han:2005:PJI",
pages = "126--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Zhang:2005:ISM,
author = "Peng Zhang and Chengqing Ye and Xueying Ma",
title = "Improvement of Secure Mobile Agent System In
Electronic Commerce",
crossref = "Han:2005:PJI",
pages = "114--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Zhang:2005:ISS,
author = "Jianhong Zhang and Yumin Wang",
title = "An improved signature scheme without using one-way
{Hash} functions",
journal = j-APPL-MATH-COMP,
volume = "170",
number = "2",
pages = "905--908",
day = "15",
month = nov,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:50 MDT 2008",
bibsource = "applmathcomput2005.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Zhang:2005:ITA,
author = "Zhang Zhang and Shunsuke Araki and Guozhen Xiao",
title = "Improvement of {Tseng} et al.'s authenticated
encryption scheme with message linkages",
journal = j-APPL-MATH-COMP,
volume = "162",
number = "3",
pages = "1475--1483",
day = "25",
month = mar,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Zhang:2005:RPE,
author = "N. Zhang and Q. Shi and M. Merabti",
title = "Revocation of privacy-enhanced public-key
certificates",
journal = j-J-SYST-SOFTW,
volume = "75",
number = "1--2",
pages = "205--214",
day = "15",
month = feb,
year = "2005",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Wed May 18 10:27:27 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Zhang:2005:SCA,
author = "Jianhong Zhang and Yumin Wang",
title = "On the security of a convertible authenticated
encryption",
journal = j-APPL-MATH-COMP,
volume = "169",
number = "2",
pages = "1063--1069",
day = "15",
month = oct,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:49 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Zhao:2005:APA,
author = "Meiyuan Zhao and Sean W. Smith and David M. Nicol",
title = "Aggregated path authentication for efficient {BGP}
security",
crossref = "Meadows:2005:CPA",
pages = "128--138",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Zhao:2005:MCE,
author = "Ze-Mao Zhao and Feng-Yu Liu",
title = "Method of constructing elliptic curve authenticated
encryption scheme",
journal = j-APPL-MATH-COMP,
volume = "168",
number = "1",
pages = "146--151",
day = "1",
month = sep,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:48 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Zhao:2005:SSV,
author = "Xin Zhao and Kevin Borders and Atul Prakash",
title = "{SVGrid}: a secure virtual environment for untrusted
grid applications",
crossref = "ACM:2005:MPI",
pages = "1--6",
year = "2005",
DOI = "https://doi.org/10.1145/1101499.1101515",
bibdate = "Sat Oct 14 13:51:00 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "Most grid security researches focus on user
authentication and secure communication, the protection
of grid computers is left to the underlying operating
system. Unfortunately, most OS level protection
mechanisms can be turned off after an attacker manages
to exploit a vulnerability to gain privileged
access.This paper proposes SVGrid, a Secure Virtual
Grid computing environment, to protect grid computers'
filesystem and network from malicious grid
applications. SVGrid works by isolating grid
applications in one or more grid virtual machines whose
filesystem and network service are moved into a
dedicated monitor virtual machine. All file and network
access requests are then forced to go through the
monitor virtual machine, where security policies can be
enforced. The resource compartment guarantees that
appropriate security policy enforcement cannot be
bypassed or disabled, even if a grid virtual machine is
compromised. We tested SVGrid against attacks on grid
virtual machine using rootkit and Internet worm, SVGrid
was able to prevent both of them from maliciously
accessing filesystem and network. We also evaluated the
performance of SVGrid system and only found that
performance cost was reasonable considering the
security benefits of SVGrid.",
acknowledgement = ack-nhfb,
}
@Article{Zhou:2005:APS,
author = "Lidong Zhou and Fred B. Schneider and Robbert {Van
Renesse}",
title = "{APSS}: proactive secret sharing in asynchronous
systems",
journal = j-TISSEC,
volume = "8",
number = "3",
pages = "259--286",
month = aug,
year = "2005",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat Sep 17 15:42:03 MDT 2005",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@InProceedings{Zhou:2005:MBI,
author = "Zhenyu Zhou and Jianjing Shen",
title = "Multiagent-Based Information Fusion Model for Network
Security",
crossref = "Han:2005:PJI",
pages = "139--??",
year = "2005",
bibdate = "Fri Mar 23 17:59:18 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Zhou:2005:PSP,
author = "Yuan Zhou and ZhenFu Cao and RongXing Lu",
title = "Provably secure proxy-protected signature schemes
based on factoring",
journal = j-APPL-MATH-COMP,
volume = "164",
number = "1",
pages = "83--98",
day = "5",
month = may,
year = "2005",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Mon Jul 4 09:15:44 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Zhuang:2005:KAE,
author = "Li Zhuang and Feng Zhou and J. D. Tygar",
title = "Keyboard acoustic emanations revisited",
crossref = "Meadows:2005:CPA",
pages = "373--382",
year = "2005",
bibdate = "Mon Apr 3 08:07:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Zivkovic:2005:AAH,
author = "Miroslav {\v{Z}}ivkovi{\'c} and Milind M. Buddhikot
and Ko Lagerberg and Jeroen van Bemmel",
title = "Authentication across heterogeneous networks",
journal = j-BELL-LABS-TECH-J,
volume = "10",
number = "2",
pages = "39--56",
month = "Summer",
year = "2005",
CODEN = "BLTJFD",
DOI = "https://doi.org/10.1002/bltj.20093",
ISSN = "1089-7089 (print), 1538-7305 (electronic)",
ISSN-L = "1089-7089",
bibdate = "Fri Nov 26 17:31:36 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
onlinedate = "3 Aug 2005",
}
@Article{Zou:2005:MED,
author = "Cliff C. Zou and Weibo Gong and Don Towsley and Lixin
Gao",
title = "The monitoring and early detection of {Internet}
Worms",
journal = j-IEEE-TRANS-NETWORKING,
volume = "13",
number = "5",
pages = "961--974",
month = oct,
year = "2005",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2005.857113",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Dec 30 06:01:37 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "After many Internet-scale worm incidents in recent
years, it is clear that a simple self-propagating worm
can quickly spread across the Internet and cause severe
damage to our society. Facing this great security
threat, we need to build an early detection system that
can detect the presence of a worm in the Internet as
quickly as possible in order to give people accurate
early warning information and possible reaction time
for counteractions. This paper first presents an
Internet worm monitoring system. Then, based on the
idea of ``detecting the trend, not the burst'' of
monitored illegitimate traffic, we present a ``trend
detection'' methodology to detect a worm at its early
propagation stage by using Kalman filter estimation,
which is robust to background noise in the monitored
data. In addition, for uniform-scan worms such as Code
Red, we can effectively predict the overall vulnerable
population size, and estimate accurately how many
computers are really infected in the global Internet
based on the biased monitored data. For monitoring a
nonuniform scan worm, especially a sequential-scan worm
such as Blaster, we show that it is crucial for the
address space covered by the worm monitoring system to
be as distributed as possible.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Computer network security; early detection; Internet
worm; network monitoring",
}
@Article{Zunino:2005:WPE,
author = "Roberto Zunino and Pierpaolo Degano",
title = "Weakening the perfect encryption assumption in
{Dolev--Yao} adversaries",
journal = j-THEOR-COMP-SCI,
volume = "340",
number = "1",
pages = "154--178",
day = "13",
month = jun,
year = "2005",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Thu Jul 7 14:28:20 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Abimbola:2006:NSI,
author = "A. A. Abimbola and J. M. Munoz and W. J. Buchanan",
title = "{NetHost-Sensor}: Investigating the capture of
end-to-end encrypted intrusive data",
journal = j-COMPUT-SECUR,
volume = "25",
number = "6",
pages = "445--451",
month = sep,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404806000605",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@TechReport{Aciicmez:2006:PSB,
author = "Onur Acii{\c{c}}mez and {\c{C}}etin Kaya Ko{\c{c}} and
Jean-Pierre Seifert",
title = "On the Power of Simple Branch Prediction Analysis",
type = "Technical report",
institution = "School of EECS, Oregon State University",
address = "Corvallis, OR 97331, USA",
month = oct,
year = "2006",
bibdate = "Mon Nov 20 14:57:23 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eprint.iacr.org/2006/351;
http://eprint.iacr.org/2006/351.pdf",
abstract = "Very recently, a new software side-channel attack,
called Branch Prediction Analysis (BPA) attack, has
been discovered and also demonstrated to be practically
feasible on popular commodity PC platforms. While the
above recent attack still had the flavor of a classical
timing attack against RSA, where one uses many
execution-time measurements under the same key in order
to statistically amplify some small but key-dependent
timing differences, we dramatically improve upon the
former result. We prove that a carefully written
spy-process running simultaneously with an RSA-process,
is able to collect during one \emph{single} RSA signing
execution almost all of the secret key bits. We call
such an attack, analyzing the CPU's Branch Predictor
states through spying on a single quasi-parallel
computation process, a \emph{Simple Branch Prediction
Analysis (SBPA)} attack --- sharply differentiating it
from those one relying on statistical methods and
requiring many computation measurements under the same
key. The successful extraction of almost all secret key
bits by our SBPA attack against an openSSL RSA
implementation proves that the often recommended
blinding or so called randomization techniques to
protect RSA against side-channel attacks are, in the
context of SBPA attacks, totally useless. Additional to
that very crucial security implication, targeted at
such implementations which are assumed to be at least
statistically secure, our successful SBPA attack also
bears another equally critical security implication.
Namely, in the context of simple side-channel attacks,
it is widely believed that equally balancing the
operations after branches is a secure countermeasure
against such simple attacks. Unfortunately, this is not
true, as even such ``balanced branch'' implementations
can be completely broken by our SBPA attacks. Moreover,
despite sophisticated hardware-assisted partitioning
methods such as memory protection, sandboxing or even
virtualization, SBPA attacks empower an unprivileged
process to successfully attack other processes running
in parallel on the same processor. Thus, we conclude
that SBPA attacks are much more dangerous than
previously anticipated, as they obviously do not belong
to the same category as pure timing attacks.",
acknowledgement = ack-nhfb,
keywords = "implementation / Branch Prediction; Modular
Exponentiation; RSA; Side Channel Analysis;
Simultaneous Multithreading; Trusted Computing",
}
@InProceedings{Akavia:2006:BOW,
author = "Adi Akavia and Oded Goldreich and Shafi Goldwasser and
Dana Moshkovitz",
title = "On basing one-way functions on {NP}-hardness",
crossref = "ACM:2006:PTE",
pages = "701--710",
year = "2006",
bibdate = "Thu May 25 06:19:54 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See erratum \cite{Akavia:2010:EBO}.",
acknowledgement = ack-nhfb,
}
@Article{Allman:2006:MAW,
author = "Eric Allman",
title = "{E-mail} authentication: what, why, how?",
journal = j-QUEUE,
volume = "4",
number = "9",
pages = "30--34",
month = nov,
year = "2006",
CODEN = "AQCUAE",
DOI = "https://doi.org/10.1145/1180176.1180191",
ISSN = "1542-7730 (print), 1542-7749 (electronic)",
ISSN-L = "1542-7730",
bibdate = "Wed Nov 15 06:50:09 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Queue: Tomorrow's Computing Today",
}
@Article{Anonymous:2006:JHD,
author = "Anonymous",
title = "Just 12\% of handheld devices encrypted",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "7",
pages = "20--20",
month = jul,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70415-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:28 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806704159",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2006:RC,
author = "Anonymous",
title = "{RSA{\reg} Conference 2007}",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "14",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.162",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Anonymous:2006:SQE,
author = "Anonymous",
title = "Success for quantum encryption?",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "5",
pages = "20--20",
month = may,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70392-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:26 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806703920",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Anonymous:2006:SSD,
author = "Anonymous",
title = "{Solaris} Security for Developers Guide",
publisher = pub-SUN,
address = pub-SUN:adr,
pages = "????",
year = "2006",
ISBN = "0-595-28558-9",
ISBN-13 = "978-0-595-28558-7",
LCCN = "????",
bibdate = "Mon Jun 19 12:17:50 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://docs.sun.com/app/docs/doc/816-4863",
acknowledgement = ack-nhfb,
tableofcontents = "Preface \\
Solaris Security for Developers (Overview) \\
Developing Privileged Applications \\
Writing PAM Applications and Services \\
Writing Applications That Use GSS-API \\
GSS-API Client Example \\
GSS-API Server Example \\
Writing Applications That Use SASL \\
Introduction to the Solaris Cryptographic Framework \\
Writing User-Level Cryptographic Applications and
Providers \\
Using the Smart Card Framework \\
Sample C-Based GSS-API Programs \\
GSS-API Reference \\
Specifying an OID \\
Source Code for SASL Example \\
SASL Reference Tables \\
Packaging and Signing Cryptographic Providers \\
Glossary",
}
@Article{Applebaum:2006:C,
author = "Benny Applebaum and Yuval Ishai and Eyal Kushilevitz",
title = "Cryptography in $ {NC}^0 $",
journal = j-SIAM-J-COMPUT,
volume = "36",
number = "4",
pages = "845--888",
month = "????",
year = "2006",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:37 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/36/4;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Ateniese:2006:IPR,
author = "Giuseppe Ateniese and Kevin Fu and Matthew Green and
Susan Hohenberger",
title = "Improved proxy re-encryption schemes with applications
to secure distributed storage",
journal = j-TISSEC,
volume = "9",
number = "1",
pages = "1--30",
month = feb,
year = "2006",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat Apr 29 09:23:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Attrapadung:2006:FSS,
author = "Nuttapong Attrapadung and Jun Furukawa and Hideki
Imai",
title = "Forward-Secure and Searchable Broadcast Encryption
with Short Ciphertexts and Private Keys",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4284",
pages = "161--177",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11935230_11",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 13 08:42:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/11935230_11.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/11935230",
book-URL = "http://www.springerlink.com/content/978-3-540-49476-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Avanzi:2006:ESM,
author = "Roberto Avanzi and Vassil Dimitrov and Christophe
Doche and Francesco Sica",
title = "Extending Scalar Multiplication Using Double Bases",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4284",
pages = "130--144",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11935230_9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 13 08:42:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/11935230_9.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/11935230",
book-URL = "http://www.springerlink.com/content/978-3-540-49476-8",
fjournal = "Lecture Notes in Computer Science",
keywords = "elliptic curves; Koblitz curves; supersingular
curves",
}
@Article{Ayoade:2006:SIR,
author = "John Ayoade",
title = "Security implications in {RFID} and authentication
processing framework",
journal = j-COMPUT-SECUR,
volume = "25",
number = "3",
pages = "207--212",
month = may,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805001951",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Badra:2006:KEA,
author = "Mohamad Badra and Ibrahim Hajjeh",
title = "Key-Exchange Authentication Using Shared Secrets",
journal = j-COMPUTER,
volume = "39",
number = "3",
pages = "58--66",
month = mar,
year = "2006",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2006.94",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:16:19 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Bao:2006:CIB,
author = "Feng Bao and Cheng-Chi Lee and Min-Shiang Hwang",
title = "Cryptanalysis and improvement on batch verifying
multiple {RSA} digital signatures",
journal = j-APPL-MATH-COMP,
volume = "172",
number = "2",
pages = "1195--1200",
day = "15",
month = jan,
year = "2006",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@PhdThesis{Barkan:2006:CCP,
author = "Elad Pinhas Barkan",
title = "Cryptanalysis of ciphers and protocols",
type = "Thesis ({Ph.D.})",
school = "Faculty of Computer Science, Technion --- Israel
Institute of Technology",
address = "Haifa, Israel",
pages = "vi + 176",
year = "2006",
bibdate = "Fri May 13 06:21:15 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
advisor = "Eli Biham",
remark = "Added title page and abstract in Hebrew.",
}
@Manual{Barker:2006:ROA,
author = "Elaine Barker",
title = "Recommendation for Obtaining Assurances for Digital
Signature Applications",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "v + 33",
month = nov,
year = "2006",
bibdate = "Thu Mar 22 11:05:43 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "NIST Special Publication 800-89.",
URL = "http://csrc.nist.gov/CryptoToolkit/dss/SP800-89Nov2006.pdf",
acknowledgement = ack-nhfb,
}
@Manual{Barker:2006:RRN,
author = "Elaine Barker and John Kelsey",
title = "Recommendation for Random Number Generation Using
Deterministic Random Bit Generators",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "viii + 123",
year = "2006",
bibdate = "Wed Sep 06 07:05:25 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/publications/nistpubs/800-90/SP800-90_DRBG-June2006-final.pdf",
acknowledgement = ack-nhfb,
}
@Book{Beissinger:2006:CUM,
author = "Janet Beissinger and Vera Pless",
title = "The Cryptoclub: Using Mathematics to Make and Break
Secret Codes",
publisher = pub-A-K-PETERS,
address = pub-A-K-PETERS:adr,
pages = "xvi + 199",
year = "2006",
ISBN = "1-56881-223-X",
ISBN-13 = "978-1-56881-223-6",
LCCN = "QA40.5 .B45 2006",
bibdate = "Fri Mar 23 19:22:49 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip067/2006002743.html",
acknowledgement = ack-nhfb,
subject = "Mathematics; Juvenile literature; Cryptography",
}
@Book{Bejtlich:2006:EDS,
author = "Richard Bejtlich",
title = "Extrusion detection: security monitoring for internal
intrusions",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxviii + 385",
year = "2006",
ISBN = "0-321-34996-2 (paperback)",
ISBN-13 = "978-0-321-34996-5 (paperback)",
LCCN = "TK5105.59 .B43 2006",
bibdate = "Mon Apr 3 07:35:31 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Detecting and controlling intrusions --- Network
security monitoring revisited --- Defensible network
architecture --- Extrusion detection illustrated ---
Enterprise network instrumentation --- Layer 3 network
access control --- Network security operations ---
Traffic threat assessment --- Network incident response
--- Network forensics --- Internal intrusions ---
Traffic threat assessment case study --- Malicious
bots",
subject = "Computer networks; Security measures; Electronic
countermeasures",
}
@InProceedings{Bellare:2006:MPP,
author = "Mihir Bellare and Thomas Ristenpart",
editor = "????",
booktitle = "Advances in Cryptology --- {ASIACRYPT 2006}",
title = "Multi-property-preserving hash domain extension and
the {EMD} transform",
publisher = pub-SV,
address = pub-SV:adr,
pages = "299--314",
year = "2006",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:25:56 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 7]{Schneier:2015:SWC}.",
}
@Article{Bisseling:2006:MSM,
author = "Rob H. Bisseling and Ildik{\'o} Flesch",
title = "{Mondriaan} sparse matrix partitioning for attacking
cryptosystems by a parallel block {Lanczos} algorithm
--- a case study",
journal = j-PARALLEL-COMPUTING,
volume = "32",
number = "7--8",
pages = "551--567",
month = sep,
year = "2006",
CODEN = "PACOEJ",
ISSN = "0167-8191 (print), 1872-7336 (electronic)",
ISSN-L = "0167-8191",
bibdate = "Thu Sep 2 17:51:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01678191",
acknowledgement = ack-nhfb,
fjournal = "Parallel Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/01678191",
}
@Article{Blanton:2006:SRF,
author = "Marina Blanton and Mikhail Atallah",
title = "Succinct representation of flexible and
privacy-preserving access rights",
journal = j-VLDB-J,
volume = "15",
number = "4",
pages = "334--354",
month = nov,
year = "2006",
CODEN = "VLDBFR",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Jun 23 10:51:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We explore the problem of portable and flexible
privacy preserving access rights that permit access to
a large collection of digital goods. {\em
Privacy-preserving\/} access control means that the
service provider can neither learn what access rights a
customer has nor link a request to access an item to a
particular customer, thus maintaining privacy of both
customer activity and customer access rights. {\em
Flexible\/} access rights allow a customer to choose a
subset of items or groups of items from the repository,
obtain access to and be charged only for the items
selected. And {\em portability\/} of access rights
means that the rights themselves can be stored on small
devices of limited storage space and computational
capabilities such as smartcards or sensors, and
therefore the rights must be enforced using the limited
resources available. In this paper, we present and
compare two schemes that address the problem of such
access rights. We show that much can be achieved if one
allows for even a negligible amount of false positives
&\#x2013; items that were not requested by the
customer, but inadvertently were included in the
customer access right representation due to constrained
space resources. But minimizing false positives is one
of many other desiderata that include protection
against sharing of false positives information by
unscrupulous users, providing the users with
transaction untraceability and unlinkability, and
forward compatibility of the scheme. Our first scheme
does not place any constraints on the amount of space
available on the limited-capacity storage device, and
searches for the best representation that meets the
requirements. The second scheme, on the other hand, has
(modest) requirements on the storage space available,
but guarantees a low rate of false positives: with $
O(m c) $ storage space available on the smartcard
(where $m$ is the number of items or groups of items
included in the subscription and $c$ is a selectable
parameter), it achieves a rate of false positives of $
m^{-c} $.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "compact representation; flexible access rights;
privacy-preserving access rights",
remark = "Check month: April or November??",
}
@Article{Blundo:2006:VCS,
author = "Carlo Blundo and Stelvio Cimato and Alfredo {De
Santis}",
title = "Visual cryptography schemes with optimal pixel
expansion",
journal = j-THEOR-COMP-SCI,
volume = "369",
number = "1--3",
pages = "169--182",
day = "15",
month = dec,
year = "2006",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:31 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Boldyreva:2006:SO,
author = "Alexandra Boldyreva and Marc Fischlin",
title = "On the Security of {OAEP}",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4284",
pages = "210--225",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11935230_14",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 13 08:42:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/11935230_14.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/11935230",
book-URL = "http://www.springerlink.com/content/978-3-540-49476-8",
fjournal = "Lecture Notes in Computer Science",
keywords = "OAEP encryption scheme",
}
@Article{Bozga:2006:PBA,
author = "L. Bozga and Y. Lakhnech and M. P{\'e}rin",
title = "Pattern-based abstraction for verifying secrecy in
protocols",
journal = j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER,
volume = "8",
number = "1",
pages = "57--76",
month = feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10009-005-0189-6",
ISSN = "1433-2779 (print), 1433-2787 (electronic)",
ISSN-L = "1433-2779",
bibdate = "Wed Jul 9 18:12:21 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1433-2779&volume=8&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sttt.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1433-2779&volume=8&issue=1&spage=57",
acknowledgement = ack-nhfb,
fjournal = "International Journal on Software Tools for Technology
Transfer: STTT",
keywords = "Abstract interpretation; Cryptographic protocols;
Security; Verification; Widening",
}
@Article{Brackenridge:2006:IUU,
author = "B. Brackenridge",
title = "Invention: Ultrawideband Upset",
journal = j-IEEE-SPECTRUM,
volume = "43",
number = "9",
pages = "65--66",
month = sep,
year = "2006",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2006.1688265",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Business; Cryptography; Engineering profession; FCC;
Internet; Law; Licenses; Privacy; Radio broadcasting;
Ultra wideband technology",
}
@Article{Breveglieri:2006:GEI,
author = "L. Breveglieri and I. Koren",
title = "{Guest Editors}' Introduction: Special Section on
Fault Diagnosis and Tolerance in Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "9",
pages = "1073--1074",
month = sep,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.149",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1668034",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Brustoloni:2006:LEN,
author = "Jos{\'e} Carlos Brustoloni",
title = "Laboratory experiments for network security
instruction",
journal = j-JERIC,
volume = "6",
number = "4",
pages = "5:1--5:??",
month = dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1248453.1248458",
ISSN = "1531-4278",
bibdate = "Fri Jun 20 10:12:35 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/jeric/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We describe a sequence of five experiments on network
security that cast students successively in the roles
of computer user, programmer, and system administrator.
Unlike experiments described in several previous
papers, these experiments avoid placing students in the
role of attacker. Each experiment starts with an
in-class demonstration of an attack by the instructor.
Students then learn how to use open-source defense
tools appropriate for the role they are playing and the
attack at hand. Threats covered include eavesdropping,
dictionary, man-in-the-middle, port scanning, and
fingerprinting attacks. Defense skills gained by
students include how to forward ports with OpenSSH, how
to prevent weak passwords with CrackLib, how to salt
passwords, how to set up a simple certifying authority,
issue and verify certificates, and guarantee
communication confidentiality and integrity using
OpenSSL, and how to set up firewalls and IPsec-based
virtual private networks. At two separate offerings,
tests taken before and after each experiment showed
that each has a statistically significant and large
effect on students' learning. Moreover, surveys show
that students finish the sequence of experiments with
high interest in further studies and work in the area
of security. These results suggest that the experiments
are well-suited for introductory security or networking
courses.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Journal on Educational Resources in Computing
(JERIC)",
keywords = "certificate; certifying authority; course; dictionary
attack; eavesdropping; education; experiment;
fingerprinting; firewall; IPsec; man-in-the-middle;
password; port scanning; security; SSH; SSL; VPN",
}
@Article{Buchmann:2006:PCL,
author = "Johannes Buchmann and Alexander May and Ulrich
Vollmer",
title = "Perspectives for cryptographic long-term security",
journal = j-CACM,
volume = "49",
number = "9",
pages = "50--55",
month = sep,
year = "2006",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Aug 22 07:27:40 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
remark = "Special issue on privacy and security in highly
dynamic systems.",
}
@Book{Budiansky:2006:HMS,
author = "Stephen Budiansky",
title = "{Her Majesty}'s spymaster: {Elizabeth I}, {Sir Francis
Walsingham}, and the birth of modern espionage",
publisher = "Plume",
address = "New York, NY, USA",
pages = "xvii + 235 + 8",
year = "2006",
ISBN = "0-452-28747-2",
ISBN-13 = "978-0-452-28747-1",
LCCN = "DA358.W2 B83 2006",
bibdate = "Mon Dec 19 12:36:42 MST 2016",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Sir Francis Walsingham's official title was principal
secretary to Queen Elizabeth I, but in fact this pious,
tight-lipped Puritan was England's first spymaster. A
ruthless, fiercely loyal civil servant, Walsingham
worked brilliantly behind the scenes to foil
Elizabeth's rival Mary Queen of Scots and outwit
Catholic Spain and France, which had arrayed their
forces behind her. Though he cut an incongruous figure
in Elizabeth's worldly court, Walsingham managed to win
the trust of key players like William Cecil and the
Earl of Leceister before launching his own secret
campaign against the queen's enemies. Covert operations
were Walsingham's genius; he pioneered techniques for
exploiting double agents, spreading disinformation, and
deciphering codes with the latest code-breaking science
that remain staples of international espionage.
Budiansky recounts how this legendary spymaster
invented the art and science of modern espionage and in
the process set Elizabethan England on the path to
empire.",
acknowledgement = ack-nhfb,
subject = "Walsingham, Francis, Sir; Elizabeth, I, Queen of
England; Relations with cabinet officers; Espionage,
British; History; 16th century; Cabinet officers; Great
Britain; Biography; Cabinet officers; Diplomatic
relations; Espionage, British; Relations with cabinet
officers; Foreign relations; 1558--1603; Elizabeth,
1558--1603; France",
subject-dates = "1530?--1590; 1533--1603",
tableofcontents = "1572: Murder in Paris. An ill-fitting shoe \\
Less peril as enemies \\
1532--72: Making of a spymaster. A particular kind of
gentleman \\
The Queen's perilous course \\
A most unwelcome guest \\
1573--83: Mr. Secretary. Intelligencers and scoundrels
\\
Adversaries and moles \\
1583--87: The bosom serpent. The Throckmorton Plot \\
Letters in cipher \\
The final act \\
1584--90: War at last. Old friends and enemies \\
A traitor in Paris \\
Forearmed",
}
@TechReport{Buhan:2006:FBL,
author = "Ileana Buhan",
title = "Feeling is believing: a location limited channel based
on grip pattern biometrics and cryptanalysis",
type = "{CTIT} technical report",
number = "06-29",
institution = "Centre for Telematics and Information Technology,
University of Twente",
address = "Enschede, The Netherlands",
pages = "10",
year = "2006",
ISSN = "1381-3625",
bibdate = "Thu May 12 06:43:16 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "biometrie; cryptologie; systeemontwikkeling
(informatica)",
}
@Article{Burr:2006:CHS,
author = "William E. Burr",
title = "Cryptographic Hash Standards: Where Do We Go from
Here?",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "2",
pages = "88--91",
month = mar # "\slash " # apr,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.37",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Apr 3 07:36:16 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Butler:2006:FAK,
author = "Frederick Butler and Iliano Cervesato and Aaron D.
Jaggard and Andre Scedrov and Christopher Walstad",
title = "Formal analysis of {Kerberos 5}",
journal = j-THEOR-COMP-SCI,
volume = "367",
number = "1--2",
pages = "57--87",
day = "24",
month = nov,
year = "2006",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Caballero-Gil:2006:SSB,
author = "P. Caballero-Gil and C. Hern{\'a}ndez-Goya",
title = "Secret sharing based on a hard-on-average problem",
journal = j-LINEAR-ALGEBRA-APPL,
volume = "414",
number = "2--3",
pages = "626--631",
day = "15",
month = apr,
year = "2006",
CODEN = "LAAPAW",
ISSN = "0024-3795 (print), 1873-1856 (electronic)",
ISSN-L = "0024-3795",
bibdate = "Mon Mar 13 16:56:13 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00243795",
acknowledgement = ack-nhfb,
fjournal = "Linear Algebra and its Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/00243795",
}
@Article{Candebat:2006:SPM,
author = "Thibault Candebat and David Gray",
title = "Secure pseudonym management using mediated
identity-based encryption",
journal = j-J-COMP-SECUR,
volume = "14",
number = "3",
pages = "249--267",
month = "????",
year = "2006",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2006-14302",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:11 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Canetti:2006:SCC,
author = "Ran Canetti",
title = "Security and composition of cryptographic protocols: a
tutorial (part {I})",
journal = j-SIGACT,
volume = "37",
number = "3",
pages = "67--92",
month = sep,
year = "2006",
CODEN = "SIGNDM",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Sat Dec 06 15:20:39 2003",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Canetti06;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/security.2.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://doi.acm.org/10.1145/1165555.1165570",
acknowledgement = ack-nhfb,
added-at = "Wed Sep 12 09:24:11 2007",
added-by = "msteiner",
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
online = "Available also at the Cryptology ePrint Archive,
Report 2006/465 (\url{http://eprint.iacr.org/2006})",
}
@InProceedings{Canteaut:2006:OPR,
author = "Anne Canteaut",
title = "Open Problems Related to Algebraic Attacks on Stream
Ciphers",
crossref = "Ytrehus:2006:CCI",
pages = "120--134",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Casselman:2006:MTE,
author = "Bill Casselman",
title = "Mathematical theory of the {Enigma} machine",
journal = j-NAMS,
volume = "53",
number = "4",
pages = "433--433",
month = apr,
year = "2006",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
bibdate = "Fri Mar 24 17:01:58 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "The front cover of this issue displays eight pages of
Alan Turing's description of the Enigma machine. The
issue is a special tribute to Kurt G{\"o}del for the
centenary of his birth.",
URL = "http://www.mathaware.org/;
http://www.nationalarchives.gov.uk/;
http://www.turingarchive.org/browse.php/C/30",
acknowledgement = ack-nhfb,
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Article{Chandramouli:2006:BPA,
author = "R. Chandramouli and S. Bapatla and K. P. Subbalakshmi
and R. N. Uma",
title = "Battery power-aware encryption",
journal = j-TISSEC,
volume = "9",
number = "2",
pages = "162--180",
month = may,
year = "2006",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1151414.1151417",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat Aug 26 08:10:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Minimizing power consumption is crucial in battery
power-limited secure wireless mobile networks. In this
paper, we (a) introduce a hardware/software set-up to
measure the battery power consumption of encryption
algorithms through real-life experimentation, (b) based
on the profiled data, propose mathematical models to
capture the relationships between power consumption and
security, and (c) formulate and solve security
maximization subject to power constraints. Numerical
results are presented to illustrate the gains that can
be achieved in using solutions of the proposed security
maximization problems subject to power constraints.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Cheon:2006:KPC,
author = "Jung Hee Cheon and Woo-Hwan Kim and Hyun Soo Nam",
title = "Known-plaintext cryptanalysis of the {Domingo--Ferrer}
algebraic privacy homomorphism scheme",
journal = j-INFO-PROC-LETT,
volume = "97",
number = "3",
pages = "118--123",
day = "14",
month = feb,
year = "2006",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:41:07 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chin:2006:HSI,
author = "Chong Siew Chin and Andrew Teoh Beng Jin and David Ngo
Chek Ling",
title = "High security {Iris} verification system based on
random secret integration",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "102",
number = "2",
pages = "169--177",
month = may,
year = "2006",
CODEN = "CVIUF4",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Apr 2 10:55:50 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@PhdThesis{Choi:2006:CHP,
author = "Su-Jeong Choi",
title = "Cryptanalysis of a homomorphic public-key
cryptosystem",
type = "Thesis ({Ph.D.})",
school = "University of London",
address = "London, UK",
pages = "????",
year = "2006",
bibdate = "Fri May 13 05:48:56 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Chuang:2006:USF,
author = "J.-C. Chuang and C.-C. Chang",
title = "Using A Simple and Fast Image Compression Algorithm To
Hide Secret Information",
journal = j-INT-J-COMPUT-APPL,
volume = "28",
number = "4",
pages = "329--333",
year = "2006",
DOI = "https://doi.org/10.1080/1206212X.2006.11441818",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:23:29 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2006.11441818",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Book{Cid:2006:AAA,
author = "Carlos Cid and Sean Murphy and Matthew Robshaw",
title = "Algebraic Aspects of the {Advanced Encryption
Standard}",
volume = "310",
publisher = pub-SV,
address = pub-SV:adr,
pages = "125",
year = "2006",
ISBN = "0-387-24363-1",
ISBN-13 = "978-0-387-24363-4",
LCCN = "????",
bibdate = "Mon Jun 12 18:49:18 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
series = "Advances in Information Security",
URL = "http://deposit.ddb.de/cgi-bin/dokserv?id=2739239&prov=M&dok\_var=1&dok\_ext=htm",
acknowledgement = ack-nhfb,
}
@Article{Cimato:2006:PVC,
author = "S. Cimato and R. De Prisco and A. {De Santis}",
title = "Probabilistic Visual Cryptography Schemes",
journal = j-COMP-J,
volume = "49",
number = "1",
pages = "97--107",
month = jan,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh152",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Dec 21 17:38:55 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue1/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/1/97;
http://comjnl.oxfordjournals.org/cgi/content/full/49/1/97;
http://comjnl.oxfordjournals.org/cgi/reprint/49/1/97",
abstract = "Visual cryptography schemes allow the encoding of a
secret image, consisting of black or white pixels, into
n shares which are distributed to the participants. The
shares are such that only qualified subsets of
participants can `visually' recover the secret image.
The secret pixels are shared with techniques that
subdivide each secret pixel into a certain number $m$,
$ m \geq 2 $ of subpixels. Such a parameter $m$ is
called pixel expansion. Recently Yang introduced a
probabilistic model. In such a model the pixel
expansion $m$ is $1$, that is, there is no pixel
expansion. The reconstruction of the image however is
probabilistic, meaning that a secret pixel will be
correctly reconstructed only with a certain
probability. In this paper we propose a generalization
of the model proposed by Yang. In our model we fix the
pixel expansion $ m \geq 1 $ that can be tolerated and
we consider probabilistic schemes attaining such a
pixel expansion. For $ m = 1 $ our model reduces to the
one of Yang. For big enough values of $m$, for which a
deterministic scheme exists, our model reduces to the
classical deterministic model. We show that between
these two extremes one can trade the probability factor
of the scheme with the pixel expansion. Moreover, we
prove that there is a one-to-one mapping between
deterministic schemes and probabilistic schemes with no
pixel expansion, where contrast is traded for the
probability factor.",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Cimato:2006:UMU,
author = "Stelvio Cimato and Antonella Cresti and Paolo D'Arco",
title = "A unified model for unconditionally secure key
distribution",
journal = j-J-COMP-SECUR,
volume = "14",
number = "1",
pages = "45--64",
month = "????",
year = "2006",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2006-14102",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:04 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Climent:2006:NEC,
author = "Joan-Josep Climent and Francisco Ferr{\'a}ndez and
Jos{\'e}-Francisco Vicent and Antonio Zamora",
title = "A nonlinear elliptic curve cryptosystem based on
matrices",
journal = j-APPL-MATH-COMP,
volume = "174",
number = "1",
pages = "150--164",
day = "1",
month = mar,
year = "2006",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Book{Cook:2006:CEG,
author = "Debra Cook and Angelos Keromytis",
title = "CryptoGraphics: Exploiting Graphics Cards for
Security",
volume = "25",
publisher = pub-SV,
address = pub-SV:adr,
year = "2006",
ISBN = "0-387-29015-X",
ISBN-13 = "978-0-387-29015-7",
LCCN = "????",
bibdate = "Fri Aug 25 15:30:25 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
price = "US\$99.00",
series = "Advances in information security",
URL = "http://www.loc.gov/catdir/enhancements/fy0663/2006925092-d.html",
acknowledgement = ack-nhfb,
remark = "From the publishers: ``This book explores the
potential for implementing ciphers within GPUs, and
describes the relevance of GPU-based encryption to the
security of applications involving remote displays. As
the processing power of GPUs increases, research
involving the use of GPUs for general purpose computing
has arisen. This work extends such research by
considering the use of a GPU as a parallel processor
for encrypting data. The authors evaluate the
operations found in symmetric and asymmetric key
ciphers to determine if encryption can be programmed in
existing GPUs. A detailed description for a GPU based
implementation of AES is provided. The feasibility of
GPU-based encryption allows the authors to explore the
use of a GPU as a trusted system component. Unencrypted
display data can be confined to the GPU to avoid
exposing it to any malware running on the operating
system.''",
}
@Article{Coron:2006:WC,
author = "J.-S. Coron",
title = "What Is Cryptography?",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "1",
pages = "70--73",
month = jan # "\slash " # feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.29",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Feb 9 18:53:31 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8013/33481/01588831.pdf;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=33481&arnumber=1588831",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Correia:2006:CAB,
author = "Miguel Correia and Nuno Ferreira Neves and Paulo
Ver{\'\i}ssimo",
title = "From Consensus to Atomic Broadcast: Time-Free
{Byzantine}-Resistant Protocols without Signatures",
journal = j-COMP-J,
volume = "49",
number = "1",
pages = "82--96",
month = jan,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh145",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Dec 21 17:38:55 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue1/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/1/82;
http://comjnl.oxfordjournals.org/cgi/content/full/49/1/82;
http://comjnl.oxfordjournals.org/cgi/reprint/49/1/82",
abstract = "This paper proposes a stack of three
Byzantine-resistant protocols aimed to be used in
practical distributed systems: multi-valued consensus,
vector consensus and atomic broadcast. These protocols
are designed as successive transformations from one to
another. The first protocol, multi-valued consensus, is
implemented on top of a randomized binary consensus and
a reliable broadcast protocol. The protocols share a
set of important structural properties. First, they do
not use digital signatures constructed with public-key
cryptography, a well-known performance bottleneck in
this kind of protocols. Second, they are time-free,
i.e. they make no synchrony assumptions, since these
assumptions are often vulnerable to subtle but
effective attacks. Third, they are completely
decentralized, thus avoiding the cost of detecting
corrupt leaders. Fourth, they have optimal resilience,
i.e. they tolerate the failure of $ f = \lfloor (n - 1)
/ 3 \rfloor $ out of a total of $n$ processes. In terms
of time complexity, the multi-valued consensus protocol
terminates in a constant expected number of rounds,
while the vector consensus and atomic broadcast
protocols have $ O(f) $ complexity. The paper also
proves the equivalence between multi-valued consensus
and atomic broadcast in the Byzantine failure model
without signatures. A similar proof is given for the
equivalence between multi-valued consensus and vector
consensus. These two results have theoretical relevance
since they show once more that consensus is a
fundamental problem in distributed systems.",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Cortier:2006:SAP,
author = "V{\'e}ronique Cortier and St{\'e}phanie Delaune and
Pascal Lafourcade",
title = "A survey of algebraic properties used in cryptographic
protocols",
journal = j-J-COMP-SECUR,
volume = "14",
number = "1",
pages = "1--43",
month = "????",
year = "2006",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2006-14101",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:04 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Cremers:2006:ISE,
author = "C. J. F. Cremers and S. Mauw and E. P. de Vink",
title = "Injective synchronisation: an extension of the
authentication hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "367",
number = "1--2",
pages = "139--161",
day = "24",
month = nov,
year = "2006",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Das:2006:NRU,
author = "Manik Lal Das and Ashutosh Saxena and Ved P. Gulati
and Deepak B. Phatak",
title = "A novel remote user authentication scheme using
bilinear pairings",
journal = j-COMPUT-SECUR,
volume = "25",
number = "3",
pages = "184--189",
month = may,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805001525",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Dean:2006:IMB,
author = "Roger Dean",
title = "Identity management --- back to the user",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "12",
pages = "4--7",
month = dec,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70460-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:34 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806704603",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Delaune:2006:DPS,
author = "St{\'e}phanie Delaune and Florent Jacquemard",
title = "Decision Procedures for the Security of Protocols with
Probabilistic Encryption against Offline Dictionary
Attacks",
journal = j-J-AUTOM-REASON,
volume = "36",
number = "1--2",
pages = "85--124",
month = jan,
year = "2006",
CODEN = "JAREEW",
DOI = "https://doi.org/10.1007/s10817-005-9017-7",
ISSN = "0168-7433 (print), 1573-0670 (electronic)",
ISSN-L = "0168-7433",
bibdate = "Sat Apr 2 11:12:47 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jautomreason.bib",
URL = "http://link.springer.com/article/10.1007/s10817-005-9017-7",
acknowledgement = ack-nhfb,
ajournal = "J. Autom. Reason.",
fjournal = "Journal of Automated Reasoning",
journal-URL = "http://link.springer.com/journal/10817",
}
@Article{Deng:2006:OOC,
author = "Yan-Xiang Deng and Chao-Jang Hwang and Jiang-Lung
Liu",
title = "An object-oriented cryptosystem based on two-level
reconfigurable computing architecture",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "4",
pages = "466--479",
month = apr,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@InProceedings{Diene:2006:DLE,
author = "Adama Diene and Jintai Ding and Jason E. Gower and
Timothy J. Hodges and Zhijun Yin",
title = "Dimension of the Linearization Equations of the
{Matsumoto--Imai} Cryptosystems",
crossref = "Ytrehus:2006:CCI",
pages = "242--251",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ding:2006:SSS,
author = "Cunsheng Ding and Arto Salomaa",
title = "Secret Sharing Schemes with Nice Access Structures",
journal = j-FUND-INFO,
volume = "73",
number = "1--2",
pages = "51--63",
month = oct,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:04:36 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{DiRaimondo:2006:PST,
author = "Mario {Di Raimondo} and Rosario Gennaro",
title = "Provably secure threshold password-authenticated key
exchange",
journal = j-J-COMP-SYS-SCI,
volume = "72",
number = "6",
pages = "978--1001",
month = sep,
year = "2006",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2006.02.002",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:01 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S002200000600033X",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Doyle:2006:SCK,
author = "Barry Doyle and Stuart Bell and Alan F. Smeaton and
Kealan McCusker and Noel E. O'Connor",
title = "Security Considerations and Key Negotiation Techniques
for Power Constrained Sensor Networks",
journal = j-COMP-J,
volume = "49",
number = "4",
pages = "443--453",
month = jul,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxl023",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Jun 23 11:56:45 MDT 2006",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue4/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/4/443;
http://comjnl.oxfordjournals.org/cgi/content/full/49/4/443;
http://comjnl.oxfordjournals.org/cgi/reprint/49/4/443",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@PhdThesis{Dunkelman:2006:TCB,
author = "Orr Dunkelman",
title = "Techniques for cryptanalysis of block ciphers",
type = "Thesis ({Ph.D.})",
school = "Faculty of Computer Science, Technion --- Israel
Institute of Technology",
address = "Haifa, Israel",
pages = "x + 204",
year = "2006",
bibdate = "Sat May 14 07:39:53 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
advisor = "Eli Biham",
remark = "Added title page and abstract in Hebrew.",
}
@InProceedings{Faure:2006:NPK,
author = "C{\'e}dric Faure and Pierre Loidreau",
title = "A New Public-Key Cryptosystem Based on the Problem of
Reconstructing $p$-Polynomials",
crossref = "Ytrehus:2006:CCI",
pages = "304--315",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Felke:2006:ATH,
author = "Patrick Felke",
title = "On the Affine Transformations of {HFE}-Cryptosystems
and Systems with Branches",
crossref = "Ytrehus:2006:CCI",
pages = "229--241",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Misc{Ferguson:2006:ACE,
author = "Niels Ferguson",
title = "{AES-CBC} + {Elephant} diffuser: A disk encryption
algorithm for {Windows Vista}",
howpublished = "Unknown",
year = "2006",
bibdate = "Mon Mar 09 12:02:09 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 36]{Schneier:2015:SWC}.",
}
@MastersThesis{Finnigin:2006:CPN,
author = "Kevin M. Finnigin",
title = "Cryptanalysis of Pseudorandom Number Generators in
Wireless Sensor Networks",
type = "{Master}'s thesis",
school = "Department of Electrical and Computer Engineering, Air
Force Institute of Technology",
address = "Wright-Patterson AFB, OH, USA",
year = "2006",
bibdate = "Fri May 13 06:41:39 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This work presents a brute-force attack on an elliptic
curve cryptosystem implemented on UC Berkeley's TinyOS
operating system for wireless sensor networks. The
attack exploits the short period of the pseudorandom
number generator (PRNG) used by the cryptosystem to
generate private keys. The attack assumes a laptop is
listening promiscuously to network traffic for key
messages and requires only the sensor node's public key
and network address to discover the private key.
Experimental results show that roughly 50\% of the
address space leads to a private key compromise in 25
minutes on average. Furthermore, approximately 32\% of
the address space leads to a compromise in 17 minutes
on average, 11\% in 6 minutes, and the remaining 7\% in
2 minutes or less. Two alternatives to the PRNG are
examined that mitigate the brute-force attack. The
alternatives are implemented on the Mica2 mote and
examined to determine CPU cycles for execution and
memory requirements. The recommended PRNG requires 73
CPU cycles in the worst case and uses 66 bytes of
memory. The period of the PRNG is uniform for all mote
addresses and theoretically requires 6.6 years on
average for a key compromise for the attack used in
this thesis.",
acknowledgement = ack-nhfb,
}
@Article{Frincke:2006:ESI,
author = "D. Frincke and S. Oudekirk and B. Popovsky",
title = "Editorial: {Special} issue on resources for the
computer security and information assurance curriculum:
{Issue 1}",
journal = j-JERIC,
volume = "6",
number = "3",
pages = "1:1--1:??",
month = sep,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1243481.1243482",
ISSN = "1531-4278",
bibdate = "Fri Jun 20 10:12:25 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/jeric/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This editorial introduces a set of articles in the
JERIC special issue on resources for the computer
security and information assurance curriculum. It
begins with a discussion of why such a special edition
is needed and continues by outlining the articles in
this volume, as follows: an innovative model for
security education based on teaching hospitals;
teaching context in computer security through
metaphors; tools supporting exploration of
cryptography; suggestions for a hands-on Linux course
geared towards a student population that includes
noncomputer scientists; and finally, projects suitable
for a course in computer forensics.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Journal on Educational Resources in Computing
(JERIC)",
keywords = "computer forensics; protection; security",
}
@Article{Furnell:2006:RPS,
author = "Steven Furnell and Leith Zekri",
title = "Replacing passwords: in search of the secret remedy",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "1",
pages = "4--8",
month = jan,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70321-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580670321X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Gallagher:2006:HSB,
author = "Tom Gallagher and Bryan Jeffries and Lawrence
Landauer",
title = "Hunting security bugs",
publisher = pub-MICROSOFT,
address = pub-MICROSOFT:adr,
pages = "xxv + 559",
year = "2006",
ISBN = "0-7356-2187-X",
ISBN-13 = "978-0-7356-2187-9",
LCCN = "QA76.9.A25 G356 2006",
bibdate = "Tue Jul 3 15:44:39 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Secure software development series",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer software; Testing;
Computer networks; Security measures",
}
@Article{Garcia-Pasquel:2006:GCT,
author = "Jes{\'u}s Adolfo Garc{\'\i}a-Pasquel and Jos{\'e}
Galaviz",
title = "{Ganz{\'u}a}: a cryptanalysis tool for monoalphabetic
and polyalphabetic ciphers",
journal = j-JERIC,
volume = "6",
number = "3",
pages = "4:1--4:??",
month = sep,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1243481.1243485",
ISSN = "1531-4278",
bibdate = "Fri Jun 20 10:12:25 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/jeric/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Many introductory courses to cryptology and computer
security start with or include a discussion of
classical ciphers that usually contemplates some
cryptanalysis techniques used to break them. Ganz{\'u}a
(picklock in Spanish) is an application designed to
assist the cryptanalysis of ciphertext obtained with
monoalphabetic or polyalphabetic ciphers. It can use
almost arbitrary character sets for the plain and
cipher alphabets as well as obtain the standard
relative frequencies of many languages and provide
other useful data.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Journal on Educational Resources in Computing
(JERIC)",
keywords = "classical cryptography; cryptology",
}
@Article{Gaudry:2006:ACM,
author = "P. Gaudry and T. Houtmann and D. Kohel and C.
Ritzenthaler and A. Weng",
title = "The $2$-Adic {CM} Method for Genus $2$ Curves with
Application to Cryptography",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4284",
pages = "114--129",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11935230_8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 13 08:42:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/11935230_8.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/11935230",
book-URL = "http://www.springerlink.com/content/978-3-540-49476-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Gennaro:2006:FPB,
author = "Rosario Gennaro and Yehuda Lindell",
title = "A framework for password-based authenticated key
exchange",
journal = j-TISSEC,
volume = "9",
number = "2",
pages = "181--234",
month = may,
year = "2006",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1151414.1151418",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Sat Aug 26 08:10:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this paper, we present a general framework for
password-based authenticated key exchange protocols, in
the common reference string model. Our protocol is
actually an abstraction of the key exchange protocol of
Katz et al. and is based on the recently introduced
notion of smooth projective hashing by Cramer and
Shoup. We gain a number of benefits from this
abstraction. First, we obtain a modular protocol that
can be described using just three high-level
cryptographic tools. This allows a simple and intuitive
understanding of its security. Second, our proof of
security is significantly simpler and more modular.
Third, we are able to derive analogs to the Katz et al.
protocol under additional cryptographic assumptions.
Specifically, in addition to the DDH assumption used by
Katz et al., we obtain protocols under both the
quadratic and N-residuosity assumptions. In order to
achieve this, we construct new smooth projective hash
functions.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Gennaro:2006:RC,
author = "Rosario Gennaro",
title = "Randomness in Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "2",
pages = "64--67",
month = mar # "\slash " # apr,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.49",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Apr 3 07:36:16 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@InProceedings{Gentry:2006:EES,
author = "Craig Gentry and Zulfikar Ramzan and David P.
Woodruff",
title = "Explicit Exclusive Set Systems with Applications to
Broadcast Encryption",
crossref = "IEEE:2006:AIS",
pages = "27--38",
year = "2006",
DOI = "https://doi.org/10.1109/FOCS.2006.27",
bibdate = "Thu Apr 12 09:33:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329",
}
@Article{Giraud:2006:RIR,
author = "C. Giraud",
title = "An {RSA} Implementation Resistant to Fault Attacks and
to Simple Power Analysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "9",
pages = "1116--1120",
month = sep,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.135",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1668039",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Gonda:2006:NMR,
author = "J. Gonda",
title = "The Number of the Modulo $n$ Roots of the Polynomial $
x^v $ --- $ x^v $ and the {RSA}",
journal = j-J-UCS,
volume = "12",
number = "9",
pages = "1215--1228",
month = "????",
year = "2006",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_12_9/the_number_of_the",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Gordon:2006:UAV,
author = "Sarah Gordon",
title = "Understanding the Adversary: Virus Writers and
Beyond",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "5",
pages = "67--70",
month = sep # "\slash " # oct,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.137",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Oct 24 17:28:29 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Goshi:2006:ADM,
author = "Justin Goshi and Richard E. Ladner",
title = "Algorithms for dynamic multicast key distribution",
journal = j-ACM-J-EXP-ALGORITHMICS,
volume = "11",
pages = "1.4:1--1.4:??",
month = "????",
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1187436.1210587",
ISSN = "1084-6654",
bibdate = "Mon Oct 6 16:06:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We study the problem of multicast key distribution for
group security. Secure group communication systems
typically rely on a group key, which is a secret shared
among the members of the group. This key is used to
provide privacy by encrypting all group communications.
Because groups can be large and highly dynamic, it
becomes necessary to change the group key in a scalable
and secure fashion when members join and leave the
group. We present a series of algorithms for solving
this problem based on key trees. The algorithms attempt
to minimize the worst-case communication cost of
updates by maintaining balanced key tree structures. We
focus on the trade-off between the communication cost
because of the structure of the tree and that due to
the overhead of restructuring the tree to maintain its
balanced structure. The algorithms are analyzed for
worst-case tree structure bounds and evaluated
empirically via simulations.",
acknowledgement = ack-nhfb,
articleno = "1.4",
fjournal = "Journal of Experimental Algorithmics (JEA)",
keywords = "dynamic key distribution; experimental algorithms;
multicast",
}
@Article{Granger:2006:SCA,
author = "R. Granger and D. Page and M. Stam",
title = "On Small Characteristic Algebraic Tori in
Pairing-Based Cryptography",
journal = j-LMS-J-COMPUT-MATH,
volume = "9",
pages = "64--85",
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1112/S1461157000001194",
ISSN = "1461-1570",
bibdate = "Tue Oct 25 07:42:19 MDT 2011",
bibsource = "http://journals.cambridge.org/action/displayJournal?jid=JCM;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lms-j-comput-math.bib",
acknowledgement = ack-nhfb,
ajournal = "LMS J. Comput. Math.",
fjournal = "LMS Journal of Computation and Mathematics",
onlinedate = "01 February 2010",
}
@Article{Gratzer:2006:CLE,
author = "Vanessa Gratzer and David Naccache",
title = "Cryptography, Law Enforcement, and Mobile
Communications",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "67--70",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.148",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Guizzo:2006:BIC,
author = "Erico Guizzo",
title = "Britain's identity crisis [biometric ID cards]",
journal = j-IEEE-SPECTRUM,
volume = "43",
number = "1",
pages = "42--43",
month = jan,
year = "2006",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2006.1572352",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "biometric ID cards; Biometrics; biometrics (access
control); Britain; Computer architecture; Cryptography;
Data privacy; Data security; database management
systems; Databases; Government; government data
processing; government-controlled central database;
identity crisis; Identity management systems; identity
theft; Insurance; microchip; National security;
personal information; terrorism; UK",
}
@TechReport{Gutterman:2006:ALR,
author = "Zvi Gutterman and Benny Pinkas and Tzachy Reinman",
title = "Analysis of the {Linux} Random Number Generator",
type = "Report",
institution = "The Hebrew University of Jerusalem and University of
Haifa",
address = "Jerusalem and Haifa, Israel",
pages = "18",
day = "6",
month = mar,
year = "2006",
bibdate = "Sat Dec 24 11:30:48 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.pinkas.net/PAPERS/gpr06.pdf",
abstract = "Linux is the most popular open source project. The
Linux random number generator is part of the kernel of
all Linux distributions and is based on generating
randomness from entropy of operating system events. The
output of this generator is used for almost every
security protocol, including TLS/SSL key generation,
choosing TCP sequence numbers, and file system and
email encryption. Although the generator is part of an
open source project, its source code (about 2500 lines
of code) is poorly documented, and patched with
hundreds of code patches.\par We used dynamic and
static reverse engineering to learn the operation of
this generator. This paper presents a description of
the underlying algorithms and exposes several security
vulnerabilities. In particular, we show an attack on
the forward security of the generator which enables an
adversary who exposes the state of the generator to
compute previous states and outputs. In addition we
present a few cryptographic flaws in the design of the
generator, as well as measurements of the actual
entropy collected by it, and a critical analysis of the
use of the generator in Linux distributions on
disk-less devices.",
acknowledgement = ack-nhfb,
}
@Article{Hanaoka:2006:USA,
author = "Goichiro Hanaoka and Junji Shikata and Yumiko Hanaoka
and Hideki Imai",
title = "Unconditionally Secure Anonymous Encryption and Group
Authentication",
journal = j-COMP-J,
volume = "49",
number = "3",
pages = "310--321",
month = may,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh149",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Apr 21 15:45:40 MDT 2006",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue3/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/3/310;
http://comjnl.oxfordjournals.org/cgi/content/full/49/3/310;
http://comjnl.oxfordjournals.org/cgi/reprint/49/3/310",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Harnik:2006:CNI,
author = "Danny Harnik and Moni Naor",
title = "On the Compressibility of {NP} Instances and
Cryptographic Applications",
crossref = "IEEE:2006:AIS",
pages = "719--728",
year = "2006",
DOI = "https://doi.org/10.1109/FOCS.2006.54",
bibdate = "Thu Apr 12 09:33:15 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329",
}
@Article{Hars:2006:MIA,
author = "Laszlo Hars",
title = "Modular Inverse Algorithms Without Multiplications for
Cryptographic Applications",
journal = j-EURASIP-J-EMBED-SYS,
volume = "2006",
pages = "1--13",
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1155/ES/2006/32192",
ISSN = "1687-3955 (print), 1687-3963 (electronic)",
ISSN-L = "1687-3955",
bibdate = "Wed Dec 28 09:54:06 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "Article ID 32192.",
URL = "http://downloads.hindawi.com/journals/es/2006/032192.pdf",
abstract = "Hardware and algorithmic optimization techniques are
presented to the left-shift, right-shift, and the
traditional Euclidean-modular inverse algorithms.
Theoretical arguments and extensive simulations
determined the resulting expected running time. On many
computational platforms these turn out to be the
fastest known algorithms for moderate operand lengths.
They are based on variants of Euclidean-type extended
GCD algorithms. On the considered computational
platforms for operand lengths used in cryptography, the
fastest presented modular inverse algorithms need about
twice the time of modular multiplications, or even
less. Consequently, in elliptic curve cryptography
delaying modular divisions is slower (affine
coordinates are the best) and the RSA and ElGamal
cryptosystems can be accelerated.",
acknowledgement = ack-nhfb,
fjournal = "EURASIP Journal on Embedded Systems",
}
@Book{Haufler:2006:SWN,
author = "Hervie Haufler",
title = "The spies who never were: the true story of the {Nazi}
spies who were actually {Allied} double agents",
publisher = "NAL Caliber",
address = "New York, NY, USA",
pages = "????",
year = "2006",
ISBN = "0-451-21751-9 (paperback)",
ISBN-13 = "978-0-451-21751-6 (paperback)",
LCCN = "D810.S7 H37 2006",
bibdate = "Thu Feb 23 07:18:53 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0517/2005022622.html",
acknowledgement = ack-nhfb,
keywords = "Arthur George Owens; Balloon; Britain's Twenty
Committee (XX or Double Cross); Dusko Popov; Eddie
Chapman; Elvira Chaudoir; Hamlet; Juan Pujol (Garbo);
Lipstick; Puppet",
remark = "The most delicious irony -- Masterminds of the double
cross -- ``Ultra,'' the double agents' indispensable
ally -- In the beginning, snow -- Tricycle, the
Abwehr's Yugoslav socialite -- Tate, convert from
Naziism -- ZigZag, the most daring -- Codename
``Brutus'' -- Treasure, ``first violin'' in the
deception ``orchestra'' -- Garbo, the greatest -- Mutt,
Jeff, and other lesser agents -- Tricycle's American
misadventure -- Trickery in the Middle East -- For
Operation Torch, strategic deceptions -- Anywhere but
Sicily -- Prelude to fortitude -- Double cross in
jeopardy -- The ``grand strategic deception'' --
Deceptions beyond D-Day -- The final reckoning..",
subject = "World War, 1939-1945; Secret service; Germany; Great
Britain; Espionage; History; 20th century",
}
@Book{Hayashi:2006:QIT,
author = "Masahito Hayashi",
title = "Quantum Information Theory: An Introduction",
publisher = pub-SV,
address = pub-SV:adr,
year = "2006",
ISBN = "3-540-30265-4",
ISBN-13 = "978-3-540-30265-0",
LCCN = "????",
bibdate = "Tue Jun 13 10:22:34 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
URL = "http://www.springer.com/dal/home?SGWID=1-102-22-100724694-0",
acknowledgement = ack-nhfb,
keywords = "quantum encryption; quantum state transmission
(quantum error-correction); quantum teleportation;
superdense coding",
publishersnote = "This graduate-level textbook provides a unified
viewpoint of quantum information theory that merges key
topics from both the information-theoretic and quantum-
mechanical viewpoints. The text provides a unified
viewpoint of quantum information theory and lucid
explanations of those basic results, so that the reader
fundamentally grasps advances and challenges. This
unified approach makes accessible such advanced topics
in quantum communication as quantum teleportation,
superdense coding, quantum state transmission (quantum
error-correction), and quantum encryption.",
}
@PhdThesis{Henderson:2006:CBG,
author = "Roger William Henderson",
title = "Cryptanalysis of braid group cryptosystem and related
combinatorial structures",
type = "Thesis ({Ph.D.})",
school = "University of London",
address = "London, UK",
pages = "????",
year = "2006",
bibdate = "Fri May 13 05:50:36 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Henry:2006:TFA,
author = "Paul A. Henry",
title = "Two-factor authentication --- a look behind the
headlines",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "4",
pages = "18--19",
month = apr,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70360-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:25 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806703609",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Hernandez-Castro:2006:SGG,
author = "Julio C. Hernandez-Castro and Ignacio Blasco-Lopez and
Juan M. Estevez-Tapiador and Arturo
Ribagorda-Garnacho",
title = "Steganography in games: a general methodology and its
application to the game of Go",
journal = j-COMPUT-SECUR,
volume = "25",
number = "1",
pages = "64--71",
month = feb,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805002002",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Herranz:2006:DIB,
author = "Javier Herranz",
title = "Deterministic Identity-Based Signatures for Partial
Aggregation",
journal = j-COMP-J,
volume = "49",
number = "3",
pages = "322--330",
month = may,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh153",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Fri Apr 21 15:45:40 MDT 2006",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue3/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/3/322;
http://comjnl.oxfordjournals.org/cgi/content/full/49/3/322;
http://comjnl.oxfordjournals.org/cgi/reprint/49/3/322",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Hilley:2006:SSD,
author = "Sarah Hilley",
title = "{Secret Service} dismantles web forums",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "4",
pages = "20--20",
month = apr,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70361-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:25 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806703610",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Hiltgen:2006:SIB,
author = "Alain Hiltgen and Thorsten Kramp and Thomas Weigold",
title = "Secure {Internet} Banking Authentication",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "2",
pages = "21--29",
month = mar # "\slash " # apr,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.50",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Mon Apr 3 07:36:16 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@InProceedings{Hoffstein:2006:NNE,
author = "J. Hoffstein and N. Howgrave-Graham",
booktitle = "{PQCrypto 2006: International Workshop on Post-Quantum
Cryptography}",
title = "{NTRUEncrypt} and {NTRUSign}: efficient public-key
algorithms for a post-quantum world",
publisher = pub-SV,
address = pub-SV:adr,
pages = "141--158",
year = "2006",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Thu Apr 21 13:39:07 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Hoglund:2006:RSW,
author = "Greg Hoglund and James Butler",
title = "Rootkits: subverting the {Windows} kernel",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxiii + 324",
year = "2006",
ISBN = "0-321-29431-9 (paperback)",
ISBN-13 = "978-0-321-29431-9 (paperback)",
LCCN = "QA76.9.A25 H637 2006",
bibdate = "Mon Oct 3 18:58:18 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0512/2005013061.html",
acknowledgement = ack-nhfb,
subject = "Microsoft Windows (Computer file); Computers; Access
control; Computer security",
}
@Article{Hoskins:2006:SO,
author = "Matthew E. Hoskins",
title = "Securing {openSSH}",
journal = j-LINUX-J,
volume = "2006",
number = "147",
pages = "??--??",
month = jul,
year = "2006",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Wed Aug 23 06:09:28 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Hoskins:2006:SSE,
author = "Matthew E. Hoskins",
title = "{SSHFS}: super easy file access over {SSH}",
journal = j-LINUX-J,
volume = "2006",
number = "146",
pages = "??--??",
month = jun,
year = "2006",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Wed Aug 23 06:09:27 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Book{Howard:2006:SDL,
author = "Michael Howard and Steve Lipner",
title = "The security development lifecycle: {SDL}, a process
for developing demonstrably more secure software",
publisher = pub-MICROSOFT,
address = pub-MICROSOFT:adr,
pages = "xxii + 320",
year = "2006",
ISBN = "0-7356-2214-0",
ISBN-13 = "978-0-7356-2214-2",
LCCN = "QA76.76.D47 H74 2006",
bibdate = "Wed Feb 21 14:24:56 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Secure software development series",
acknowledgement = ack-nhfb,
subject = "Computer software; Development; Computer security;
Reliability",
}
@Article{Huang:2006:CSV,
author = "Biao-Bing Huang and Shao-Xian Tang",
title = "A Contrast-Sensitive Visible Watermarking Scheme",
journal = j-IEEE-MULTIMEDIA,
volume = "13",
number = "2",
pages = "60--66",
month = apr # "\slash " # jun,
year = "2006",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2006.23",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Jul 2 18:03:18 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Impagliazzo:2006:LRA,
author = "Russell Impagliazzo and Bruce M. Kapron",
title = "Logics for reasoning about cryptographic
constructions",
journal = j-J-COMP-SYS-SCI,
volume = "72",
number = "2",
pages = "286--320",
month = mar,
year = "2006",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2005.06.008",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:26:59 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000005000929",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@InProceedings{Ishai:2006:CA,
author = "Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky
and Amit Sahai",
title = "Cryptography from Anonymity",
crossref = "IEEE:2006:AIS",
pages = "239--248",
year = "2006",
DOI = "https://doi.org/10.1109/FOCS.2006.25",
bibdate = "Thu Apr 12 09:33:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329",
}
@Article{Iwamoto:2006:SSR,
author = "Mitsugu Iwamoto and Hirosuke Yamamoto",
title = "Strongly secure ramp secret sharing schemes for
general access structures",
journal = j-INFO-PROC-LETT,
volume = "97",
number = "2",
pages = "52--57",
day = "31",
month = jan,
year = "2006",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:41:06 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Izmerly:2006:CCA,
author = "Oleg Izmerly and Tal Mor",
title = "Chosen ciphertext attacks on lattice-based public key
encryption and modern (non-quantum) cryptography in a
quantum environment",
journal = j-THEOR-COMP-SCI,
volume = "367",
number = "3",
pages = "308--323",
day = "1",
month = dec,
year = "2006",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:29 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Jain:2006:TMB,
author = "A. K. Jain and S. Pankanti",
title = "A touch of money [biometric authentication systems]",
journal = j-IEEE-SPECTRUM,
volume = "43",
number = "7",
pages = "22--27",
month = jul,
year = "2006",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2006.1653001",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Authentication; biometric authentication systems;
biometric sensors; Biometrics; Biosensors; Companies;
computer crime; credit card transactions; Credit cards;
credit transactions; data privacy; fingerprint
identification; Fingerprint recognition; fingerprint
sensors; identity thieves prevention; infrastructure
investments; Internet; Internet telephony;
Internet-based retailer; Privacy; privacy protection;
Protection; Sensor systems; sensors",
}
@Book{Janeczko:2006:TSH,
author = "Paul B. Janeczko",
title = "Top Secret: a Handbook of Codes, Ciphers and Secret
Writing",
publisher = "Candlewick Press",
address = "Cambridge, MA, USA",
pages = "144 (est.)",
year = "2006",
ISBN = "0-439-87560-9",
ISBN-13 = "978-0-439-87560-8",
LCCN = "????",
bibdate = "Sat May 15 16:59:52 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
subject = "cryptography; juvenile literature; ciphers",
}
@Article{Jeng:2006:EKM,
author = "Fuh-Gwo Jeng and Chung-Ming Wang",
title = "An efficient key-management scheme for hierarchical
access control based on elliptic curve cryptosystem",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "8",
pages = "1161--1167",
month = aug,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Juric:2006:CPW,
author = "Matjaz B. Juric and Ivan Rozman and Bostjan Brumen and
Matjaz Colnaric and Marjan Hericko",
title = "Comparison of performance of {Web} services,
{WS-Security}, {RMI}, and {RMI--SSL}",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "5",
pages = "689--700",
month = may,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Kacprzak:2006:CBS,
author = "Magdalena Kacprzak and Alessio Lomuscio and Artur
Niewiadomski and Wojciech Penczek and Franco Raimondi
and Maciej Szreter",
title = "Comparing {BDD} and {SAT} Based Techniques for Model
Checking {Chaum}'s Dining Cryptographers Protocol",
journal = j-FUND-INFO,
volume = "72",
number = "1--3",
pages = "215--234",
month = sep,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:04:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Kak:2006:TSQ,
author = "Subhash Kak",
title = "A Three-Stage Quantum Cryptography Protocol",
journal = j-FOUND-PHYS-LETT,
volume = "19",
number = "3",
pages = "293--296",
month = jun,
year = "2006",
CODEN = "FPLEET",
ISSN = "0894-9875 (print), 1572-9524 (electronic)",
ISSN-L = "0894-9875",
bibdate = "Sat Jun 3 17:35:13 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/foundphyslett.bib",
acknowledgement = ack-nhfb,
fjournal = "Foundations of Physics Letters",
journal-URL = "http://link.springer.com/journal/10702",
}
@Article{Kakarountas:2006:HSF,
author = "Athanasios P. Kakarountas and Haralambos Michail and
Athanasios Milidonis and Costas E. Goutis and George
Theodoridis",
title = "High-Speed {FPGA} Implementation of Secure Hash
Algorithm for {IPSec} and {VPN} Applications",
journal = j-J-SUPERCOMPUTING,
volume = "37",
number = "2",
pages = "179--195",
month = aug,
year = "2006",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-006-5682-5",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 9 17:32:28 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=37&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
jsuper.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=37&issue=2&spage=179",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
keywords = "FPGA; hardware implementation; hash function;
high-speed performance; Security",
}
@Article{Kawachi:2006:PQC,
author = "A. Kawachi and T. Koshiba",
title = "Progress in Quantum Computational Cryptography",
journal = j-J-UCS,
volume = "12",
number = "6",
pages = "691--709",
month = "????",
year = "2006",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:40 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_12_6/progress_in_quantum_computational",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Keromytis:2006:COS,
author = "Angelos D. Keromytis and Jason L. Wright and Theo {De
Raadt} and Matthew Burnside",
title = "Cryptography as an operating system service: a case
study",
journal = j-TOCS,
volume = "24",
number = "1",
pages = "1--38",
month = feb,
year = "2006",
CODEN = "ACSYEC",
DOI = "https://doi.org/10.1145/1124153.1124154",
ISSN = "0734-2071 (print), 1557-7333 (electronic)",
ISSN-L = "0734-2071",
bibdate = "Fri Apr 7 08:15:08 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tocs/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Cryptographic transformations are a fundamental
building block in many security applications and
protocols. To improve performance, several vendors
market hardware accelerator cards. However, until now
no operating system provided a mechanism that allowed
both uniform and efficient use of this new type of
resource. We present the OpenBSD Cryptographic
Framework (OCF), a service virtualization layer
implemented inside the operating system kernel, that
provides uniform access to accelerator functionality by
hiding card-specific details behind a carefully
designed API. We evaluate the impact of the OCF in a
variety of benchmarks, measuring overall system
performance, application throughput and latency, and
aggregate throughput when multiple applications make
use of it. We conclude that the OCF is extremely
efficient in utilizing cryptographic accelerator
functionality, attaining 95\% of the theoretical peak
device performance and over 800 Mbps aggregate
throughput using 3DES. We believe that this validates
our decision to opt for ease of use by applications and
kernel components through a uniform API and for
seamless support for new accelerators. Furthermore, our
evaluation points to several bottlenecks in system and
operating system design: data copying between user and
kernel modes, PCI bus signaling inefficiency, protocols
that use small data units, and single-threaded
applications. We identify some of these limitations
through a set of measurements focusing on
application-layer cryptographic protocols such as SSL.
We offer several suggestions for improvements and
directions for future work. We provide experimental
evidence of the effectiveness of a new approach which
we call operating system shortcutting. Shortcutting can
improve the performance of application-layer
cryptographic protocols by 27\% with very small changes
to the kernel.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Computer Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774",
}
@Article{Kettani:2006:CBN,
author = "Houssain Kettani",
title = "On the Conversion Between Number Systems",
journal = j-IEEE-TRANS-CIRCUITS-SYST-2,
volume = "53",
number = "11",
pages = "1255--1258",
month = nov,
year = "2006",
CODEN = "ICSPE5",
DOI = "https://doi.org/10.1109/TCSII.2006.882856",
ISSN = "1057-7130 (print), 1558-125X (electronic)",
ISSN-L = "1057-7130",
bibdate = "Mon Mar 19 10:05:23 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This brief revisits the problem of conversion between
number systems and asks the following question: given a
nonnegative decimal number, what is the value of the
digit at position in the corresponding base number?
Thus, we do not require the knowledge of other digits
except the one we are interested in. Accordingly, we
present a conversion function that relates each digit
in a base system to the decimal value that is equal to
the base number in question. We also show some
applications of this new algorithm in the areas of
parallel computing and cryptography.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Circuits and Systems. 2, Analog
and Digital Signal Processing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=82",
keywords = "Algorithm's efficiency; base numbers; conversion",
}
@Article{Kiely:2006:SSM,
author = "Laree Kiely and Terry V. Benzel",
title = "Systemic Security Management",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "74--77",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.167",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@InProceedings{Klivans:2006:CHL,
author = "Adam R. Klivans and Alexander A. Sherstov",
title = "Cryptographic Hardness for Learning Intersections of
Halfspaces",
crossref = "IEEE:2006:AIS",
pages = "553--562",
year = "2006",
DOI = "https://doi.org/10.1109/FOCS.2006.24",
bibdate = "Thu Apr 12 09:33:08 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329",
}
@Article{Kogan:2006:IER,
author = "Noam Kogan and Tamir Tassa",
title = "Improved efficiency for revocation schemes via
{Newton} interpolation",
journal = j-TISSEC,
volume = "9",
number = "4",
pages = "461--486",
month = nov,
year = "2006",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1187441.1187444",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:51:51 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present a novel way to implement the
secret-sharing-based family of revocation schemes of
Naor and Pinkas [2003]. The basic scheme of [Naor and
Pinkas 2000] uses Shamir's polynomial secret-sharing to
revoke up to r users, where r is the degree of the
secret-sharing polynomial, and it is information
theoretically secure against coalitions of up to r
collaborators. The nonrevoked users use Lagrange
interpolation in order to compute the new key. Our
basic scheme uses a novel modification of Shamir's
polynomial secret-sharing: The secret equals the
leading coefficient of the polynomial (as opposed to
the free coefficient as in the original scheme) and the
polynomial is reconstructed by Newton interpolation
(rather than Lagrange interpolation). Comparing our
scheme to one variant of the Naor--Pinkas scheme, we
offer revocation messages that are shorter by a factor
of almost 2, while the computation cost at the user end
is smaller by a constant factor of approximately 13/2.
Comparing to a second variant of the Naor--Pinkas
scheme, our scheme offers a reduction of O ( r ) in the
computation cost at the user end, without affecting any
of the other performance parameters. We then extend our
basic scheme to perform multiround revocation for
stateless and stateful receivers, along the lines
offered by Naor and Pinkas [2000] and Kogan et al.
[2003]. We show that using Newton rather than Lagrange
interpolants enables a significantly more efficient
transmission of the new revocation message and shorter
response time for each round. Pay TV systems that
implement broadcast encryption techniques can benefit
significantly from the improved efficiency offered by
our revocation schemes.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "broadcast encryption; Newton interpolation; secret
sharing; User revocation",
}
@Article{Kogan:2006:PRS,
author = "Noam Kogan and Yuval Shavitt and Avishai Wool",
title = "A practical revocation scheme for broadcast encryption
using smartcards",
journal = j-TISSEC,
volume = "9",
number = "3",
pages = "325--351",
month = aug,
year = "2006",
CODEN = "ATISBQ",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Wed Nov 15 06:44:34 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Kumar:2006:ODS,
author = "Sandeep Kumar and T. Wollinger and C. Paar",
title = "Optimum Digit Serial {$ \mathrm {GF}(2^m) $}
Multipliers for Curve-Based Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "10",
pages = "1306--1311",
month = oct,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.165",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:57 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1683761",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Kurkowski:2006:QFF,
author = "Miros{\l}aw Kurkowski and Marian Srebrny",
title = "A Quantifier-free First-order Knowledge Logic of
Authentication",
journal = j-FUND-INFO,
volume = "72",
number = "1--3",
pages = "263--282",
month = sep,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:04:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Ladd:2006:SPS,
author = "David Ladd",
title = "A Software Procurement and Security Primer",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "71--73",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.142",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Lamenca-Martinez:2006:LNP,
author = "Carlos Lamenca-Martinez and Julio Cesar
Hernandez-Castro and Juan M. Estevez-Tapiador and
Arturo Ribagorda",
title = "{Lamar}: a New Pseudorandom Number Generator Evolved
by Means of Genetic Programming",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4193",
pages = "850--859",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11844297_86",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Feb 01 16:33:08 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.springerlink.com/content/c60q42qt2m035685/",
abstract = "Pseudorandom number generation is a key component of
many Computer Science algorithms, including
mathematical modeling, stochastic processes, Monte
Carlo simulations, and most cryptographic primitives
and protocols. To date, multiple approaches that use
Evolutionary Computation (EC) techniques have been
proposed for designing useful Pseudorandom Number
Generators (PRNGs) for certain non-cryptographic
applications. However, none of the proposals have been
secure nor efficient enough to be of interest for the
much more demanding crypto world. In this work, we
present a general scheme, which uses Genetic
Programming (GP), for the automatic design of
crypto-quality PRNGs by evolving highly nonlinear and
extremely efficient functions. A new PRNG named Lamar
and obtained using this scheme is proposed, whose C
code and preliminary security analysis are provided.",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
}
@Article{Lavington:2006:FCD,
author = "Simon Lavington",
title = "In the Footsteps of {Colossus}: a Description of
{Oedipus}",
journal = j-IEEE-ANN-HIST-COMPUT,
volume = "28",
number = "2",
pages = "44--55",
month = apr # "\slash " # jun,
year = "2006",
CODEN = "IAHCEX",
DOI = "https://doi.org/10.1109/MAHC.2006.34",
ISSN = "1058-6180 (print), 1934-1547 (electronic)",
ISSN-L = "1058-6180",
bibdate = "Tue Oct 17 06:34:16 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "A number of cryptanalysis projects were developed in
the UK during the postwar years 1945?1955. One of the
most significant of these was Oedipus, a
special-purpose rapid analytical machine using novel
digital storage. Oedipus was developed by GCHQ and the
UK companies Elliott and Ferranti. Oedipus contained a
large semiconductor associative memory, a magnetic drum
with on-the-fly searching, and a high-speed RAM cache.
Its history has only recently been made publicly
available.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Annals of the History of Computing",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85",
}
@Article{Law:2006:SBB,
author = "Yee Wei Law and Jeroen Doumen and Pieter Hartel",
title = "Survey and benchmark of block ciphers for wireless
sensor networks",
journal = j-TOSN,
volume = "2",
number = "1",
pages = "65--93",
month = feb,
year = "2006",
CODEN = "????",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Aug 28 07:01:48 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
}
@Article{Lee:2006:DCK,
author = "Patrick P. C. Lee and John C. S. Lui and David K. Y.
Yau",
title = "Distributed collaborative key agreement and
authentication protocols for dynamic peer groups",
journal = j-IEEE-TRANS-NETWORKING,
volume = "14",
number = "2",
pages = "263--276",
month = apr,
year = "2006",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.872575",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Sat Feb 8 09:00:28 MST 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We consider several distributed collaborative key
agreement and authentication protocols for dynamic peer
groups. There are several important characteristics
which make this problem different from traditional
secure group communication. They are: (1) distributed
nature in which there is no centralized key server; (2)
collaborative nature in which the group key is
contributory (i.e., each group member will
collaboratively contribute its part to the global group
key); and (3) dynamic nature in which existing members
may leave the group while new members may join. Instead
of performing individual rekeying operations, i.e.,
recomputing the group key after every join or leave
request, we discuss an interval-based approach of
rekeying. We consider three interval-based distributed
rekeying algorithms, or interval-based algorithms for
short, for updating the group key: (1) the Rebuild
algorithm; (2) the Batch algorithm; and (3) the
Queue-batch algorithm. Performance of these three
interval-based algorithms under different settings,
such as different join and leave probabilities, is
analyzed. We show that the interval-based algorithms
significantly outperform the individual rekeying
approach and that the Queue-batch algorithm performs
the best among the three interval-based algorithms.
More importantly, the Queue-batch algorithm can
substantially reduce the computation and communication
workload in a highly dynamic environment. We further
enhance the interval-based algorithms in two aspects:
authentication and implementation. Authentication
focuses on the security improvement, while
implementation realizes the interval-based algorithms
in real network settings. Our work provides a
fundamental understanding about establishing a group
key via a distributed and collaborative approach for a
dynamic peer group.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
}
@Article{Lee:2006:ISC,
author = "Wei-Bin Lee and Kuan-Chieh Liao",
title = "Improved self-certified group-oriented cryptosystem
without a combiner",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "4",
pages = "502--506",
month = apr,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Lehtinen:2006:CSB,
author = "Rick Lehtinen",
title = "Computer Security Basics",
publisher = pub-ORA,
address = pub-ORA:adr,
edition = "Second",
pages = "306 (est.)",
year = "2006",
ISBN = "0-596-00669-1",
ISBN-13 = "978-0-596-00669-3",
LCCN = "????",
bibdate = "Sat Jun 17 20:11:18 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
price = "EUR 38.00",
acknowledgement = ack-nhfb,
}
@Book{Lemke:2006:ESC,
editor = "Kerstin Lemke and Christof Paar and Marko Wolf",
title = "Embedded security in cars: securing current and future
automotive {IT} applications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 273",
year = "2006",
ISBN = "3-540-28384-6",
ISBN-13 = "978-3-540-28384-3",
LCCN = "TL275.E53 2006",
bibdate = "Mon Jun 12 18:18:03 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.mit.edu:9909/mit01",
acknowledgement = ack-nhfb,
remark = "With 53 figures and 25 tables.",
subject = "Automobiles; Anti-theft devices; Design and
construction; Embedded computer systems; Automobile
theft; Prevention",
tableofcontents = "Embedded IT security in automotive application - an
emerging area / Christof Paar \\
Aspects of secure vehicle software flashing / Winfried
Stephan, Solveig Richter and Markus Muller \\
Secure software delivery and installation in embedded
systems / Andre Adelsbach, Ulrich Huber and Ahmad-Reza
Sadeghi \\
Anti-theft protection: electronic immobilizers /
Kerstin Lemke, Ahmad-Reza Sadeghi and Christian Stuble
\\
A review of the digital tachograph system / Igor Furgel
and Kerstin Lemke \\
Secure in-vehicle communication / Marko Wolf, Andre
Weimerskirch and Christof Paar \\
A survey of research in inter-vehicle communications /
Jun Luo and Jean-Pierre Hubaux \\
Fundamentals of symmetric cryptography / Sandeep Kumar
and Thomas Wollinger \\
Fundamentals of asymmetric cryptography / Thomas
Wollinger and Sandeep Kumar \\
Security aspects of mobile communication systems / Jan
Pelzl and Thomas Wollinger \\
Embedded cryptography: side channel attacks / Kai
Schramm, Kerstin Lemke and Christof Paar \\
Embedded security: physical protection against
tampering attacks / Kerstin Lemke \\
Automotive digital rights management systems / Marko
Wolf, Andre Weimerskirch and Christof Paar \\
Security risks and business opportunities in In-Car
entertainment / Marcus Heitmann \\
In-vehicle M-commerce: business models for navigation
systems and location-based services / Klaus Rudiger and
Martin Gersch",
}
@InProceedings{Levy-dit-Vehel:2006:WC,
author = "Fran{\c{c}}oise Levy-dit-Vehel and Ludovic Perret",
title = "On the {Wagner--Magyarik} Cryptosystem",
crossref = "Ytrehus:2006:CCI",
pages = "316--329",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Li:2006:ESY,
author = "Chengqing Li and Shujun Li and Der-Chyuan Lou and Dan
Zhang",
title = "Erratum to {``On the security of the Yen-Guo's domino
signal encryption algorithm (DSEA)'' [The Journal of
Systems and Software 79 (2006) 253--258]}",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "12",
pages = "1789--1789",
month = dec,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
note = "See \cite{Li:2006:SYG}.",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Li:2006:PMW,
author = "Li Li and Zhigeng Pan and David Zhang",
title = "A Public Mesh Watermarking Algorithm Based on Addition
Property of {Fourier Transform}",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "6",
number = "1",
pages = "35--??",
month = jan,
year = "2006",
CODEN = "????",
ISSN = "0219-4678",
bibdate = "Wed Aug 23 08:55:54 MDT 2006",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Li:2006:SYG,
author = "Chengqing Li and Shujun Li and Der-Chyuan Lou and Dan
Zhang",
title = "On the security of the {Yen--Guo}'s domino signal
encryption algorithm {(DSEA)}",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "2",
pages = "253--258",
month = feb,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
note = "See erratum \cite{Li:2006:ESY}.",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Liao:2006:PAS,
author = "I-En Liao and Cheng-Chi Lee and Min-Shiang Hwang",
title = "A password authentication scheme over insecure
networks",
journal = j-J-COMP-SYS-SCI,
volume = "72",
number = "4",
pages = "727--740",
month = jun,
year = "2006",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2005.10.001",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:00 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000005001157",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Lindell:2006:CAB,
author = "Yehuda Lindell and Anna Lysyanskaya and Tal Rabin",
title = "On the composition of authenticated {Byzantine
Agreement}",
journal = j-J-ACM,
volume = "53",
number = "6",
pages = "881--917",
month = nov,
year = "2006",
CODEN = "JACOAH",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Sat Apr 14 10:54:02 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
}
@Article{Lopez:2006:UPK,
author = "Javier Lopez",
title = "Unleashing public-key cryptography in wireless sensor
networks",
journal = j-J-COMP-SECUR,
volume = "14",
number = "5",
pages = "469--482",
month = "????",
year = "2006",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2006-14505",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Lu:2006:FBW,
author = "Wei Lu and Hongtao Lu and Fu-Lai Chung",
title = "Feature based watermarking using watermark template
match",
journal = j-APPL-MATH-COMP,
volume = "177",
number = "1",
pages = "377--386",
day = "1",
month = jun,
year = "2006",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:55 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lu:2006:RDI,
author = "Wei Lu and Hongtao Lu and Fu-Lai Chung",
title = "Robust digital image watermarking based on
subsampling",
journal = j-APPL-MATH-COMP,
volume = "181",
number = "2",
pages = "886--893",
day = "15",
month = oct,
year = "2006",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:02:58 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Book{Lucas:2006:PGE,
author = "Michael Lucas",
title = "{PGP} and {GPG}: email for the practical paranoid",
publisher = pub-NO-STARCH,
address = pub-NO-STARCH:adr,
pages = "216 (est.)",
year = "2006",
ISBN = "1-59327-071-2",
ISBN-13 = "978-1-59327-071-1",
LCCN = "TK5102.85 .L83 2006",
bibdate = "Tue Jun 27 11:09:36 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip061/2005028824.html;
http://www.nostarch.com/pgp.htm",
acknowledgement = ack-nhfb,
review = "http://books.slashdot.org/books/06/06/26/1336200.shtml",
subject = "Electronic mail systems; Security measures; PGP
(Computer file)",
tableofcontents = "Cryptography for kindergarteners \\
Understanding OpenPGP \\
Installing PGP \\
Installing GnuPG \\
The web of trust \\
PGP key management \\
Managing GnuPG keys \\
OpenPGP and email \\
PGP and email \\
GnuPG and email \\
Other OpenPGP considerations \\
The GnuPG command line \\
The PGP command line",
}
@Article{Ma:2006:ADS,
author = "Mingchao Ma and Steve Woodhead",
title = "Authentication delegation for subscription-based
remote network services",
journal = j-COMPUT-SECUR,
volume = "25",
number = "5",
pages = "371--378",
month = jul,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:03 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404806000575",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Maloof:2006:MLD,
editor = "Marcus A. Maloof",
title = "Machine learning and data mining for computer
security: methods and applications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 210",
year = "2006",
ISBN = "1-84628-029-X",
ISBN-13 = "978-1-84628-029-0",
LCCN = "QA76.9.A25 M29 2006",
bibdate = "Mon Jun 12 18:09:08 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Advance information knowledge processing",
acknowledgement = ack-nhfb,
subject = "computer security; machine learning; data mining",
}
@Book{Mangard:2006:PAA,
author = "Stephan Mangard and Elisabeth Oswald and Thomas Popp",
title = "Power Analysis Attacks and Countermeasures for
Cryptographic Smart Cards",
volume = "450",
publisher = pub-SV,
address = pub-SV:adr,
pages = "250 (est)",
year = "2006",
ISBN = "0-387-30857-1",
ISBN-13 = "978-0-387-30857-9",
LCCN = "????",
bibdate = "Mon Jun 12 18:49:25 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
series = "Advances in Information Security",
URL = "http://deposit.ddb.de/cgi-bin/dokserv?id=2739575&prov=M&dok_var=1&dok_ext=htm",
}
@InProceedings{Matusiewicz:2006:FGD,
author = "Krystian Matusiewicz and Josef Pieprzyk",
title = "Finding Good Differential Patterns for Attacks on
{SHA-1}",
crossref = "Ytrehus:2006:CCI",
pages = "164--177",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Maximov:2006:SWC,
author = "Alexander Maximov",
title = "Some words on cryptanalysis of stream ciphers",
publisher = "Department of Information Technology, Lund
University",
address = "Lund, Sweden",
pages = "xiv + 242",
year = "2006",
ISBN = "91-7167-039-4",
ISBN-13 = "978-91-7167-039-7",
LCCN = "????",
bibdate = "Thu May 12 07:27:37 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{McDaniel:2006:OAI,
author = "Patrick McDaniel and William Aiello and Kevin Butler
and John Ioannidis",
title = "Origin authentication in interdomain routing",
journal = j-COMP-NET-AMSTERDAM,
volume = "50",
number = "16",
pages = "2953--2980",
day = "14",
month = nov,
year = "2006",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:14 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Book{McGraw:2006:SSB,
author = "Gary McGraw",
title = "Software security: building security in",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxxvi + 408",
year = "2006",
ISBN = "0-321-35670-5 (paperback)",
ISBN-13 = "978-0-321-35670-3 (paperback)",
LCCN = "QA76.9.A25 M4286 2006",
bibdate = "Sat Sep 16 05:39:02 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Addison-Wesley software security series",
URL = "http://www.loc.gov/catdir/toc/ecip062/2005031598.html",
acknowledgement = ack-nhfb,
subject = "Computer security",
tableofcontents = "Contents \\
Foreword \\
Preface \\
Part I. \\
Chapter 1. Defining a Discipline \\
Chapter 2. A Risk Management Framework \\
Part II. Seven Touchpoints for Software Security \\
Chapter 3. Introduction to Software Security
Touchpoints \\
Chapter 4. Code Review with a Tool \\
Chapter 5. Architectural Risk Analysis \\
Chapter 6. Software Penetration Testing \\
Chapter 7. Risk-based Security Testing \\
Chapter 8. Abuse Cases \\
Chapter 9. Software Security meets Security Operations
\\
Part III. Software Security Grows Up \\
Chapter 10. An Enterprise Software Security Program \\
Chapter 11. Knowledge for Software Security \\
Chapter 12 A Taxonomy of Coding Errors \\
Chapter 13. Annotated Bibliography and References \\
Appendix A \\
Appendix B \\
Appendix C \\
Appendix D \\
Index",
}
@Article{McLaughlin:2006:PZW,
author = "Laurianne McLaughlin",
title = "{Philip Zimmermann} on {What's Next after PGP?}",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "1",
pages = "10--13",
month = jan # "\slash " # feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.20",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Feb 9 18:53:31 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8013/33481/01588818.pdf;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=33481&arnumber=1588818",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Mishra:2006:PCS,
author = "P. M. Mishra",
title = "Pipelined computation of scalar multiplication in
elliptic curve cryptosystems (extended version)",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "8",
pages = "1000--1010",
month = aug,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.129",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:55 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1650197",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Mislove:2006:EBO,
author = "Alan Mislove and Ansley Post and Andreas Haeberlen and
Peter Druschel",
title = "Experiences in building and operating {ePOST}, a
reliable peer-to-peer application",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "147--159",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217950",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Peer-to-peer (p2p) technology can potentially be used
to build highly reliable applications without a single
point of failure. However, most of the existing
applications, such as file sharing or web caching, have
only moderate reliability demands. Without a
challenging proving ground, it remains unclear whether
the full potential of p2p systems can be realized. To
provide such a proving ground, we have designed,
deployed and operated a p2p-based email system. We
chose email because users depend on it for their daily
work and therefore place high demands on the
availability and reliability of the service, as well as
the durability, integrity, authenticity and privacy of
their email. Our system, ePOST, has been actively used
by a small group of participants for over two years. In
this paper, we report the problems and pitfalls we
encountered in this process. We were able to address
some of them by applying known principles of system
design, while others turned out to be novel and
fundamental, requiring us to devise new solutions. Our
findings can be used to guide the design of future
reliable p2p systems and provide interesting new
directions for future research.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "decentralized systems; electronic mail; peer-to-peer;
reliability",
}
@Article{Mitchell:2006:PPT,
author = "John C. Mitchell and Ajith Ramanathan and Andre
Scedrov and Vanessa Teague",
title = "A probabilistic polynomial-time process calculus for
the analysis of cryptographic protocols",
journal = j-THEOR-COMP-SCI,
volume = "353",
number = "1--3",
pages = "118--164",
day = "14",
month = mar,
year = "2006",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 06:48:57 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Moses:2006:DSD,
author = "Phil Moses",
title = "Demons seeking d{\ae}mons---a practical approach to
hardening your {openSSH} configuration",
journal = j-LINUX-J,
volume = "2006",
number = "143",
pages = "3--3",
month = mar,
year = "2006",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Mar 9 06:03:14 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Book{Mrayati:2006:TTC,
editor = "M. Mrayati and Y. Meer Alam and M. H. at-Tayyan",
title = "Three treatises on cryptanalysis of poetry",
volume = "5",
publisher = "KFCRIS \& KACST",
address = "Riyadh, Saudi Arabia",
pages = "x + 167",
year = "2006",
ISBN = "9960-890-56-2",
ISBN-13 = "978-9960-890-56-2",
LCCN = "????",
bibdate = "Thu May 12 06:53:13 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "{Arabic} origins of cryptology",
acknowledgement = ack-nhfb,
keywords = "cryptography / Arab countries / history",
}
@Misc{Mueller:2006:SMG,
author = "Maik Mueller and Michael Freidrich and Klaus Kiefer
and Ralf Miko and Juergen Schneider",
title = "System and method for generating pseudo-random
numbers",
howpublished = "United States Patent 7,894,602.",
day = "31",
month = mar,
year = "2006",
bibdate = "Tue Dec 27 16:54:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http:www.google.com/patents/US7894602",
abstract = "A process and system for generating a pseudo-random
number is presented. Input data having entropy is
gathered in an Entropy Pool and transformed once by a
cryptographic hash function. The transformed data forms
the internal state of the pseudo-random number
generator. The generator forms the output by applying a
second cryptographic hash function to this internal
state. Finally, the generator updates the internal
state by inputting the current internal state and data
from the Entropy Pool into a third cryptographic hash
function. The output of the third hash function forms
the new internal state of the pseudo-random number
generator.",
acknowledgement = ack-nhfb,
}
@Article{Mullins:2006:CC,
author = "J. Mullins",
title = "Chaotic communication",
journal = j-IEEE-SPECTRUM,
volume = "43",
number = "1",
pages = "11--12",
month = jan,
year = "2006",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2006.1572336",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "chaotic communication; Chaotic communication;
Circuits; Communication industry; Cryptography;
cryptography methods; data exchange; digital messages;
encryption; Labeling; Laboratories; Lonrenz system;
Mesh generation; Monitoring; Nonlinear dynamical
systems; Power generation; public key systems;
telecommunication security",
}
@Article{Murton:2006:CGH,
author = "Daniel Murton",
title = "Crypto goes to the heart",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "5",
pages = "19--19",
month = may,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70390-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:26 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806703907",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Mykletun:2006:AIO,
author = "Einar Mykletun and Maithili Narasimha and Gene
Tsudik",
title = "Authentication and integrity in outsourced databases",
journal = j-TOS,
volume = "2",
number = "2",
pages = "107--138",
month = may,
year = "2006",
CODEN = "????",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Wed Aug 23 05:41:22 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
}
@Article{Nagaj:2006:OQE,
author = "Daniel Nagaj and Iordanis Kerenidis",
title = "On the optimality of quantum encryption schemes",
journal = j-J-MATH-PHYS,
volume = "47",
number = "9",
pages = "092102",
month = sep,
year = "2006",
CODEN = "JMAPAQ",
DOI = "https://doi.org/10.1063/1.2339014",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Wed Oct 26 09:04:34 MDT 2011",
bibsource = "http://www.aip.org/ojs/jmp.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jmathphys2005.bib",
URL = "http://jmp.aip.org/resource/1/jmapaq/v47/i9/p092102_s1",
acknowledgement = ack-nhfb,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
onlinedate = "14 September 2006",
pagecount = "14",
}
@Book{Nedjah:2006:NTC,
editor = "Nadia Nedjah and Luiza de {Macedo Mourelle}",
title = "New trends in cryptographic systems",
publisher = "Nova Science Publishers",
address = "Hauppauge, NY, USA",
pages = "????",
year = "2006",
ISBN = "1-59454-977-X",
ISBN-13 = "978-1-59454-977-9",
LCCN = "TK7895.E42 N42 2006",
bibdate = "Tue Jun 13 10:23:01 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip066/2006001583.html",
acknowledgement = ack-nhfb,
subject = "Embedded computer systems; Cryptography; Computer
security",
}
@Article{Neuenschwander:2006:IMM,
author = "Mike Neuenschwander",
title = "Identity management market shifts --- who's out
there?",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "12",
pages = "7--10",
month = dec,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70461-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:34 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806704615",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Nikov:2006:RBV,
author = "Ventzislav Nikov and Svetla Nikova",
title = "On a Relation Between Verifiable Secret Sharing
Schemes and a Class of Error-Correcting Codes",
crossref = "Ytrehus:2006:CCI",
pages = "275--290",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Ogata:2006:OSS,
author = "Wakaha Ogata and Kaoru Kurosawa and Douglas R.
Stinson",
title = "Optimum Secret Sharing Scheme Secure against
Cheating",
journal = j-SIAM-J-DISCR-MATH,
volume = "20",
number = "1",
pages = "79--95",
month = jan,
year = "2006",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480100378689",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Tue May 18 21:36:50 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/20/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@TechReport{Oren:2006:PAR,
author = "Yossi Oren and Adi Shamir",
title = "Power Analysis of {RFID} Tags",
type = "Technical report",
institution = "Faculty of Mathematics and Computer Science, Weizmann
Institute",
address = "POB 26, Rehovot 76100, Israel",
year = "2006",
bibdate = "Sat Apr 15 09:07:58 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.wisdom.weizmann.ac.il/~yossio/rfid/",
abstract = "We show the first power analysis attack on passive
RFID tags. Compared to standard power analysis attacks,
this attack is unique in that it requires no physical
contact with the device under attack. While the
specific attack described here requires the attacker to
actually transmit data to the tag under attack, the
power analysis part itself requires only a receive
antenna. This means that a variant of this attack can
be devised such that the attacker is completely passive
while it is acquiring the data, making the attack very
hard to detect.\par
As a proof of concept, we describe a password
extraction attack on Class 1 Generation 1 EPC tags
operating in the UHF frequency range. The attack
presented below lets an adversary discover the kill
password of such a tag and, then, disable it. The
attack can be readily adapted to finding the access and
kill passwords of Gen 2 tags.\par
The main significance of our attack is in its
implications --- any cryptographic functionality built
into tags needs to be designed to be resistant to power
analysis, and achieving this resistance is an
undertaking which has an effect both on the price and
on the read range of tags.",
acknowledgement = ack-nhfb,
keywords = "RFID tags",
}
@InProceedings{Osvik:2006:CAC,
author = "Dag Arne Osvik and Adi Shamir and Eran Tromer",
editor = "????",
booktitle = "Topics in Cryptology --- {CT-RSA}",
title = "Cache attacks and countermeasures: the case of {AES}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "1--20",
year = "2006",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 15:58:08 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 62]{Schneier:2015:SWC}.",
}
@InProceedings{Overbeck:2006:EGA,
author = "Raphael Overbeck",
title = "Extending {Gibson}'s Attacks on the {GPT}
Cryptosystem",
crossref = "Ytrehus:2006:CCI",
pages = "178--188",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Page:2006:FAP,
author = "D. Page and F. Vercauteren",
title = "A Fault Attack on Pairing-Based Cryptography",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "9",
pages = "1075--1080",
month = sep,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.134",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1668035",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Paillier:2006:TOW,
author = "Pascal Paillier and Jorge L. Villar",
title = "Trading One-Wayness Against Chosen-Ciphertext Security
in Factoring-Based Encryption",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4284",
pages = "252--266",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11935230_17",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 13 08:42:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib",
URL = "http://link.springer.com/content/pdf/10.1007/11935230_17.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/11935230",
book-URL = "http://www.springerlink.com/content/978-3-540-49476-8",
fjournal = "Lecture Notes in Computer Science",
}
@Article{Paterson:2006:LTT,
author = "Kenneth G. Paterson and Arnold K. L. Yau",
title = "Lost in Translation: Theory and Practice in
Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "3",
pages = "69--72",
month = may # "\slash " # jun,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.74",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Tue Oct 24 17:28:08 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Pathak:2006:BFT,
author = "Vivek Pathak and Liviu Iftode",
title = "{Byzantine} fault tolerant public key authentication
in peer-to-peer systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "50",
number = "4",
pages = "579--596",
day = "15",
month = mar,
year = "2006",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:09 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Paul:2006:SSC,
author = "Souradyuti Paul and Bart Preneel",
title = "On the (In)security of Stream Ciphers Based on Arrays
and Modular Addition",
journal = j-LECT-NOTES-COMP-SCI,
volume = "4284",
pages = "69--83",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11935230_5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Mar 13 08:42:37 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib;
https://www.math.utah.edu/pub/tex/bib/string-matching.bib",
URL = "http://link.springer.com/content/pdf/10.1007/11935230_5.pdf",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/11935230",
book-URL = "http://www.springerlink.com/content/978-3-540-49476-8",
fjournal = "Lecture Notes in Computer Science",
}
@Book{Pelzl:2006:PAC,
author = "Jan Pelzl",
title = "Practical Aspects of Curve-based Cryptography and
Cryptanalysis",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Bochum, Germany",
pages = "208",
year = "2006",
ISBN = "3-89966-189-3",
ISBN-13 = "978-3-89966-189-7",
LCCN = "????",
bibdate = "Fri May 13 08:47:36 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "EUR 24.90",
URL = "http://verlag.rub.de/g9783899661897.html",
abstract = "Algebraic curves have a broad range of application in
cryptology: on the one hand, elliptic and hyperelliptic
curve cryptosystems are increasingly employed as
public-key cryptosystems. On the other hand,
cryptanalytical algorithms for attacking cryptosystems
utilize algebraic curves. Examples include the elliptic
curve method for solving the Factorization Problem (FP)
or Pollard's Rho method for solving the Elliptic Curve
Discrete Logarithm Problem (ECDLP).\par
With this thesis, we contribute to both aspects of
cryptology. We present algorithmic improvements in the
field of cryptography, namely for Hyperelliptic Curve
Cryptosystems. In the field of cryptanalysis, we
propose different hardware architectures for
cryptanalytical algorithms, resulting in a security
evaluation of particular symmetric and asymmetric
cryptosystems against attacks with special-purpose
hardware. Our implementations in software as well as in
hardware form the basis for such an analysis und stress
the paramount importance of an efficient implementation
or arithmetic primitives regarding the overall
performance of cryptologic algorithms. In addition, we
present the concept and realization of a cost-optimized
and reprogrammable code-breaker which is based on
contemporary low-cost FPGAs.",
acknowledgement = ack-nhfb,
}
@Article{Pereira:2006:IBS,
author = "Olivier Pereira and Jean-Jacques Quisquater",
title = "On the impossibility of building secure {Cliques}-type
authenticated group key agreement protocols",
journal = j-J-COMP-SECUR,
volume = "14",
number = "2",
pages = "197--246",
month = "????",
year = "2006",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2006-14204",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:08 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Phan:2006:CTP,
author = "Raphael C.-W. Phan",
title = "Cryptanalysis of two password-based authentication
schemes using smart cards",
journal = j-COMPUT-SECUR,
volume = "25",
number = "1",
pages = "52--54",
month = feb,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805001938",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Phan:2006:FDB,
author = "R. C.-W. Phan and M. U. Siddiqi",
title = "A Framework for Describing Block Cipher
Cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "11",
pages = "1402--1409",
month = nov,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.169",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:57 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1705449",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Philpott:2006:ITD,
author = "Andrew Philpott",
title = "Identity theft --- dodging the own-goals",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "1",
pages = "11--13",
month = jan,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70323-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:22 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806703233",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Pincock:2006:CHC,
author = "Stephen Pincock",
title = "Codebreaker: the history of codes and ciphers, from
the ancient pharaohs to quantum cryptography",
publisher = "Walker",
address = "New York, NY, USA",
pages = "176",
year = "2006",
ISBN = "0-8027-1547-8",
ISBN-13 = "978-0-8027-1547-0",
LCCN = "Z104 .P56 2006",
bibdate = "Sat Jun 13 08:24:07 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0730/2007310362-b.html;
http://www.loc.gov/catdir/enhancements/fy0730/2007310362-d.html",
acknowledgement = ack-nhfb,
subject = "Cryptography; History; Ciphers",
tableofcontents = "1. Originality \\
Unbroken codes : the Phaistos disk \\
Cultural codes : holy codes \\
Cultural codes : codes of the Kama Sutra \\
2. Ingenuity \\
Cultural codes : Rosslyn's secrets : hidden meaning in
architecture and music \\
Unbroken codes : the most mysterious book : the Voynich
manuscript \\
Unbroken codes : the man in the iron mask \\
3. Wit \\
Specific codes : the ingenious professor Babbage \\
Specific codes : the Playfair cipher \\
Unbroken codes : hidden treasure, hidden meaning, the
Beale papers \\
Unbroken codes : the Dorabella cipher, Elgar's other
enigma \\
4. Perseverance \\
Specific codes : the Enigma machine \\
Specific codes : invisible ink and other tools of the
spying trade \\
Specific codes : Purple and Pearl Harbor \\
5. Speed \\
Unbroken codes : the Zodiac killer \\
Specific codes : cracking Poe's Graham Magazine cipher
\\
Cultural codes : codes in fiction \\
6. Vision \\
Specific codes : the cat came back \\
Specific codes : quantum cryptography, being in two
places at once \\
Specific codes : quantum cryptography in a box of
chocolates \\
Appendix. Code challenge \\
Glossary",
}
@Article{Popp:2006:CTT,
author = "Robert Popp and John Poindexter",
title = "Countering Terrorism through Information and Privacy
Protection Technologies",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "18--27",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.147",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Porras:2006:PEG,
author = "Phillip A. Porras",
title = "Privacy-Enabled Global Threat Monitoring",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "60--63",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.161",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Potter:2006:CKM,
author = "Bruce Potter",
title = "Cryptographic key management for the masses",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "12",
pages = "13--14",
month = dec,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70463-9",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:34 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806704639",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Pucella:2006:SCC,
author = "Riccardo Pucella",
title = "Security and composition of cryptographic protocols: a
tutorial {(Part I)}",
journal = j-SIGACT,
volume = "37",
number = "3",
pages = "67--92",
month = sep,
year = "2006",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1165555.1165570",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:28 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "What does it mean for a cryptographic protocol to be
``secure''? Capturing the security requirements of
cryptographic tasks in a meaningful way is a slippery
business: On the one hand, we want security criteria
that prevent ``all potential attacks'' against a
protocol; on the other hand, we want our criteria not
to be overly restrictive and accept ``reasonable
protocols''. One of the main reasons for flaws is the
often unexpected interactions among different protocol
instances that run alongside each other in a composite
system. This tutorial studies a general methodology for
defining security of cryptographic protocols. The
methodology, often dubbed the ``trusted party
paradigm'', allows for defining the security
requirements of a large variety of cryptographic tasks
in a unified and natural way. We first review more
basic formulations that capture security in isolation
from other protocol instances. Next we address the
security problems associated with protocol composition,
and review formulations that guarantee security even in
composite systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Rajsbaum:2006:ASNb,
author = "Sergio Rajsbaum",
title = "{ACM} {SIGACT} news distributed computing column 24",
journal = j-SIGACT,
volume = "37",
number = "4",
pages = "58--84",
month = dec,
year = "2006",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1189056.1189074",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:28 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact37.html#Rajsbaum06a;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2006.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://doi.acm.org/10.1145/1189056.1189074",
abstract = "The Distributed Computing Column covers the theory of
systems that are composed of a number of interacting
computing elements. These include problems of
communication and networking, databases, distributed
shared memory, multiprocessor architectures, operating
systems, verification, Internet, and the Web. This
issue consists of:o ``Security and Composition of
Cryptographic Protocols: A Tutorial (Part II)'' by Ran
Canetti. The first part appeared in the previous SIGACT
News, the September 2006 issue. Many thanks to Ran for
his contributions to this column.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Rechberger:2006:NCW,
author = "Christian Rechberger and Vincent Rijmen and Nicolas
Sklavos",
title = "The {NIST Cryptographic Workshop on Hash Functions}",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "1",
pages = "54--56",
month = jan # "\slash " # feb,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.26",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Feb 9 18:53:31 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/iel5/8013/33481/01588827.pdf;
http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=33481&arnumber=1588827;
http://www.csrc.nist.gov/pki/HashWorkshop/",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
remark = "October 31--November 1, 2005 Gaithersburg, MD, USA.
Second workshop August 24--25, 2006, Santa Barbara, CA,
USA.",
}
@Book{Risen:2006:SWS,
author = "James Risen",
title = "State of war: the secret history of the {CIA} and the
{Bush} administration",
publisher = "Free Press",
address = "New York, NY, USA",
pages = "240",
year = "2006",
ISBN = "0-7432-7066-5",
ISBN-13 = "978-0-7432-7066-3",
LCCN = "????",
bibdate = "Thu Jan 19 12:29:17 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Bush, George W; (George Walker); Bush, George; United
States; Politics and government; 1989--",
subject-dates = "1946--; 1924--",
}
@Misc{Rose:2006:CSP,
author = "Gregory Gordon Rose and Alexander Gantman and Lu
Xiao",
title = "Cryptographically secure pseudo-random number
generator",
howpublished = "United States Patent 8,019,802.",
day = "23",
month = aug,
year = "2006",
bibdate = "Tue Dec 27 16:54:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http:www.google.com/patents/US8019802",
abstract = "A cryptographically secure pseudo-random number
generator is configured to obtain one or more
unpredictable sources of entropy that provide a seed. A
current internal state of the number generator is
modified as a function of the current internal state
and the seed to accumulate entropy. The modified
internal state may be obtained by using non-linear
feedback shift register operations on the internal
state and the seed. A pseudo-random number is then
generated based on the modified internal state of the
number generator. The one or more unpredictable sources
of entropy may be combined into the seed. The internal
state of the number generator may be continually
modified with additional seeds obtained from the one or
more unpredictable sources and the current internal
state. Additionally, the internal state of the number
generator may be modified on demand with a new seed
received from a calling application.",
acknowledgement = ack-nhfb,
}
@Book{Rosen:2006:CZK,
author = "Alon Rosen",
title = "Concurrent Zero-Knowledge",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 184",
year = "2006",
DOI = "https://doi.org/10.1007/3-540-32939-0",
ISBN = "3-642-06949-5, 3-540-32939-0 (e-book)",
ISBN-13 = "978-3-642-06949-9, 978-3-540-32939-8 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9.A25 R657 2006",
MRclass = "68P25, 68-01, 94A60",
bibdate = "Sat Jun 10 08:34:41 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "With Additional Background by Oded Goldreich.",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/uu1171",
abstract = "Zero-knowledge proofs are fascinating and extremely
useful constructs. They have a seemingly contradictory
definition: zero-knowledge proofs are both convincing
and yet yield nothing beyond the validity of the
assertion being proved. Their applicability in the
domain of cryptography is considerable.
A fundamental question regarding zero-knowledge
protocols refers to the preservation of security when
many instances of the protocol are executed
concurrently, and in particular under a purely
asynchronous model. The practical importance of this
question, in the days of extensive Internet
communication, seems clear. This question is also very
interesting from a theoretical viewpoint, and it serves
as a benchmark for the study of the security of
concurrent executions of protocols and has led to the
development of techniques for coping with problems that
arise in that setting.
Protocols that remain zero-knowledge when many
instances are executed concurrently are called
concurrent zero-knowledge, and this book is devoted to
their study. It presents constructions of concurrent
zero-knowledge protocols, along with proofs of security
for these protocols. It also shows why ``traditional''
proof techniques (i.e., black-box simulations) are not
suitable for establishing the concurrent zero-knowledge
property of ``round-efficient'' protocols.",
acknowledgement = ack-nhfb,
subject = "Data encryption (Computer science); Zero-knowledge
proofs; Cryptography; COMPUTERS; Security;
Cryptography; Data encryption (Computer science);
Cryptography; Zero-knowledge proofs; Informatique;
Cryptography; Data encryption (Computer science);
Zero-knowledge proofs.",
tableofcontents = "Front Matter \\
A Brief Introduction to Zero-Knowledge (by Oded
Goldreich) \\
Introduction to Concurrent Zero-Knowledge \\
Preliminaries \\
c ZK Proof Systems for NP \\
c ZK in Logarithmically Many Rounds \\
A Simple Lower Bound \\
Black-Box c ZK Requires Logarithmically Many Rounds \\
Conclusions and Open Problems \\
A Brief Account of Other Developments (by Oded
Goldreich) \\
Back Matter",
xxyear = "2010",
}
@Book{Rosenberg:2006:RAS,
editor = "Beth Rosenberg",
title = "{RFID}: applications, security, and privacy",
publisher = pub-AW,
address = pub-AW:adr,
pages = "li + 555",
year = "2006",
ISBN = "0-321-29096-8",
ISBN-13 = "978-0-321-29096-0",
LCCN = "TS160 .G37 2005",
bibdate = "Mon Oct 3 18:58:20 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip059/2005006610.html",
acknowledgement = ack-nhfb,
subject = "Inventory control; Automation; Radio frequency
identification systems; Privacy, Right of; United
States",
}
@Article{Rotondi:2006:CHA,
author = "Guido Rotondi and Gianpiero Guerrera",
title = "A consistent history authentication protocol",
journal = j-SIGSOFT,
volume = "31",
number = "3",
pages = "1--7",
month = may,
year = "2006",
CODEN = "SFENDP",
DOI = "https://doi.org/10.1145/1127878.1127887",
ISSN = "0163-5948 (print), 1943-5843 (electronic)",
ISSN-L = "0163-5948",
bibdate = "Wed Aug 1 17:15:17 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib",
abstract = "Traditional strong authentication systems rely on a
certification chain to delegate the authority of
trusting an intermediate end. However, in some
practical life scenarios a relayed authentication is
not accepted and thus it would be advisable a straight
proof of trustiness with a direct interaction with the
involved party. Our protocol introduces a registry of
certified operations from which it descends the
authentication and the consequent proof of identity.
Despite the fact that such system requires for
registrar initialization, the Consistent History
Protocol provides a reasonable degree of reliability in
identifying subjects at the steady state. As
application, we deployed the protocol in the indirect
electronic data collection scenario, where large data
flows have to be exchanged and certified among a set of
mutually trusted Institutions. The experimental results
report the processing overhead introduced by the
authentication protocol, which results negligible with
respect a classical strong authentication method built
around the OpenSSL library.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGSOFT Software Engineering Notes",
journal-URL = "https://dl.acm.org/citation.cfm?id=J728",
}
@Article{Ruan:2006:NSC,
author = "X. Ruan and R. S. Katti",
title = "A New Source Coding Scheme with Small Expected Length
and Its Application to Simple Data Encryption",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "10",
pages = "1300--1305",
month = oct,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.155",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1683760",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Rubin:2006:CSE,
author = "Bradley S. Rubin and Donald Cheung",
title = "Computer Security Education and Research: Handle with
Care",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "56--59",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.146",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@InProceedings{Satoh:2006:DPI,
author = "Takakazu Satoh",
title = "On Degrees of Polynomial Interpolations Related to
Elliptic Curve Cryptography",
crossref = "Ytrehus:2006:CCI",
pages = "155--163",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Scambray:2006:HEW,
author = "Joel Scambray and Mike Shema and Caleb Sima",
title = "Hacking exposed: {Web} applications",
publisher = pub-MCGRAW-HILL,
address = pub-MCGRAW-HILL:adr,
edition = "Second",
pages = "xxix + 520",
year = "2006",
ISBN = "0-07-226299-0 (paperback)",
ISBN-13 = "978-0-07-226299-5 (paperback)",
LCCN = "TK5105.59 .S32 2006",
bibdate = "Fri Jun 20 11:44:24 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Web sites;
Computer security",
}
@Article{Schmidt-Samoa:2006:AFW,
author = "K. Schmidt-Samoa and O. Semay and T. Takagi",
title = "Analysis of fractional window recoding methods and
their application to elliptic curve cryptosystems",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "1",
pages = "48--57",
month = jan,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.3",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:52 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1545750",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Book{Schramm:2006:AMS,
author = "Kai Schramm",
title = "Advanced Methods in Side Channel Cryptanalysis",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Bochum, Germany",
pages = "170",
year = "2006",
ISBN = "3-89966-187-7",
ISBN-13 = "978-3-89966-187-3",
LCCN = "????",
bibdate = "Fri May 13 08:50:45 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "EUR 22.90",
URL = "http://verlag.rub.de/g9783899661873.html",
abstract = "Side channel cryptanalysis attempts to exploit
physical leakages of cipher implementations in order to
extract secret key information. The dissertation at
hand provides a detailed insight into new and refined
side channel attacks and corresponding countermeasures.
The attacks proposed in this thesis embrace internal
collision attacks against the Data Encryption Standard
(DES), the Advanced Encryption Standard (AES) and the
block ciphers Serpent and Kasumi. Moreover, an attack
which combines the multivariate classification of side
channel signals and classic Differential Power Analysis
(DPA) is presented.\par
The blinding of intermediate, key-dependent variables
in a cipher with randomized masks is the most common
countermeasure against side channel attacks. In this
thesis various variants of the masking countermeasure
are investigated and performance figures are given.
Furthermore, security aspects are examined. For
example, it is shown that masked hardware
implementations may not prevent side channel attacks
due to glitching activities in masked circuits.",
acknowledgement = ack-nhfb,
}
@Book{Sergienko:2006:QCC,
editor = "Alexander V. Sergienko",
title = "Quantum communications and cryptography",
publisher = "Taylor and Francis",
address = "Boca Raton, FL, USA",
pages = "232",
year = "2006",
ISBN = "0-8493-3684-8",
ISBN-13 = "978-0-8493-3684-3",
LCCN = "TK5102.94 .Q36 2005",
bibdate = "Sun Dec 13 08:42:24 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0648/2005050636-d.html;
http://www.loc.gov/catdir/toc/fy0713/2005050636.html",
acknowledgement = ack-nhfb,
subject = "Quantum communication; Security measures;
Cryptography; Coding theory; Data encryption (Computer
science)",
tableofcontents = "Quantum Cryptography [A. Ekert] \\
Quantum Communications with Optical Fibers [N. Gisin,
S. Iblisdir, W. Tittel, and H. Zbinden] \\
Advanced Quantum Communications Experiments with
Entangled Photons [M. Aspelmeyer, H. R. B{\"o}hm, A.
Fedrizzi, S. Gasparoni, M. Lindenthal, G.
Molina-Terriza, A. Poppe, K. Resch, R. Ursin, P.
Walther, A. Zeilinger, and T. Jennewein] \\
The DARPA Quantum Network [C. Elliott] \\
Experimental Cryptography Using Continuous Polarization
States [S. Lorenz, N. L{\"u}tkenhaus, G. Leuchs, and N.
Korolkova] \\
Quantum Logic Using Linear Optics [J.D. Franson, B.C.
Jacobs, and T.B. Pittman] \\
Practical Quantum Cryptography: Secrecy Capacity and
Privacy Amplification [G. Gilbert, M. Hamrick, and F.J.
Thayer] \\
Quantum State Sharing [T. Symul, A.M. Lance, W.P.
Bowen, P.K. Lam, B.C. Sanders, and T.C. Ralph] \\
Free-Space Quantum Cryptography [C. Kurtsiefer, M.
Halder, H. Weinfurter, P. Zarda, P.R. Tapster, P.M.
Gorman, and J.G. Rarity] \\
Noise-Immune Quantum Key Distribution [Z.D. Walton,
A.V. Sergienko, B.E.A. Saleh, and M.C. Teich] \\
Index",
}
@Article{Shieh:2006:ERM,
author = "Wen-Gong Shieh and Jian-Min Wang",
title = "Efficient remote mutual authentication and key
agreement",
journal = j-COMPUT-SECUR,
volume = "25",
number = "1",
pages = "72--77",
month = feb,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:01 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805001719",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Shumba:2006:THL,
author = "Rose Shumba",
title = "Teaching hands-on {Linux} host computer security",
journal = j-JERIC,
volume = "6",
number = "3",
pages = "5:1--5:??",
month = sep,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1145/1243481.1243486",
ISSN = "1531-4278",
bibdate = "Fri Jun 20 10:12:25 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/jeric/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In the summer of 2003, a project to augment and
improve the teaching of information assurance courses
was started at IUP. Thus far, ten hands-on exercises
have been developed. The exercises described in this
article, and presented in the appendix, are based on
actions required to secure a Linux host. Publicly
available resources were used to develop the exercises,
which have been successfully utilized since spring 2003
to teach cybersecurity basics classes. The experiences
and challenges encountered in teaching the course and
possible future work are also described.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Journal on Educational Resources in Computing
(JERIC)",
keywords = "computer security; cryptography; file integrity; file
permissions; host security exercises; user accounts",
}
@InProceedings{Simka:2006:MTR,
author = "M. Simka and V. Fischer and M. Drutarovsky and J.
Fayolle",
booktitle = "{ISCAS 2006: 2006 IEEE International Symposium on
Circuits and Systems: Circuits and systems: at
crossroads of life and technology: proceedings: May
21--24: Kos International Convention Centre (KICC),
Island of Kos, Greece}",
title = "Model of a True Random Number Generator Aimed at
Cryptographic Application",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "5619--5623",
year = "2006",
DOI = "https://doi.org/10.1109/ISCAS.2006.1693909",
ISBN = "0-7803-9390-2",
ISBN-13 = "978-0-7803-9390-5",
LCCN = "????",
bibdate = "Tue Jan 31 15:54:54 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "IEEE catalog number 06CH37717C.",
URL = "http://www.ieeexplore.ieee.org/xpl/RecentCon.jsp?punumber=11145",
acknowledgement = ack-nhfb,
keywords = "true random numbers from physical sources",
}
@Article{Singaravelu:2006:RTC,
author = "Lenin Singaravelu and Calton Pu and Hermann H{\"a}rtig
and Christian Helmuth",
title = "Reducing {TCB} complexity for security-sensitive
applications: three case studies",
journal = j-OPER-SYS-REV,
volume = "40",
number = "4",
pages = "161--174",
month = oct,
year = "2006",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1217935.1217951",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:14:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The large size and high complexity of
security-sensitive applications and systems software is
a primary cause for their poor testability and high
vulnerability. One approach to alleviate this problem
is to extract the security-sensitive parts of
application and systems software, thereby reducing the
size and complexity of software that needs to be
trusted. At the system software level, we use the Nizza
architecture which relies on a kernelized trusted
computing base (TCB) and on the reuse of legacy code
using trusted wrappers to minimize the size of the TCB.
At the application level, we extract the
security-sensitive portions of an already existing
application into an AppCore. The AppCore is executed as
a trusted process in the Nizza architecture while the
rest of the application executes on a virtualized,
untrusted legacy operating system. In three case
studies of real-world applications (e-commerce
transaction client, VPN gateway and digital signatures
in an e-mail client), we achieved a considerable
reduction in code size and complexity. In contrast to
the few hundred thousand lines of current application
software code running on millions of lines of systems
software code, we have AppCores with tens of thousands
of lines of code running on a hundred thousand lines of
systems software code. We also show the performance
penalty of AppCores to be modest (a few percent)
compared to current software.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "application security; trusted computing base",
}
@Article{Sivonen:2006:MPF,
author = "Timo Sivonen",
title = "Measuring Performance of {FreeBSD} Disk Encryption",
journal = j-LOGIN,
volume = "31",
number = "5",
pages = "40--45",
month = oct,
year = "2006",
CODEN = "LOGNEM",
ISSN = "1044-6397",
ISSN-L = "1044-6397",
bibdate = "Fri Dec 7 11:34:26 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib;
https://www.usenix.org/publications/login",
URL = "https://www.usenix.org/publications/login/october-2006-volume-31-number-5/measuring-performance-freebsd-disk-encryption",
acknowledgement = ack-nhfb,
fjournal = ";login: the USENIX Association newsletter",
}
@Book{Skoudis:2006:CHR,
author = "Ed Skoudis and Tom Liston",
title = "Counter hack reloaded: a step-by-step guide to
computer attacks and effective defenses",
publisher = pub-PHPTR,
address = pub-PHPTR:adr,
edition = "Second",
pages = "????",
year = "2006",
ISBN = "0-13-148104-5 (paperback)",
ISBN-13 = "978-0-13-148104-6 (paperback)",
LCCN = "TK5105.59 .S57 2006",
bibdate = "Mon Apr 3 07:35:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0519/2005027164.html",
acknowledgement = ack-nhfb,
remark = "Rev. ed. of: Counter hack, c2002.",
subject = "Computer networks; Security measures; Data
protection",
}
@Article{Small:2006:USR,
author = "Mike Small",
title = "Unify and simplify: re-thinking identity management",
journal = j-NETWORK-SECURITY,
volume = "2006",
number = "7",
pages = "11--14",
month = jul,
year = "2006",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(06)70411-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:28 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485806704111",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InCollection{Smith:2006:CNS,
author = "Adam Smith and Cynthia Dwork and Frank McSherry and
Kobbi Nissim",
booktitle = "Theory of Cryptography Conference (TCC) 2006
conference proceedings",
title = "Calibrating Noise to Sensitivity in Private Data
Analysis",
publisher = "????",
address = "????",
pages = "??--??",
year = "2006",
bibdate = "Tue Jan 19 16:18:31 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
remark = "This paper won the Theory of Cryptography Conference
(TCC) 2016 Test of Time award.",
}
@InProceedings{Smith:2006:SID,
author = "Matthew Smith and Michael Engel and Thomas Friese and
Bernd Freisleben and Gregory A. Koenig and William
Yurcik",
title = "Security Issues in On-Demand Grid and Cluster
Computing",
crossref = "Turner:2006:SIS",
pages = "24--??",
year = "2006",
bibdate = "Sat Oct 14 15:36:21 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
abstract = "In this paper, security issues in on-demand Grid and
cluster computing are analyzed, a corresponding threat
model is presented and the challenges with respect to
authentication, authorization, delegation and single
sign-on, secure communication, auditing, safety, and
confidentiality are discussed. Three different levels
of on-demand computing are identified, based on the
number of resource providers, solution producers and
users, and the trust relationships between them. It is
argued that the threats associated with the first two
levels can be handled by employing operating system
virtualization technologies based on Xen, whereas the
threats of the third level require the use of hardware
security modules proposed in the context of the Trusted
Computing Platform Alliance (TCPA). The presented
security mechanisms increase the resilience of the
service hosting environment against both malicious
attacks and erroneous code. Thus, our proposal paves
the way for large scale hosting of Grid or web services
in commercial scenarios.",
acknowledgement = ack-nhfb,
}
@Article{Solar-Lezama:2006:CSF,
author = "Armando Solar-Lezama and Liviu Tancau and Rastislav
Bodik and Sanjit Seshia and Vijay Saraswat",
title = "Combinatorial sketching for finite programs",
journal = j-SIGPLAN,
volume = "41",
number = "11",
pages = "404--415",
month = nov,
year = "2006",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1168917.1168907",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 10:49:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Sketching is a software synthesis approach where the
programmer develops a partial implementation --- a
sketch --- and a separate specification of the desired
functionality. The synthesizer then completes the
sketch to behave like the specification. The
correctness of the synthesized implementation is
guaranteed by the compiler, which allows, among other
benefits, rapid development of highly tuned
implementations without the fear of introducing bugs.
We develop SKETCH, a language for finite programs with
linguistic support for sketching. Finite programs
include many high-performance kernels, including
cryptocodes. In contrast to prior synthesizers, which
had to be equipped with domain-specific rules, SKETCH
completes sketches by means of a combinatorial search
based on generalized boolean satisfiability.
Consequently, our combinatorial synthesizer is complete
for the class of finite programs: it is guaranteed to
complete any sketch in theory, and in practice has
scaled to realistic programming problems. Freed from
domain rules, we can now write sketches as
simple-to-understand partial programs, which are
regular programs in which difficult code fragments are
replaced with holes to be filled by the synthesizer.
Holes may stand for index expressions, lookup tables,
or bitmasks, but the programmer can easily define new
kinds of holes using a single versatile synthesis
operator. We have used SKETCH to synthesize an
efficient implementation of the AES cipher standard.
The synthesizer produces the most complex part of the
implementation and runs in about an hour.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "SAT; sketching",
}
@Article{Spivak:2006:SPT,
author = "Michal Spivak and Sivan Toledo",
title = "Storing a persistent transactional object heap on
flash memory",
journal = j-SIGPLAN,
volume = "41",
number = "7",
pages = "22--33",
month = jul,
year = "2006",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1134650.1134655",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 10:44:55 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present the design and implementation of TinyStore,
a persistent, transactional, garbage-collected
memory-management system, designed to be called from
the Java virtual machine of a Java Card. The system is
designed for flash-based implementations of Java Card,
a variant of the Java platform for smart cards. In the
Java Card platform, objects are persistent by default.
The platform supports transactions: a sequence of
accesses to objects can be explicitly declared to
constitute a transaction. TinyStore supports explicit
transactions and atomically executes individual
accesses that are not part of transactions; it also
supports garbage collection, even on systems with a
small constant amount of ram. TinyStore uses a novel
approach and specialized data structures to efficiently
manage flash memory. We demonstrate its effectiveness
by comparing it to a traditional eeprom-based memory
management system for Java Cards.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "flash; Java Card; nor flash; persistent heaps;
persistent object stores; smart cards; transactions",
}
@Article{Stabell-Kulo:2006:ESC,
author = "Tage Stabell-Kul{\o}",
title = "From the {Editor}: Security Community --- Blurring the
Line between Authentication and Identification",
journal = j-IEEE-DISTRIB-SYST-ONLINE,
volume = "7",
number = "2",
pages = "1--5",
month = feb,
year = "2006",
CODEN = "????",
ISSN = "1541-4922 (print), 1558-1683 (electronic)",
ISSN-L = "1541-4922",
bibdate = "Mon Aug 30 23:14:33 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csdl.computer.org/comp/mags/ds/2006/02/o2002.pdf",
acknowledgement = ack-nhfb,
fjournal = "IEEE Distributed Systems Online",
}
@Article{Staff:2006:NTS,
author = "{CACM Staff}",
title = "News track: Super Game Plan; {E}-Learning Roots
Disputed; {Chinese} History; {U.K.} Seeks Popular
Science Input; Encryption Commitment; {{\em
Improve}}-ment News; Vid Kid",
journal = j-CACM,
volume = "49",
number = "11",
pages = "9--10",
month = nov,
year = "2006",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Tue Oct 24 06:40:13 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Stamp:2006:ISP,
author = "Mark Stamp",
title = "Information security: principles and practice",
publisher = pub-WILEY-INTERSCIENCE,
address = pub-WILEY-INTERSCIENCE:adr,
pages = "xxi + 390",
year = "2006",
ISBN = "0-471-73848-4 (cloth)",
ISBN-13 = "978-0-471-73848-0 (cloth)",
LCCN = "QA76.9.A25 S69 2006",
bibdate = "Sat May 14 10:14:47 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0645/2005005152-b.html;
http://www.loc.gov/catdir/enhancements/fy0645/2005005152-d.html;
http://www.loc.gov/catdir/toc/ecip058/2005005152.html",
acknowledgement = ack-nhfb,
subject = "Computer security",
tableofcontents = "Preface \\
About The Author \\
Acknowledgments \\
1. Introduction \\
1.1 The Cast of Characters \\
1.2 Alice's Online Bank \\
1.2.1 Confidentiality, Integrity and \\
1.2.2 Beyond CIA \\
1.3 About This Book \\
1.3.1 Cryptography \\
1.3.2 Access Control \\
1.3.3 Protocols \\
1.3.4 Software \\
1.4 The People Problem \\
1.5 Theory and Practice \\
1.6 Problems \\
I. CRYPTO \\
2. Crypto Basics \\
2.1 Introduction \\
2.2 How to Speak Crypto \\
2.3 Classic Crypto \\
2.3.1 Simple Substitution Cipher \\
2.3.2 Cryptanalysis of a Simple Substitution \\
2.3.3 Definition of Secure \\
2.3.4 Double Transposition Cipher \\
2.3.5 One-time Pad \\
2.3.6 Project VENONA \\
2.3.7 Codebook Cipher \\
2.3.8 Ciphers of the Election of 1876 \\
2.4 Modern Crypto History \\
2.5 A Taxonomy of Cryptography \\
2.6 A Taxonomy of Cryptanalysis \\
2.7 Summary \\
2.8 Problems \\
3. Symmetric Key Crypto \\
3.1 Introduction \\
3.2 Stream Ciphers \\
3.2.1 A 5/1.3.2.2 RC 4.3.3 Block Ciphers \\
3.3.1 Feistel Cipher \\
3.3.2 DES \\
3.3.3 Triple DES \\
3.3.4 AES \\
3.3.5 Three More Block Ciphers \\
3.3.6 TEA \\
3.3.7 Block Cipher Modes \\
3.4 Integrity \\
3.5 Summary \\
3.6 Problems \\
4. Public Key Crypto \\
4.1 Introduction \\
4.2 Knapsack \\
4.3 RSA \\
4.3.1 RSA Example \\
4.3.2 Repeated Squaring \\
4.3.3 Speeding Up RSA \\
4.4 Diffie-Hellman \\
4.5 Elliptic Curve Cryptography \\
4.5.1 Elliptic Curve Math \\
4.5.2 ECC Diffie-Hellman \\
4.6 Public Key Notation \\
4.7 Uses for Public Key Crypto \\
4.7.1 Confidentiality in the Real World \\
4.7.2 Signatures and Non-repudiation \\
4.7.3 Confidentiality and Non-repudiation \\
4.8 Public Key Infrastructure \\
4.9 Summary \\
4.10 Problems \\
5. Hash Functions and Other Topics \\
5.1 What is a Hash Function? \\
5.2 The Birthday Problem \\
5.3 Non-cryptographic Hashes \\
5.4 Tiger Hash \\
5.5 HMAC \\
5.6 Uses of Hash Functions \\
5.6.1 Online Bids \\
5.6.2 Spam Reduction \\
5.7 Other Crypto-Related Topics \\
5.7.1 Secret Sharing.Key Escrow \\
5.7.2 Random Numbers. Texas Hold 'em Poker. Generating
Random Bits \\
5.7.3 Information Hiding \\
5.8 Summary \\
5.9 Problems \\
6. Advanced Cryptanalysis \\
6.1 Introduction \\
6.2 Linear and Differential Cryptanalysis \\
6.2.1 Quick Review of DES \\
6.2.2 ???",
}
@Article{Standaert:2006:SSE,
author = "Fran{\c{c}}ois-Xavier Standaert and Gilles Piret and
Neil Gershenfeld and Jean-Jacques Quisquater",
title = "{SEA}: A Scalable Encryption Algorithm for Small
Embedded Applications",
journal = j-LECT-NOTES-COMP-SCI,
volume = "3928",
pages = "222--236",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11733447_16",
ISBN = "3-540-33311-8 (print), 3-540-33312-6 (e-book)",
ISBN-13 = "978-3-540-33311-1 (print), 978-3-540-33312-8
(e-book)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Jan 31 18:33:36 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs2006a.bib",
URL = "http://link.springer.com/chapter/10.1007/11733447_16",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
remark = "{Smart Card Research and Advanced Applications: 7th
IFIP WG 8.8/11.2 International Conference, CARDIS 2006,
Tarragona, Spain, April 19--21, 2006. Proceedings}",
}
@Book{StDenis:2006:BMI,
author = "Tom {St Denis} and Greg Rose",
title = "{BigNum} Math: Implementing Cryptographic Multiple
Precision Arithmetic",
publisher = pub-SYNGRESS,
address = pub-SYNGRESS:adr,
pages = "xviii + 296",
year = "2006",
ISBN = "1-59749-112-8",
ISBN-13 = "978-1-59749-112-9",
LCCN = "QA402.5 .S73 2006",
bibdate = "Fri Jun 12 07:26:51 MDT 2009",
bibsource = "clas.caltech.edu:210/INNOPAC;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
z3950.bibsys.no:2100/BIBSYS; clas.caltech.edu:210/INNOPAC;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
z3950.bibsys.no:2100/BIBSYS",
price = "US\$49.95",
URL = "http://www.oreilly.com/catalog/1597491128/index.html",
acknowledgement = ack-nhfb,
keywords = "Karatsuba multiplication; modular exponentiation;
Montgomery reduction",
tableofcontents = "Introduction \\
Multiple Precision Arithmetic \\
Exercises \\
Portability and Stability \\
Getting Started \\
Maintenance Algorithms \\
Basic Operations \\
Sign Manipulation \\
Basic Arithmetic \\
Multiplication and Squaring \\
The Multipliers \\
Multiplication \\
Modular Reduction \\
Basics of Modular Reduction \\
Exponentiation \\
Exponentiation Basics \\
Higher Level Algorithms \\
Number Theoretic Algorithms",
}
@Article{Stieber:2006:GH,
author = "Tony Stieber",
title = "{GnuPG} hacks",
journal = j-LINUX-J,
volume = "2006",
number = "143",
pages = "2--2",
month = mar,
year = "2006",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Thu Mar 9 06:03:14 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Article{Stieber:2006:OH,
author = "Anthony J. Stieber",
title = "{OpenSSL} hacks",
journal = j-LINUX-J,
volume = "2006",
number = "147",
pages = "??--??",
month = jul,
year = "2006",
CODEN = "LIJOFX",
ISSN = "1075-3583 (print), 1938-3827 (electronic)",
ISSN-L = "1075-3583",
bibdate = "Wed Aug 23 06:09:28 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Linux Journal",
journal-URL = "http://portal.acm.org/citation.cfm?id=J508",
}
@Book{Stinson:2006:CTP,
author = "Douglas R. (Douglas Robert) Stinson",
title = "Cryptography: theory and practice",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Third",
pages = "593",
year = "2006",
ISBN = "1-58488-508-4 (hardcover)",
ISBN-13 = "978-1-58488-508-5 (hardcover)",
LCCN = "QA268 .S75 2006",
bibdate = "Sun Dec 13 08:48:03 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "The CRC Press series on discrete mathematics and its
applications.",
URL = "http://www.loc.gov/catdir/enhancements/fy0647/2006272493-d.html",
acknowledgement = ack-nhfb,
subject = "coding theory; cryptography",
}
@Article{Sun:2006:PBA,
author = "Hung-Min Sun and Her-Tyan Yeh",
title = "Password-based authentication and key distribution
protocols with perfect forward secrecy",
journal = j-J-COMP-SYS-SCI,
volume = "72",
number = "6",
pages = "1002--1011",
month = sep,
year = "2006",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2006.03.005",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:01 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000006000481",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Book{Talbot:2006:CCI,
author = "J. (John) Talbot and D. J. A. Welsh",
title = "Cryptography and complexity: an introduction",
publisher = pub-CAMBRIDGE,
address = pub-CAMBRIDGE:adr,
pages = "xii + 292",
year = "2006",
ISBN = "0-521-85231-5 (hardcover), 0-521-61771-5 (paperback)",
ISBN-13 = "978-0-521-85231-9 (hardcover), 978-0-521-61771-0
(paperback)",
LCCN = "Z103 .T35 2006",
bibdate = "Fri Dec 23 07:24:36 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
subject = "Cryptography; Computational complexity",
}
@Article{Tang:2006:CHA,
author = "Qiang Tang and Chris J. Mitchell",
title = "Cryptanalysis of a hybrid authentication protocol for
large mobile networks",
journal = j-J-SYST-SOFTW,
volume = "79",
number = "4",
pages = "496--501",
month = apr,
year = "2006",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:01 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Teepe:2006:PPA,
author = "Wouter Teepe",
title = "Proving Possession of Arbitrary Secrets While not
Giving them Away: New Protocols and a Proof in {GNY}
Logic",
journal = j-SYNTHESE,
volume = "149",
number = "2",
pages = "409--443",
month = mar,
year = "2006",
CODEN = "SYNTAE",
DOI = "https://doi.org/10.1007/s11229-005-3879-4",
ISSN = "0039-7857 (print), 1573-0964 (electronic)",
ISSN-L = "0039-7857",
bibdate = "Mon Sep 25 13:44:15 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/synthese2000.bib",
URL = "http://link.springer.com//content/pdf/10.1007/s11229-005-3879-4.pdf;
http://link.springer.com/article/10.1007/s11229-005-3879-4",
acknowledgement = ack-nhfb,
fjournal = "Synthese",
journal-URL = "http://link.springer.com/journal/11229",
}
@Article{Tomaszewski:2006:YSY,
author = "John P. Tomaszewski",
title = "Are You Sure You Had a Privacy Incident?",
journal = j-IEEE-SEC-PRIV,
volume = "4",
number = "6",
pages = "64--66",
month = nov # "\slash " # dec,
year = "2006",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2006.143",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:42 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Book{Trappe:2006:ICC,
author = "Wade Trappe and Lawrence C. Washington",
title = "Introduction to Cryptography: with Coding Theory",
publisher = "Pearson Prentice Hall",
address = "Upper Saddle River, NJ, USA",
edition = "Second",
pages = "xiv + 577",
year = "2006",
ISBN = "0-13-186239-1, 0-13-198199-4 (paperback)",
ISBN-13 = "978-0-13-186239-5, 978-0-13-198199-7 (paperback)",
LCCN = "QA268 .T73 2006",
bibdate = "Wed Mar 15 06:50:49 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib;
https://www.math.utah.edu/pub/tex/bib/mathematica.bib;
https://www.math.utah.edu/pub/tex/bib/matlab.bib",
abstract = "This text is for a course in cryptography for advanced
undergraduate and graduate students. Material is
accessible to mathematically mature students having
little background in number theory and computer
programming. Core material is treated in the first
eight chapters on areas such as classical
cryptosystems, basic number theory, the RSA algorithm,
and digital signatures. The remaining nine chapters
cover optional topics including secret sharing schemes,
games, and information theory. Appendices contain
computer examples in Mathematica, Maple, and MATLAB.
The text can be taught without computers.",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Codage; Cryptographie;
Coding theory; Cryptography; Codierungstheorie;
Kryptologie; Codierungstheorie; Kryptologie",
tableofcontents = "1: Overview of Cryptography and Its Applications
\\
Secure Communications \\
Cryptographic Applications \\
2: Classical Cryptosystems \\
Shift Ciphers \\
Affine Ciphers \\
The Vigenere Cipher \\
Substitution Ciphers \\
Sherlock Holmes \\
The Playfair and ADFGX Ciphers \\
Block Ciphers \\
Binary Numbers and ASCII \\
One-Time Pads \\
Pseudo-random Bit Generation \\
LFSR Sequences \\
Enigma \\
Exercises \\
Computer Problems \\
3: Basic Number Theory \\
Basic Notions \\
Solving ax + by = d \\
Congruences \\
The Chinese Remainder Theorem \\
Modular Exponentiation \\
Fermat and Euler \\
Primitive Roots \\
Inverting Matrices Mod n \\
Square Roots Mod n \\
Legendre and Jacobi Symbols \\
Finite Fields \\
Continued Fractions \\
Exercises \\
Computer Problems \\
4: The Data Encryption Standard \\
A Simplified DES-Type Algorithm \\
Differential Cryptanalysis \\
DES \\
Modes of Operation \\
Breaking DES \\
Meet-in-the-Middle Attacks \\
Password Security \\
Exercises \\
Computer Problems \\
5: The Advanced Encryption Standard: Rijndael \\
The Basic Algorithm \\
The Layers \\
Decryption \\
Design Considerations \\
Exercises \\
6: The RSA Algorithm \\
The RSA Algorithm \\
Attacks on RSA \\
Primality Testing \\
Factoring \\
The RSA Challenge \\
An Application to Treaty Verification \\
The Public Key Concept \\
Exercises \\
Computer Problems \\
7: Discrete Logarithms \\
Discrete Logarithms \\
Computing Discrete Logs \\
Bit Commitment \\
Diffie-Hellman Key Exchange \\
The ElGamal Public Key Cryptosystem \\
Exercises \\
Computer Problems \\
8: Hash Functions \\
Hash Functions \\
A Simple Hash Example \\
The Secure Hash Algorithm \\
Birthday Attacks \\
Multicollisions \\
The Random Oracle Model \\
Using Hash Functions to Encrypt \\
Exercises \\
Computer Problems \\
9: Digital Signatures \\
RSA Signatures \\
The ElGamal Signature Scheme \\
Hashing and Signing \\
Birthday Attacks on Signatures \\
The Digital Signature Algorithm \\
Exercises \\
Computer Problems \\
10: Security Protocols \\
Intruders-in-the-Middle and Impostors \\
Key Distribution \\
Kerberos \\
Public Key Infrastructures (PKI) \\
X.509 Certificates \\
Pretty Good Privacy \\
SSL and TLS \\
Secure Electronic Transaction \\
Exercises \\
11: Digital Cash \\
Digital Cash \\
Exercises \\
12: Secret Sharing Schemes \\
Secret Splitting \\
Threshold Schemes \\
Exercises \\
Computer Problems \\
13: Games \\
Flipping Coins over the Telephone \\
Poker over the Telephone \\
Exercises \\
14: Zero-Knowledge Techniques \\
The Basic Setup \\
The Feige--Fiat--Shamir Identification Scheme \\
Exercises \\
15: Information Theory \\
Probability Review \\
Entropy \\
Huffman Codes \\
Perfect Secrecy \\
The Entropy of English \\
Exercises \\
16: Elliptic Curves \\
The Addition Law \\
Elliptic Curves Mod p \\
Factoring with Elliptic Curves \\
Elliptic Curves in Characteristic 2 \\
Elliptic Curve Cryptosystems \\
Identity-Based Encryption \\
Exercises \\
Computer Problems \\
17: Lattice Methods \\
Lattices \\
Lattice Reduction \\
An Attack on RSA \\
NTRU \\
Exercises \\
18: Error Correcting Codes. Introduction \\
Error Correcting Codes \\
Bounds on General Codes \\
Linear Codes \\
Hamming Codes \\
Golay Codes \\
Cyclic Codes \\
BCH Codes \\
Reed-Solomon Codes \\
The McEliece Cryptosystem \\
Other Topics \\
Exercises \\
Computer Problems \\
19: Quantum Techniques in Cryptography \\
A Quantum Experiment \\
Quantum Key Distribution \\
Shor's Algorithm \\
Exercises \\
A: Mathematica Examples \\
B: Maple Examples \\
C: Matlab Examples",
}
@Article{Tsaban:2006:FGD,
author = "Boaz Tsaban",
title = "Fast generators for the {Diffie--Hellman} key
agreement protocol and malicious standards",
journal = j-INFO-PROC-LETT,
volume = "99",
number = "4",
pages = "145--148",
day = "31",
month = aug,
year = "2006",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:41:12 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Book{Vacca:2006:GWN,
author = "John R. Vacca",
title = "Guide to wireless network security",
volume = "20",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxii + 848",
year = "2006",
ISBN = "0-387-95425-2",
ISBN-13 = "978-0-387-95425-7",
LCCN = "QA76.9.A25 C66 2006",
bibdate = "Fri Aug 25 15:25:26 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Advances in information security",
URL = "http://www.loc.gov/catdir/enhancements/fy0663/2005939009-d.html",
acknowledgement = ack-nhfb,
remark = "From the publisher: ``With the rapid deployment of
wireless networks in business environments, IT
professionals must implement security mechanisms that
are equivalent to those existing today for wire-based
networks. This volume is an authoritative,
clearly-presented guide to key foundation topics and
technology frameworks for designing and maintaining
secure, reliable operations. From basic concepts to
designing principles to deployment, all critical
concepts and phases are explained in detail. The book
also includes coverage of wireless security testing
techniques and intrusion prevention
techniques.\par
Through extensive hands-on examples, Guide to Wireless
Network Security demonstrates how to install, configure
and troubleshoot firewalls and wireless network
security applications; evaluate, implement and manage
wireless secure remote access technologies; and deploy
a variety of Virtual Private Networks, intrusion
detection systems and intrusion prevention systems, in
conjunction with information warfare
countermeasures.''",
subject = "Data encryption (Computer science)",
}
@Article{vanDijk:2006:ICS,
author = "Marten van Dijk and Tom Kevenaar and Geert-Jan
Schrijen and Pim Tuyls",
title = "Improved constructions of secret sharing schemes by
applying $ (\lambda, \omega) $-decompositions",
journal = j-INFO-PROC-LETT,
volume = "99",
number = "4",
pages = "154--157",
day = "31",
month = aug,
year = "2006",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 18:41:12 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Vergnaud:2006:RBS,
author = "Damien Vergnaud",
title = "{RSA}-Based Secret Handshakes",
crossref = "Ytrehus:2006:CCI",
pages = "252--274",
year = "2006",
bibdate = "Tue Jun 28 08:19:10 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Vernitski:2006:CUM,
author = "Alexei Vernitski",
title = "Can Unbreakable Mean Incomputable?",
journal = j-COMP-J,
volume = "49",
number = "1",
pages = "108--112",
month = jan,
year = "2006",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxh144",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Dec 21 17:38:55 MST 2005",
bibsource = "http://comjnl.oxfordjournals.org/content/vol49/issue1/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/49/1/108;
http://comjnl.oxfordjournals.org/cgi/content/full/49/1/108;
http://comjnl.oxfordjournals.org/cgi/reprint/49/1/108",
abstract = "Among methods of breaking a cipher, exhaustive key
search stands out as the most successful (albeit the
least efficient) method. We demonstrate that various
algorithmic implementations of exhaustive key search
are not equally effective, and cryptosystems can be
devised which make some implementations of exhaustive
key search unsuccessful (in the sense that the problem
these algorithms try to solve turns out to be
incomputable). We observe that there are
implementations of exhaustive key search that are
always successful (i.e. they terminate and generate a
correct result irrespective of the cryptosystem they
are used against). As to those implementations of
exhaustive key search that are not always successful,
we describe them and those cryptosystems that can make
them unsuccessful.",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Wang:2006:SPS,
author = "Chung-Ming Wang and Peng-Cheng Wang",
title = "Steganography on point-sampled geometry",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "30",
number = "2",
pages = "244--254",
month = apr,
year = "2006",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2006.01.030",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 16:41:53 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S009784930600032X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Weaver:2006:BA,
author = "Alfred C. Weaver",
title = "Biometric Authentication",
journal = j-COMPUTER,
volume = "39",
number = "2",
pages = "96--97",
month = feb,
year = "2006",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2006.47",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:16:19 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Wen:2006:PSA,
author = "Hsiang-An Wen and Chun-Li Lin and Tzonelih Hwang",
title = "Provably secure authenticated key exchange protocols
for low power computing clients",
journal = j-COMPUT-SECUR,
volume = "25",
number = "2",
pages = "106--113",
month = mar,
year = "2006",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:02 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404805001732",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Whittaker:2006:HBW,
author = "James A. Whittaker and Mike Andrews",
title = "How to break {Web} software: functional and security
testing of {Web} applications and {Web} services",
publisher = pub-AW,
address = pub-AW:adr,
pages = "????",
year = "2006",
ISBN = "0-321-36944-0 (paperback)",
ISBN-13 = "978-0-321-36944-4 (paperback)",
LCCN = "QA76.76.T48 W485 2006",
bibdate = "Mon Apr 3 07:34:51 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip064/2005034913.html",
acknowledgement = ack-nhfb,
subject = "Computer software; Testing; World Wide Web; Computer
networks; Security measures",
}
@Book{Williams:2006:C,
author = "Conrad Williams",
title = "The cryptanalyst",
publisher = "Leaf",
address = "Abercynon, UK",
pages = "32",
year = "2006",
ISBN = "1-905599-23-4",
ISBN-13 = "978-1-905599-23-3",
LCCN = "????",
bibdate = "Thu May 12 06:41:02 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.ox.ac.uk:210/ADVANCE",
acknowledgement = ack-nhfb,
remark = "Fiction.",
}
@Article{Xenakis:2006:GCO,
author = "Christos Xenakis and Nikolaos Laoutaris and Lazaros
Merakos and Ioannis Stavrakakis",
title = "A generic characterization of the overheads imposed by
{IPsec} and associated cryptographic algorithms",
journal = j-COMP-NET-AMSTERDAM,
volume = "50",
number = "17",
pages = "3225--3241",
day = "5",
month = dec,
year = "2006",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:14 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Yan:2006:ICP,
author = "Chenyu Yan and Daniel Englender and Milos Prvulovic
and Brian Rogers and Yan Solihin",
title = "Improving Cost, Performance, and Security of Memory
Encryption and Authentication",
journal = j-COMP-ARCH-NEWS,
volume = "34",
number = "2",
pages = "179--190",
year = "2006",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Mon Aug 21 15:00:05 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Yen:2006:SED,
author = "Chih-Hsu Yen and Bing-Fei Wu",
title = "Simple error detection methods for hardware
implementation of {Advanced Encryption Standard}",
journal = j-IEEE-TRANS-COMPUT,
volume = "55",
number = "6",
pages = "720--731",
month = jun,
year = "2006",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2006.90",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:35:54 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1628959",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Book{Young:2006:MCC,
author = "Anne L. Young",
title = "Mathematical ciphers: from {Caesar} to {RSA}",
volume = "25",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "viii + 159",
year = "2006",
ISBN = "0-8218-3730-3",
ISBN-13 = "978-0-8218-3730-6",
LCCN = "????",
bibdate = "Mon Jun 30 23:13:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
series = "Mathematical world",
acknowledgement = ack-nhfb,
subject = "Ciphers; Cryptography; Number theory",
}
@Article{Yue:2006:NCB,
author = "Yao Yue and Chuang Lin and Zhangxi Tan",
title = "{NPCryptBench}: a cryptographic benchmark suite for
network processors",
journal = j-COMP-ARCH-NEWS,
volume = "34",
number = "1",
pages = "49--56",
year = "2006",
CODEN = "CANED2",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Mon Aug 21 15:00:05 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
}
@Article{Zhao:2006:NDN,
author = "Yunlei Zhao",
title = "A note on the {Dwork--Naor} timed deniable
authentication",
journal = j-INFO-PROC-LETT,
volume = "100",
number = "1",
pages = "1--7",
day = "16",
month = oct,
year = "2006",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:52:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Zhao:2006:SAP,
author = "Zhu Zhao and Zhongqi Dong and Yongge Wang",
title = "Security analysis of a password-based authentication
protocol proposed to {IEEE} 1363",
journal = j-THEOR-COMP-SCI,
volume = "352",
number = "1--3",
pages = "280--287",
day = "7",
month = mar,
year = "2006",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 06:48:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zhong:2006:ESC,
author = "Sheng Zhong",
title = "An Efficient and Secure Cryptosystem for Encrypting
Long Messages",
journal = j-FUND-INFO,
volume = "71",
number = "4",
pages = "493--497",
month = sep,
year = "2006",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:04:22 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Aciicmez:2007:MAC,
author = "Onur Acii{\c{c}}mez and Jean-Pierre Seifert and
{\c{C}}etin Kaya Ko{\c{c}}",
title = "Micro-Architectural Cryptanalysis",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "4",
pages = "62--64",
month = jul # "\slash " # aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.91",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:45 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Agreste:2007:IAW,
author = "Santa Agreste and Guido Andaloro and Daniela
Prestipino and Luigia Puccio",
title = "An image adaptive, wavelet-based watermarking of
digital images",
journal = j-J-COMPUT-APPL-MATH,
volume = "210",
number = "1--2",
pages = "13--21",
day = "31",
month = dec,
year = "2007",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:13:20 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2005.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042706006431",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Ahmad:2007:ADE,
author = "Imtiaz Ahmad and A. Shoba Das",
title = "Analysis and Detection of Errors in Implementation of
{SHA-512} Algorithms on {FPGAs}",
journal = j-COMP-J,
volume = "50",
number = "6",
pages = "728--738",
month = nov,
year = "2007",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxm023",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:33 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol50/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/50/6/728;
http://comjnl.oxfordjournals.org/cgi/content/full/50/6/728;
http://comjnl.oxfordjournals.org/cgi/reprint/50/6/728",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Ahmad:2007:CSS,
author = "David Ahmad",
title = "The Contemporary Software Security Landscape",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "75--77",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.73",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Alon:2007:GSE,
author = "Noga Alon and Venkatesan Guruswami and Tali Kaufman
and Madhu Sudan",
title = "Guessing secrets efficiently via list decoding",
journal = j-TALG,
volume = "3",
number = "4",
pages = "42:1--42:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1290672.1290679",
ISSN = "1549-6325 (print), 1549-6333 (electronic)",
ISSN-L = "1549-6325",
bibdate = "Mon Jun 16 11:55:31 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/talg.bib",
abstract = "We consider the guessing secrets problem defined by
Chung et al. [2001]. This is a variant of the standard
20 questions game where the player has a set of $ k > 1
$ secrets from a universe of $N$ possible secrets. The
player is asked Boolean questions about the secret. For
each question, the player picks one of the $k$ secrets
adversarially, and answers according to this
secret.\par
We present an explicit set of $ O(\log N) $ questions
together with an efficient (i.e., $ {\rm poly}(\log N)
$ time) algorithm to solve the guessing secrets problem
for the case of 2 secrets. This answers the main
algorithmic question left unanswered by Chung et al.
[2001]. The main techniques we use are small $ \epsilon
$-biased spaces and the notion of list decoding.\par
We also establish bounds on the number of questions
needed to solve the $k$-secrets game for $ k > 2 $, and
discuss how list decoding can be used to get partial
information about the secrets, specifically to find a
small core of secrets that must intersect the actual
set of $k$ secrets.",
acknowledgement = ack-nhfb,
articleno = "42",
fjournal = "ACM Transactions on Algorithms (TALG)",
keywords = "$\epsilon$-biased spaces; $k$-universal sets; 20
questions; decoding algorithms; error-correcting
codes",
}
@Article{Anderson:2007:SSS,
author = "Ross Anderson",
title = "Software Security: State of the Art",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "8",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.18",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Anonymous:2007:CPSf,
author = "Anonymous",
title = "Call for Papers: Special-Purpose Hardware for
Cryptography and Cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "56",
number = "7",
pages = "1008--1008",
month = jul,
year = "2007",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2007.070702",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:03:40 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Anonymous:2007:CPSh,
author = "Anonymous",
title = "Call for Papers for Special Section on Special-Purpose
Hardware for Cryptography and Cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "56",
number = "10",
pages = "1439--1439",
month = oct,
year = "2007",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2007.70799",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:03:42 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Anshel:2007:RME,
author = "Michael Anshel and Sarah Levitan",
title = "Reducing medical errors using secure {RFID}
technology",
journal = j-SIGCSE,
volume = "39",
number = "2",
pages = "157--159",
month = jun,
year = "2007",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1272848.1272900",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:35 MST 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigcse/sigcse39.html#AnshelL07;
http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
URL = "https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib",
abstract = "RFID technology can successfully be used to reduce
medical errors. This technology can aid in the accurate
matching of patients with their medications and
treatments. The enthusiasm for using RFID technology in
medical settings has been tempered by privacy concerns.
We discuss new encryption methods that address these
concerns.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Anton:2007:HEW,
author = "Annie I. Ant{\'o}n and Julia B. Eart and Matthew W.
Vail and Neha Jain and Carrie M. Gheen and Jack M.
Frink",
title = "{HIPAA}'s Effect on {Web} Site Privacy Policies",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "45--52",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.7",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@PhdThesis{Applebaum:2007:CCP,
author = "Benny Applebaum",
title = "Cryptography in Constant Parallel Time",
type = "{Ph.D.} dissertation",
school = "Technion --- Israel Institute of Technology",
address = "Haifa, Israel",
year = "2007",
bibdate = "Thu Jun 12 09:52:37 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Honorable Mention for the ACM 2007 Doctoral
Dissertation Award.",
URL = "http://www.acm.org/press-room/news-releases/dd-award-07",
acknowledgement = ack-nhfb,
}
@Article{Arnold:2007:CSE,
author = "T. W. Arnold and A. Dames and M. D. Hocker and M. D.
Marik and N. A. Pellicciotti and K. Werner",
title = "Cryptographic system enhancements for the {IBM System
z9}",
journal = j-IBM-JRD,
volume = "51",
number = "1/2",
pages = "87--??",
month = jan # " \slash " # mar,
year = "2007",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Fri Feb 9 20:31:06 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/rd/511/arnold.html",
abstract = "IBM has offered hardware-based cryptographic
processors for its mainframe computers for nearly
thirty years. Over that period, IBM has continued to
update both the hardware and software, providing added
features, higher performance, greater physical
security, and improved management features. This
commitment continues with the System z9e, as
demonstrated by the two improvements described in this
paper. The first part of the paper describes
enhancements to the System z9 to configure and control
cryptographic features. The second part describes a new
method for the cryptographic coprocessors to securely
manage keys which are distributed to remote devices
that are not necessarily in secure or well-controlled
environments.",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
ordernumber = "????",
}
@Article{Badra:2007:AWC,
author = "Mohamad Badra",
title = "Alternative wireless client authentication and key
distribution",
journal = j-NETWORK-SECURITY,
volume = "2007",
number = "7",
pages = "9--13",
month = jul,
year = "2007",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(07)70064-8",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485807700648",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Baer:2007:CIS,
author = "Walter S. Baer and Andrew Parkinson",
title = "Cyberinsurance in {IT} Security Management",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "50--56",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.57",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Baker:2007:ISU,
author = "Wade H. Baker and Linda Wallace",
title = "Is Information Security Under Control?: Investigating
Quality in Information Security Management",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "36--44",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.11",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Barak:2007:DC,
author = "Boaz Barak and Shien Jin Ong and Salil Vadhan",
title = "Derandomization in Cryptography",
journal = j-SIAM-J-COMPUT,
volume = "37",
number = "2",
pages = "380--400",
month = "????",
year = "2007",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:45 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/37/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Manual{Barker:2007:RRN,
author = "Elaine Barker and John Kelsey",
title = "Recommendation for random number generation using
deterministic random bit generators (revised)",
type = "{NIST} Special Publication",
number = "800-90",
organization = pub-NIST,
address = pub-NIST:adr,
pages = "viii + 124",
month = mar,
year = "2007",
bibdate = "Tue Apr 19 13:35:20 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/publications/nistpubs/800-90/SP800-90revised_March2007.pdf",
abstract = "This Recommendation specifies mechanisms for the
generation of random bits using deterministic methods.
The methods provided are based on either hash
functions, block cipher algorithms or number theoretic
problems.",
acknowledgement = ack-nhfb,
keywords = "deterministic random bit generator (DRBG); entropy;
hash function; random number generator",
}
@Book{Bauer:2007:DSM,
author = "Friedrich Ludwig Bauer",
title = "Decrypted secrets: methods and maxims of cryptology",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Fourth",
pages = "xii + 524",
year = "2007",
ISBN = "3-540-24502-2",
ISBN-13 = "978-3-540-24502-5",
LCCN = "QA76.9.A25 B38513 2007",
bibdate = "Sun Dec 24 17:52:38 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0824/2006933429-d.html;
http://www.loc.gov/catdir/toc/fy0711/2006933429.html",
acknowledgement = ack-nhfb,
author-dates = "1924--",
subject = "Computer security; Cryptography",
tableofcontents = "Part I: Cryptography --- The People / 1 \\
1 Introductory Synopsis / 9 \\
1.1 Cryptography and Steganography / 9 \\
1.2 Semagrams / 10 \\
1.3 Open Code: Masking / 13 \\
1.4 Cues / 17 \\
1.5 Open Code: Veiling by Nulls / 19 \\
1.6 Open Code: Veiling by Grilles / 23 \\
1.7 Classification of Cryptographic Methods / 24 \\
2 Aims and Methods of Cryptography / 26 \\
2.1 The Nature of Cryptography / 26 \\
2.2 Encryption / 32 \\
2,3 Cryptosystems / 34 \\
2.4 Polyphony / 36 \\
2.5 Character Sets / 39 \\
2.6 Keys / 41 \\
3 Encryption Steps: Simple Substitution / 44 \\
3.1 Case V() --- W (Unipartite Simple Substitutions) /
44 \\
3.2 Special Case V -> V (Permutations) * / 46 \\
3.3 Case V(1) --- W (Multipartite Simple Substitutions)
/ 53 \\
3.4 The General Case V(1) --- W(m), Straddling / 55 \\
4 Encryption Steps: Polygraphic Substitution and Coding
/ 58 \\
4.1 Case V2 --- W(m) (Digraphic Substitutions) / 58 \\
4.2 Special Cases of Playfair and Delastelle:
Tomographic Methods / 64 \\
4.3 Case V3 --- W(m) (Trigraphic Substitutions) / 68
\\
4.4 The General Case V(m) --- W(m) : Codes / 68 \\
5 Encryption Steps: Linear Substitution / 80 \\
5.1 Self-reciprocal Linear Substitutions / 82 \\
5.2 Homogeneous Linear Substitutions / 82 \\
5.3 Binary Linear Substitutions / 86 \\
5.4 General Linear Substitutions / 86 \\
5.5 Decomposed Linear Substitutions / 87 \\
5.6 Decimated Alphabets / 90 \\
5.7 Linear Substitutions with Decimal and Binary
Numbers / 91 \\
6 Encryption Steps: Transposition / 93 \\
6.1 Simplest Methods / 93 \\
6.2 Columnar Transpositions / 98 \\
6.3 Anagrams / 102 \\
7 Polyalphabetic Encryption: Families of Alphabets /
106 \\
7.1 Iterated Substitutions / 106 \\
7.2 Cyclically Shifted and Rotated Alphabets / 107 \\
7.3 Rotor Crypto Machines / 110 \\
7.4 Shifted Standard Alphabets: Vigenere and Beaufort /
127 \\
7.5 Unrelated Alphabets / 131 \\
8 Polyalphabetic Encryption: Keys / 139 \\
8.1 Early Methods with Periodic Keys / 139 \\
8.2 'Double Key' / 141 \\
8.3 Vernam Encryption / 142 \\
8.4 Quasi-nonperiodic Keys / 144 \\
8.5 Machines that Generate Their Own Key Sequences /
145 \\
8.6 Off-Line Forming of Key Sequences / 156 \\
8.7 Nonperiodic Keys / 158 \\
8.8 Individual, One-Time Keys / 161 \\
8.9 Key Negotiation and Key Management / 165 \\
9 Composition of Classes of Methods / 169 \\
9.1 Group Property / 169 \\
9.2 Superencryption / 171 \\
9.3 Similarity of Encryption Methods / 173 \\
9.4 Shannon's `Pastry Dough Mixing'. / 174 \\
9.5 Confusion and Diffusion by Arithmetical Operations
/ 180 \\
9.6 DES and IDEA : / 184 \\
10 Open Encryption Key Systems / 193 \\
10.1 Symmetric and Asymmetric Encryption Methods / 194
\\
10.2 One-Way Functions / 196 \\
10.3 RSA Method / 203 \\
10.4 Cryptanalytic Attack upon RSA / 205 \\
10.5 Secrecy Versus Authentication / 208 \\
10.6 Security of Public Key Systems / 210 \\
11 Encryption Security / 211 \\
11.1 Cryptographic Faults / 211 \\
11.2 Maxims of Cryptology / 220 \\
11.3 Shannon's Yardsticks / 225 \\
11.4 Cryptology and Human Rights / 226 \\
Part II: Cryptanalysis --- The Machinery / 233 \\
12 Exhausting Combinatorial Complexity / 237 \\
12.1 Monoalphabetic Simple Encryptions / 238 \\
12.2 Monoalphabetic Polygraphic Encryptions / 239 \\
12.3 Polyalphabetic Encryptions / 241 \\
12.4 General Remarks on Combinatorial Complexity / 244
\\
12.5 Cryptanalysis by Exhaustion / 244 \\
12.6 Unicity Distance / 246 \\
12.7 Practical Execution of Exhaustion / 248 \\
12.8 Mechanizing the Exhaustion / 251 \\
13 Anatomy of Language: Patterns / 252 \\
13.1 Invariance of Repetition Patterns / 252 \\
13.2 Exclusion of Encryption Methods / 254 \\
13.3 Pattern Finding / 255 \\
13.4 Finding of Polygraphic Patterns / 259 \\
13.5 The Method of the Probable Word / 259 \\
13.6 Automatic Exhaustion of the Instantiations of a
Pattern / 264 \\
13.7 Pangrams / 266 \\
14 Polyalphabetic Case: Probable Words / 268 \\
14.1 Non-Coincidence Exhaustion of Probable Word
Position / 268 \\
14.2 Binary Non-Coincidence Exhaustion / 271 \\
14.3 The De Viaris Attack / 272 \\
14.4 Zig-Zag Exhaustion of Probable Word Position / 280
\\
14.5 The Method of Isomorphs / 281 \\
14.6 A clever brute force method: EINSing / 287 \\
14.7 Covert Plaintext-Cryptotext Compromise / 288 \\
15 Anatomy of Language: Frequencies / 290 \\
15.1 Exclusion of Encryption Methods / 290 \\
15.2 Invariance of Partitions / 291 \\
15.3 Intuitive Method: Frequency Profile / 293 \\
15.4 Frequency Ordering / 294 \\
15.5 Cliques and Matching of Partitions / 297 \\
15.6 Optimal Matching / 303 \\
15.7 Frequency of Multigrams / 305 \\
15.8 The Combined Method of Frequency Matching / 310
\\
15.9 Frequency Matching for Polygraphic Substitutions /
316 \\
15.10 Free-Style Methods / 317 \\
15.11 Unicity Distance Revisited / 318 \\
16 Kappa and Chi / 320 \\
16.1 Definition and Invariance of Kappa / 320 \\
16.2 Definition and Invariance of Chi / 323 \\
16.3 The Kappa-Chi Theorem / 325 \\
16.4 The Kappa-Phi Theorem / 326 \\
16.5 Symmetric Functions of Character Frequencies / 328
\\
17 Periodicity Examination / 330 \\
17.1 The Kappa Test of Friedman / 331 \\
17.2 Kappa Test for Multigrams / 332 \\
17.3 Cryptanalysis by Machines: Searching for a period
/ 333 \\
17.4 Kasiski Examination / 339 \\
17.5 Building a Depth and Phi Test of Kullback / 345
\\
17.6 Estimating the Period Length / 348 \\
18 Alignment of Accompanying Alphabets / 350 \\
18.1 Matching the Profile / 350 \\
18.2 Aligning Against Known Alphabet / 354 \\
18.3 Chi Test: Mutual Alignment of Accompanying
Alphabets / 358 \\
18.4 Reconstruction of the Primary Alphabet / 363 \\
18.5 Kerckhoffs' Symmetry of Position / 365 \\
18.6 Stripping off Superencryption: Difference Method /
370 \\
18.7 Decryption of Code / 373 \\
18.8 Reconstruction of the Password / 373 \\
19 Compromises / 375 \\
19.1 Kerckhoffs' Superimposition / 375 \\
19.2 Superimposition for Encryptions with a Key Group /
377 \\
19.3 COLOSSUS / 401 \\
19.4 Adjustment 'in depth' of Messages / 412 \\
19.5 Cryptotext--Cryptotext Compromises / 419 \\
19.6 Cryptotext--Cryptotext Compromise: ENIGMA
Indicator Doubling / 431 \\
19.7 Plaintext--Cryptotext Compromise: Feedback Cycle /
448 \\
20 Linear Basis Analysis / 459 \\
20.1 Reduction of Linear Polygraphic Substitutions /
459 \\
20.2 Reconstruction of the Key / 460 \\
20.3 Reconstruction of a Linear Shift Register / 461
\\
21 Anagramming / 464 \\
21.1 Transposition / 464 \\
21.2 Double Columnar Transposition / 467 \\
21.3 Multiple Anagramming / 467 \\
22 Concluding Remarks / 470 \\
22.1 Success in Breaking / 471 \\
22.2 Mode of Operation of the Unauthorized Decryptor /
476 \\
22.3 Illusory Security / 482 \\
22.4 Importance of Cryptology / 484 \\
Appendix: Axiomatic Information Theory / 487 \\
Bibliography / 497 \\
Index / 501 \\
Photo Credits / 525",
}
@Book{Belfield:2007:SUC,
author = "Richard Belfield",
title = "The six unsolved ciphers: inside the mysterious codes
that have confounded the world's greatest
cryptographers",
publisher = "Ulysses",
address = "Berkeley, CA, USA",
pages = "ix + 281 + 16",
year = "2007",
ISBN = "1-56975-628-7 (paperback)",
ISBN-13 = "978-1-56975-628-7 (paperback)",
LCCN = "Z103 .B45 2007",
bibdate = "Sat Jun 13 08:23:57 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "First published as ``Can you crack the enigma code?'':
Great Britain: Orion, 2006.",
subject = "Cryptography; Ciphers",
}
@Book{Bella:2007:FCS,
author = "Giampaolo Bella",
title = "Formal correctness of security protocols",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 274 + 62",
year = "2007",
DOI = "https://doi.org/10.1007/978-3-540-68136-6",
ISBN = "3-540-68134-5, 3-540-68136-1 (e-book)",
ISBN-13 = "978-3-540-68134-2, 978-3-540-68136-6 (e-book)",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA8.9-QA10.3; TK5105.59.B45 2007",
bibdate = "Sat Jun 10 08:34:45 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Information Security and Cryptography",
abstract = "Computer network security is critical to fraud
prevention and accountability. Network participants are
required to observe predefined steps called security
protocols, whose proof of correctness is evidence that
each protocol step preserves some desired properties.
The author investigates proofs of correctness of
realistic security protocols in a formal, intuitive
setting. The protocols examined include Kerberos
versions, smartcard protocols, non-repudiation
protocols, and certified email protocols. The method of
analysis, the Inductive Method in the theorem prover
Isabelle, turns out to be both powerful and flexible.
This research advances significant extensions to the
method of analysis, while the findings on the protocols
analysed are novel and illuminating. This book will
benefit researchers and graduate students in the fields
of formal methods, information security, inductive
methods, and networking.",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Security
measures; cryptologie; robots; Computer architecture.
Operating systems; informatica; programmatielogica;
Information systems; logica; Artificial intelligence.
Robotics. Simulation. Graphics; wiskunde; Computer
science; Mathematical logic; computerbeveiliging;
communicatietechnologie; Mass communications",
tableofcontents = "Introduction \\
The Analysis of Security Protocols \\
The Inductive Method \\
Verifying the Protocol Goals \\
The Principle of Goal Availability \\
Modelling Timestamping and Verifying a Classical
Protocol \\
Verifying a Deployed Protocol \\
Modelling Agents' Knowledge of Messages \\
Verifying Another Deployed Protocol \\
Modelling Smartcards \\
Verifying a Smartcard Protocol \\
Modelling Accountability \\
Verifying Two Accountability Protocols \\
Conclusions \\
Appendices \\
References/P",
}
@TechReport{Bernstein:2007:SFS,
author = "Daniel J. Bernstein",
title = "The {Salsa20} family of stream ciphers",
type = "Report",
institution = "Department of Mathematics, Statistics, and Computer
Science (M/C 249), The University of Illinois at
Chicago",
address = "Chicago, IL 60607-7045",
day = "25",
month = dec,
year = "2007",
bibdate = "Thu Jan 10 12:16:52 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://cr.yp.to/snuffle/salsafamily-20071225.pdf",
abstract = "Salsa20 is a family of 256-bit stream ciphers designed
in 2005 and submitted to eSTREAM, the ECRYPT Stream
Cipher Project. Salsa20 has progressed to the third
round of eSTREAM without any changes. The 20-round
stream cipher Salsa20/20 is consistently faster than
AES and is recommended by the designer for typical
cryptographic applications. The reduced-round ciphers
Salsa20/12 and Salsa20/8 are among the fastest 256-bit
stream ciphers available and are recommended for
applications where speed is more important than
confidence. The fastest known attacks use $ 2^{153} $
simple operations against Salsa20/7, $ 2^{249} $ simple
operations against Salsa20/8, and $ 2^{255} $$ simple
operations against Salsa20/9, Salsa20/10, etc. In this
paper, the Salsa20 designer presents Salsa20 and
discusses the decisions made in the Salsa20 design.",
acknowledgement = ack-nhfb,
}
@Article{Bhargav-Spantzel:2007:PPM,
author = "Abhilasha Bhargav-Spantzel and Anna C. Squicciarini
and Shimon Modi and Matthew Young and Elisa Bertino and
Stephen J. Elliott",
title = "Privacy preserving multi-factor authentication with
biometrics",
journal = j-J-COMP-SECUR,
volume = "15",
number = "5",
pages = "529--560",
month = "????",
year = "2007",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2007-15503",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:42 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Book{Bleumer:2007:EPS,
author = "Gerrit Bleumer",
title = "Electronic postage systems: technology, security,
economics",
volume = "26",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxiii + 248",
year = "2007",
ISBN = "0-387-29313-2 (hardcover)",
ISBN-13 = "978-0-387-29313-4 (hardcover)",
LCCN = "HE6125 .B545 2007",
bibdate = "Mon Feb 22 15:40:03 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Advances in information security",
URL = "http://www.loc.gov/catdir/enhancements/fy0824/2006933129-b.html;
http://www.loc.gov/catdir/enhancements/fy0824/2006933129-d.html;
http://www.loc.gov/catdir/toc/fy0801/2006933129.html",
acknowledgement = ack-nhfb,
subject = "Postal service; Technological innovations; Data
processing; Computer security; 2-D bar codes",
}
@InProceedings{Boneh:2007:BLP,
author = "D. Boneh",
title = "A Brief Look at Pairings Based Cryptography",
crossref = "IEEE:2007:PAI",
pages = "19--26",
year = "2007",
DOI = "https://doi.org/10.1109/FOCS.2007.51",
bibdate = "Thu Apr 12 09:33:17 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466",
}
@Article{Boneh:2007:CCS,
author = "Dan Boneh and Ran Canetti and Shai Halevi and Jonathan
Katz",
title = "Chosen-Ciphertext Security from Identity-Based
Encryption",
journal = j-SIAM-J-COMPUT,
volume = "36",
number = "5",
pages = "1301--1328",
month = "????",
year = "2007",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:39 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/36/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Boneh:2007:SEI,
author = "D. Boneh and C. Gentry and M. Hamburg",
title = "Space-Efficient Identity Based Encryption Without
Pairings",
crossref = "IEEE:2007:PAI",
pages = "647--657",
year = "2007",
DOI = "https://doi.org/10.1109/FOCS.2007.50",
bibdate = "Thu Apr 12 09:33:17 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466",
}
@Article{Bresson:2007:PSA,
author = "Emmanuel Bresson and Olivier Chevassut and David
Pointcheval",
title = "Provably secure authenticated group {Diffie--Hellman}
key exchange",
journal = j-TISSEC,
volume = "10",
number = "3",
pages = "10:1--10:??",
month = jul,
year = "2007",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1266977.1266979",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:14 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Authenticated key-exchange protocols allow two
participants A and B, communicating over a public
network and each holding an authentication means to
exchange a shared secret value. Methods designed to
deal with this cryptographic problem ensure A (resp. B
) that no other participants aside from B (resp. A )
can learn any information about the agreed value and
often also ensure A and B that their respective partner
has actually computed this value. A natural extension
to this cryptographic method is to consider a pool of
participants exchanging a shared secret value and to
provide a formal treatment for it. Starting from the
famous two-party Diffie--Hellman (DH) key-exchange
protocol and from its authenticated variants, security
experts have extended it to the multiparty setting for
over a decade and, in the past few years, completed a
formal analysis in the framework of modern
cryptography. The present paper synthesizes this body
of work on the provably-secure authenticated group DH
key exchange.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "cryptography; Diffie--Hellman; Group Key Exchange",
}
@Article{Breveglieri:2007:OCA,
author = "L. Breveglieri and I. Koren and P. Maistri",
title = "An Operation-Centered Approach to Fault Detection in
Symmetric Cryptography Ciphers",
journal = j-IEEE-TRANS-COMPUT,
volume = "56",
number = "5",
pages = "635--649",
month = may,
year = "2007",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2007.1015",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 15:03:38 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4118667",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Brown:2007:SAN,
author = "Daniel R. L. Brown and Kristian Gj{\o}steen",
title = "A security analysis of the {NIST SP 800-90} elliptic
curve random number generator",
crossref = "Menezes:2007:ACC",
pages = "466--481",
year = "2007",
bibdate = "Fri Jan 6 09:50:45 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://dl.acm.org/citation.cfm?id=1777777.1777815",
abstract = "An elliptic curve random number generator (ECRNG) has
been approved in a NIST standard and proposed for ANSI
and SECG draft standards. This paper proves that, if
three conjectures are true, then the ECRNG is secure.
The three conjectures are hardness of the elliptic
curve decisional Diffie--Hellman problem and the
hardness of two newer problems, the $x$-logarithm
problem and the truncated point problem. The
$x$-logarithm problem is shown to be hard if the
decisional Diffie-Hellman problem is hard, although the
reduction is not tight. The truncated point problem is
shown to be solvable when the minimum amount of bits
allowed in NIST standards are truncated, thereby making
it insecure for applications such as stream ciphers.
Nevertheless, it is argued that for nonce and key
generation this distinguishability is harmless.",
acknowledgement = ack-nhfb,
acmid = "1777815",
keywords = "elliptic curve cryptography, random number
generation",
location = "Santa Barbara, CA, USA",
pagecount = "16",
}
@Article{Bruss:2007:QCS,
author = "Dagmar Bruss and G{\'a}bor Erd{\'e}lyi and Tim Meyer
and Tobias Riege and J{\"o}rg Rothe",
title = "Quantum cryptography: a survey",
journal = j-COMP-SURV,
volume = "39",
number = "2",
pages = "1--27",
month = "????",
year = "2007",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1242471.1242474",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Aug 21 08:49:42 MDT 2007",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We survey some results in quantum cryptography. After
a brief introduction to classical cryptography, we
provide the quantum-mechanical background needed to
present some fundamental protocols from quantum
cryptography. In particular, we review quantum key
distribution via the BB84 protocol and its security
proof, as well as the related quantum bit commitment
protocol and its proof of insecurity.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
}
@Article{Bugliesi:2007:DTA,
author = "Michele Bugliesi and Riccardo Focardi and Matteo
Maffei",
title = "Dynamic types for authentication",
journal = j-J-COMP-SECUR,
volume = "15",
number = "6",
pages = "563--617",
month = "????",
year = "2007",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2007-15602",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:45 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Bugliesi:2007:SIT,
author = "Michele Bugliesi and Marco Giunti",
title = "Secure implementations of typed channel abstractions",
journal = j-SIGPLAN,
volume = "42",
number = "1",
pages = "251--262",
month = jan,
year = "2007",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1190216.1190253",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 10:53:14 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The challenges hidden in the implementation of
high-level process calculi into low-level environments
are well understood [3]. This paper develops a secure
implementation of a typed pi calculus, in which
capability types are employed to realize the policies
for the access to communication channels. Our
implementation compiles high-level processes of the
pi-calculus into low-level principals of a
cryptographic process calculus based on the applied-pi
calculus [1]. In this translation, the high-level type
capabilities are implemented as term capabilities
protected by encryption keys only known to the intended
receivers. As such, the implementation is effective
even when the compiled, low-level principals are
deployed in open contexts for which no assumption on
trust and behavior may be made. Our technique and
results draw on, and extend, previous work on secure
implementation of channel abstractions in a dialect of
the join calculus [2]. In particular, our translation
preserves the forward secrecy of communications in a
calculus that includes matching and supports the
dynamic exchange of write and read access-rights among
processes. We establish the adequacy and full
abstraction of the implementation by contrasting the
untyped equivalences of the low-level cryptographic
calculus, with the typed equivalences of the high-level
source calculus.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "full abstraction; language encodings; typed behavioral
theories",
}
@InProceedings{Caballero-Gil:2007:PSC,
author = "Pino Caballero-Gil and Gerasimos C. Meletiou",
title = "Preface of the Symposium 15: Cryptology, Information
Security, and Networks",
crossref = "Simos:2007:CMS",
volume = "2B",
pages = "935--936",
year = "2007",
bibdate = "Thu Feb 21 14:34:40 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://proceedings.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&
id=APCPCS000963000002000935000001& idtype=cvips",
acknowledgement = ack-nhfb,
}
@Article{Cai:2007:CSM,
author = "Hongxu Cai and Zhong Shao and Alexander Vaynberg",
title = "Certified self-modifying code",
journal = j-SIGPLAN,
volume = "42",
number = "6",
pages = "66--77",
month = jun,
year = "2007",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1250734.1250743",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 10:55:30 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Self-modifying code (SMC), in this paper, broadly
refers to any program that loads, generates, or mutates
code at runtime. It is widely used in many of the
world's critical software systems to support runtime
code generation and optimization, dynamic loading and
linking, OS boot loader, just-in-time compilation,
binary translation,or dynamic code encryption and
obfuscation. Unfortunately, SMC is also extremely
difficult to reason about: existing formal verification
techniques-including Hoare logic and type
system-consistently assume that program code stored in
memory is fixed and immutable; this severely limits
their applicability and power.\par
This paper presents a simple but novel Hoare-logic-like
framework that supports modular verification of general
von-Neumann machine code with runtime code
manipulation. By dropping the assumption that code
memory is fixed and immutable, we are forced to apply
local reasoning and separation logic at the very
beginning, and treat program code uniformly as regular
data structure. We address the interaction between
separation and code memory and show how to establish
the frame rules for local reasoning even in the
presence of SMC. Our framework is realistic, but
designed to be highly generic, so that it can support
assembly code under all modern CPUs (including both x86
and MIPS). Our system is expressive and fully
mechanized. We prove its soundness in the Coq proof
assistant and demonstrate its power by certifying a
series of realistic examples and applications-all of
which can directly run on the SPIM simulator or any
stock x86 hardware.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "assembly code verification; Hoare logic; modular
verification; runtime code manipulation; self-modifying
code",
}
@InProceedings{Canetti:2007:CSH,
author = "R. Canetti and R. Pass and A. Shelat",
title = "Cryptography from Sunspots: How to Use an Imperfect
Reference String",
crossref = "IEEE:2007:PAI",
pages = "249--259",
year = "2007",
DOI = "https://doi.org/10.1109/FOCS.2007.70",
bibdate = "Thu Apr 12 09:33:17 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466",
}
@Book{Capaldi:2007:ADI,
author = "Nicholas Capaldi and Miles Smit",
title = "The art of deception: an introduction to critical
thinking",
publisher = "Prometheus Books",
address = "Amherst, NY, USA",
pages = "277",
year = "2007",
ISBN = "1-59102-532-X",
ISBN-13 = "978-1-59102-532-0",
LCCN = "BC177 .C345 2007",
bibdate = "Wed Feb 17 16:45:13 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip078/2007001612.html",
acknowledgement = ack-nhfb,
subject = "Logic; Critical thinking; Fallacies (Logic)",
tableofcontents = "How to: win an argument defend a case recognize a
fallacy see through deception persuade a skeptic turn
defeat into victory. Identifying arguments \\
Formal analysis of arguments \\
Presenting your case \\
Attacking an argument \\
Defending your case \\
Cause-and-effect reasoning",
}
@Article{Castiglione:2007:TAD,
author = "A. Castiglione and A. {De Santis} and C. Soriente",
title = "Taking advantages of a disadvantage: {Digital}
forensics and steganography using document metadata",
journal = j-J-SYST-SOFTW,
volume = "80",
number = "5",
pages = "750--764",
month = may,
year = "2007",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chai:2007:EIB,
author = "Zhenchuan Chai and Zhenfu Cao and Xiaolei Dong",
title = "Efficient {ID}-Based Multi-Receiver Threshold
Decryption",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "18",
number = "5",
pages = "987--1004",
month = oct,
year = "2007",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054107005091",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science (IJFCS)",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Book{Chakrabarti:2007:GCS,
author = "Anirban Chakrabarti",
title = "{Grid} computing security",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 331",
year = "2007",
ISBN = "3-540-44492-0 (hardcover)",
ISBN-13 = "978-3-540-44492-3 (hardcover)",
LCCN = "QA76.9.C58 C53 2007",
bibdate = "Fri Jun 20 11:55:39 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
subject = "Computational grids (Computer systems); Computer
security",
}
@Article{Chakrabarti:2007:PBA,
author = "Saikat Chakrabarti and Mukesh Singhal",
title = "Password-Based Authentication: Preventing Dictionary
Attacks",
journal = j-COMPUTER,
volume = "40",
number = "6",
pages = "68--74",
month = jun,
year = "2007",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2007.216",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Chandramouli:2007:ISS,
author = "Ramaswamy Chandramouli and Philip Lee",
title = "Infrastructure Standards for Smart {ID} Card
Deployment",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "92--96",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.34",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Chang:2007:SIH,
author = "Chin-Chen Chang and Chih-Yang Lin and Chun-Sen Tseng",
title = "Secret Image Hiding and Sharing Based on the $ (t,
n)$-Threshold",
journal = j-FUND-INFO,
volume = "76",
number = "4",
pages = "399--411",
month = dec,
year = "2007",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:05:24 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chatterjee:2007:CSC,
author = "S. Chatterjee and P. Sarkar",
title = "Constant Size Ciphertext {HIBE} in the Augmented
Selective-{ID} Model and its Extensions",
journal = j-J-UCS,
volume = "13",
number = "10",
pages = "1367--1395",
month = "????",
year = "2007",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_13_10/constant_size_ciphertext_hibe",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Chatzikokolakis:2007:FAP,
author = "Konstantinos Chatzikokolakis and Catuscia
Palamidessi",
title = "A framework for analyzing probabilistic protocols and
its application to the {Partial Secrets Exchange}",
journal = j-THEOR-COMP-SCI,
volume = "389",
number = "3",
pages = "512--527",
day = "15",
month = dec,
year = "2007",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 22:12:00 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Chen:2007:CIS,
author = "Wen-Yuan Chen",
title = "Color image steganography scheme using set
partitioning in hierarchical trees coding, digital
{Fourier} transform and adaptive phase modulation",
journal = j-APPL-MATH-COMP,
volume = "185",
number = "1",
pages = "432--448",
day = "1",
month = feb,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chen:2007:CRA,
author = "Chien-Yuan Chen and Cheng-Yuan Ku and David C. Yen",
title = "Cryptographic relational algebra for databases using
the field authenticator",
journal = j-COMPUT-MATH-APPL,
volume = "54",
number = "1",
pages = "38--44",
month = jul,
year = "2007",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:02 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122107001721",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Cherry:2007:MEV,
author = "S. Cherry",
title = "Making Every E-Vote Count",
journal = j-IEEE-SPECTRUM,
volume = "44",
number = "1",
pages = "13--14",
month = jan,
year = "2007",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2007.273028",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "complete voting system; cryptography; Cryptography;
Databases; e-vote; Electronic equipment; Electronic
voting; electronic voting systems; government data
processing; Information security; Microcomputers;
Nominations and elections; Physics computing; Portable
computers; Postal services; Punchscan; Southern
California",
}
@Book{Chess:2007:SPS,
author = "Brian Chess and Jacob West",
title = "Secure programming with static analysis",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxix + 587",
year = "2007",
ISBN = "0-321-42477-8 (paperback)",
ISBN-13 = "978-0-321-42477-8 (paperback)",
LCCN = "QA76.9.A25 C443 2007",
bibdate = "Mon May 5 12:41:36 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Addison-Wesley software security series",
URL = "http://www.loc.gov/catdir/toc/ecip0713/2007010226.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Debugging in computer science;
Computer software; Quality control",
}
@Article{Chien:2007:SUL,
author = "Hung-Yu Chien and Chen-Wei Huang",
title = "Security of ultra-lightweight {RFID} authentication
protocols and its improvements",
journal = j-OPER-SYS-REV,
volume = "41",
number = "4",
pages = "83--86",
month = jul,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1278901.1278916",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:17:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The design of ultra-lightweight authentication
protocols is imperative to the pervasive deployment of
low-cost RFIDs. This paper examines the security of two
well known ultra-lightweight authentication protocols
(LMAP and M2AP) and the improved scheme. We demonstrate
our efficient attacks on the protocols, and highlight
the key weaknesses of the designs.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
keywords = "authentication; desynchronization; privacy; RFID;
security",
}
@InProceedings{Chung:2007:ASF,
author = "Jaewook Chung and M. Anwar Hasan",
title = "Asymmetric Squaring Formulae",
crossref = "Kornerup:2007:PIS",
pages = "113--122",
year = "2007",
DOI = "https://doi.org/10.1109/ARITH.2007.11",
bibdate = "Tue Oct 9 16:32:41 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present efficient squaring formulae based on the
Toom--Cook multiplication algorithm. The latter always
requires at least one non-trivial constant division in
the interpolation step. We show such non-trivial
divisions are not needed in the case two operands are
equal for three, four and five-way squarings. Our
analysis shows that our 3-way squaring algorithms have
much less overhead than the best known 3-way Toom--Cook
algorithm. Our experimental results show that one of
our new 3-way squaring methods performs faster than
mpz\_mul() in GNU multiple precision library (GMP) for
squaring integers of approximately 2400-6700 bits on
Pentium IV Prescott 3.2GHz. For squaring in $ Z[x] $,
our 3-way squaring algorithms are much superior to
other known squaring algorithms for small input size.
In addition, we present 4-way and 5-way squaring
formulae which do not require any constant divisions by
integers other than a power of 2. Under some reasonable
assumptions, our 5-way squaring formula is faster than
the recently proposed Montgomery's 5-way Karatsuba-like
formulae.",
acknowledgement = ack-nhfb,
keywords = "Cook multiplication algorithm; Karatsuba algorithm;
Karatsuba-like formulae; Montgomery's Squaring;
Toom-multiple-precision arithmetic",
}
@InProceedings{Chung:2007:MRA,
author = "Jaewook Chung and M. Anwar Hasan",
title = "{Montgomery} Reduction Algorithm for Modular
Multiplication Using Low-Weight Polynomial Form
Integers",
crossref = "Kornerup:2007:PIS",
pages = "230--239",
year = "2007",
DOI = "https://doi.org/10.1109/ARITH.2007.23",
bibdate = "Tue Oct 9 17:16:03 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this paper, we extend a recent piece of work on
low-weight polynomial form integers (LWPFIs). We
present a new coefficient reduction algorithm based on
the Montgomery reduction algorithm and provide its
detailed analysis results. We give a condition for
eliminating the final subtractions at the end of our
Montgomery reduction algorithm adapted to perform the
coefficient reduction. Our experimental results show
that a new coefficient reduction algorithm is indeed
more efficient than the one presented in [1].",
acknowledgement = ack-nhfb,
}
@Article{Chung:2007:SBW,
author = "Kuo-Liang Chung and Wei-Ning Yang and Yong-Huai Huang
and Shih-Tung Wu and Yu-Chiao Hsu",
title = "On {SVD}-based watermarking algorithm",
journal = j-APPL-MATH-COMP,
volume = "188",
number = "1",
pages = "54--57",
day = "1",
month = may,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:04 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Cimato:2007:CVC,
author = "S. Cimato and R. {De Prisco} and A. {De Santis}",
title = "Colored visual cryptography without color darkening",
journal = j-THEOR-COMP-SCI,
volume = "374",
number = "1--3",
pages = "261--276",
day = "20",
month = apr,
year = "2007",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:41 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Clarke:2007:AUA,
author = "N. L. Clarke and S. M. Furnell",
title = "Advanced user authentication for mobile devices",
journal = j-COMPUT-SECUR,
volume = "26",
number = "2",
pages = "109--119",
month = mar,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:05 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404806001428",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Collberg:2007:DGB,
author = "Christian S. Collberg and Clark Thomborson and Gregg
M. Townsend",
title = "Dynamic graph-based software fingerprinting",
journal = j-TOPLAS,
volume = "29",
number = "6",
pages = "35:1--35:67",
month = oct,
year = "2007",
CODEN = "ATPSDT",
DOI = "https://doi.org/10.1145/1286821.1286826",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
ISSN-L = "0164-0925",
bibdate = "Wed Jun 11 19:22:40 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toplas/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Fingerprinting embeds a secret message into a cover
message. In media fingerprinting, the secret is usually
a copyright notice and the cover a digital image.
Fingerprinting an object discourages intellectual
property theft, or when such theft has occurred, allows
us to prove ownership.\par
The Software Fingerprinting problem can be described as
follows. Embed a structure W into a program P such
that: W can be reliably located and extracted from P
even after P has been subjected to code transformations
such as translation, optimization and obfuscation; W is
stealthy; W has a high data rate; embedding W into P
does not adversely affect the performance of P; and W
has a mathematical property that allows us to argue
that its presence in P is the result of deliberate
actions.\par
In this article, we describe a software fingerprinting
technique in which a dynamic graph fingerprint is
stored in the execution state of a program. Because of
the hardness of pointer alias analysis such
fingerprints are difficult to attack automatically.",
acknowledgement = ack-nhfb,
articleno = "35",
fjournal = "ACM Transactions on Programming Languages and
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783",
}
@Article{Damaj:2007:PAD,
author = "Issam W. Damaj",
title = "Parallel Algorithms Development for Programmable
Devices with Application from Cryptography",
journal = j-INT-J-PARALLEL-PROG,
volume = "35",
number = "6",
pages = "529--572",
month = dec,
year = "2007",
CODEN = "IJPPE5",
DOI = "https://doi.org/10.1007/s10766-007-0046-1",
ISSN = "0885-7458 (print), 1573-7640 (electronic)",
ISSN-L = "0885-7458",
bibdate = "Wed Jul 9 16:06:53 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=35&issue=6;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=35&issue=6&spage=529",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Parallel Programming",
journal-URL = "http://link.springer.com/journal/10766",
keywords = "data encryption; formal models; gate array;
methodologies; Parallel algorithms",
}
@Book{Daswani:2007:FSW,
author = "Neil Daswani and Christoph Kern and Anita Kesavan",
title = "Foundations of security: what every programmer needs
to know",
publisher = pub-APRESS,
address = pub-APRESS:adr,
pages = "xxvii + 290",
year = "2007",
ISBN = "1-59059-784-2 (paperback)",
ISBN-13 = "978-1-59059-784-2 (paperback)",
LCCN = "QA76.76.P76 D37 2007",
bibdate = "Wed Jan 12 11:18:20 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "The Expert's voice in security",
acknowledgement = ack-nhfb,
subject = "Software protection; Computer security; Data
encryption (Computer science)",
tableofcontents = "Pt. 1. Security design principles \\
Security goals \\
Secure systems design \\
Secure design principles \\
Exercises for part 1 \\
Pt. 2. Secure programming techniques \\
Worms and other malware \\
Buffer overflows \\
Client-state manipulation \\
SQL injection \\
Password security \\
Cross-domain security in web applications \\
Exercises for part 2 \\
Pt. 3. Introduction to cryptography \\
Symmetric key cryptography \\
Asymmetric key cryptography \\
Key management and exchange \\
MACs and signatures \\
Exercises for part 3",
}
@Article{Davis:2007:AAA,
author = "Adrian Davis",
title = "Authentication across the airwaves",
journal = j-NETWORK-SECURITY,
volume = "2007",
number = "2",
pages = "13--19",
month = feb,
year = "2007",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(07)70019-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:36 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485807700193",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Daza:2007:CTM,
author = "Vanesa Daza and Javier Herranz and Paz Morillo and
Carla R{\`a}fols",
title = "Cryptographic techniques for mobile ad-hoc networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "18",
pages = "4938--4950",
day = "19",
month = dec,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:22 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{deBorde:2007:STF,
author = "Duncan de Borde",
title = "Selecting a two-factor authentication system",
journal = j-NETWORK-SECURITY,
volume = "2007",
number = "7",
pages = "17--20",
month = jul,
year = "2007",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(07)70066-1",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485807700661",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{deLeeuw:2007:HIS,
editor = "Karl de Leeuw and J. A. Bergstra",
booktitle = "The History of Information Security: a Comprehensive
Handbook",
title = "The History of Information Security: a Comprehensive
Handbook",
publisher = pub-ELSEVIER,
address = pub-ELSEVIER:adr,
pages = "xi + 887",
year = "2007",
ISBN = "0-444-51608-5 (hardcover)",
ISBN-13 = "978-0-444-51608-4 (hardcover)",
LCCN = "Z103 .H63 2007",
bibdate = "Thu Dec 28 09:22:43 MST 2017",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
abstract = "Information Security is usually achieved through a mix
of technical, organizational and legal measures. These
may include the application of cryptography, the
hierarchical modeling of organizations in order to
assure confidentiality, or the distribution of
accountability and responsibility by law, among
interested parties. The history of Information Security
reaches back to ancient times and starts with the
emergence of bureaucracy in administration and warfare.
Some aspects, such as the interception of encrypted
messages during World War II, have attracted huge
attention, whereas other aspects have remained largely
uncovered. There has never been any effort to write a
comprehensive history. This is most unfortunate,
because Information Security should be perceived as a
set of communicating vessels, where technical
innovations can make existing legal or organisational
frame-works obsolete and a breakdown of political
authority may cause an exclusive reliance on technical
means. This book is intended as a first field-survey.
It consists of twenty-eight contributions, written by
experts in such diverse fields as computer science,
law, or history and political science, dealing with
episodes, organisations and technical developments that
may considered to be exemplary or have played a key
role in the development of this field. These include:
the emergence of cryptology as a discipline during the
Renaissance, the Black Chambers in 18th century Europe,
the breaking of German military codes during World War
II, the histories of the NSA and its Soviet
counterparts and contemporary cryptology. Other
subjects are: computer security standards, viruses and
worms on the Internet, computer transparency and free
software, computer crime, export regulations for
encryption software and the privacy debate. Key
Features --- Interdisciplinary coverage of the history
Information Security --- Written by top experts in law,
history, computer and information science --- First
comprehensive work in Information Security.",
acknowledgement = ack-nhfb,
subject = "Cryptography; History; Computer security; Copyright;
Databescherming",
tableofcontents = "1: Introduction / Karl de Leeuw / 1--25 \\
2: Limitations on the publishing of scientific research
/ Jack Meadows / 29--51 \\
3: Industrialists, inventors and the German patent
system, 1877--1957: A comparative perspective / Kees
Gispen / 53--81 \\
4: Reflecting media: A cultural history of copyright
and the media Robert Verhoogt and Chris Schriks /
83--119 \\
5: The history of copyright protection of computer
software: the emancipation of a work of technology
toward a work of authorship / Madeleine de Cock Buning
/ 121--140 \\
6: A history of software patents / Robert Plotkin /
141--164 \\
7: Semiotics of identity management / Pieter Wisse /
167--196 \\
8: History of document security / Karel Johan Schell /
197--241 \\
9: From frankpledge to chip and pin: Identification and
identity in England, 1475--2005 / Edward Higgs /
243--262 \\
10: The scientific development of biometrics over the
last 40 years / James L. Wayman / 263--274 \\
11: The rise of cryptology in the European Renaissance
/ Gerhard F. Strasser / 277--325 \\
12: Cryptology in the Dutch Republic: A case-study /
Karl de Leeuw / 327--367 \\
13: Intelligence and the emergence of the information
society in Eighteenth-Century Britain / Jeremy Black /
369--379 \\
14: Rotor machines and bombes / Friedrich L. Bauer /
381--446 \\
15: Tunny and Colossus: Breaking the Lorenz
Schl{\"u}sselzusatz traffic / B. Jack Copeland /
447--477 \\
16: Boris Hagelin and Crypto AG: Pioneers of encryption
/ Silvan Frik / 479--496 \\
17: Eavesdroppers of the Kremlin: KGB sigint during the
Cold War / Mathew M. Aid / 497--522 \\
18: National Security Agency: The historiography of
concealment / Joseph Fitsanakis / 523--563 \\
19: An introduction to modern cryptology / Bart Preneel
/ 565--592 \\
20: A history of computer security standards / Jeffrey
R. Yost / 595--621 \\
21: Security models / Dieter Gollmann / 623--635 \\
22: Computer security through correctness and
transparency / Hans Meijer, Jaap-Henk Hoepman, Bart
Jacobs, Erik Poll / 637--653 \\
23: IT security and IT auditing between 1960 and 2000 /
Margaret van Biene-Hershey / 655--680 \\
24: A history of internet security / Laura DeNardis /
681--704 \\
25: History of computer crime / Susan W. Brenner /
705--721 \\
26: The export of cryptography in the 20th and the 21st
centuries / Whitfield Diffie and Susan Landau /
725--736 \\
27: History of privacy / Jan Holvast / 737--769 \\
28: Munitions, wiretaps and MP3s: The changing
interface between privacy and encryption policy in the
information society / Andrew Charlesworth / 771--817
\\
29: The information revolution and the transformation
of warfare / Dan Kuehl / 821--832 \\
Biographies / 833--839 \\
Author index / 841--860 \\
Subject index / 861--887",
}
@Book{Delfs:2007:ICP,
author = "Hans Delfs and Helmut Knebl",
title = "Introduction to Cryptography: Principles and
Applications",
volume = "1",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Second",
pages = "xvi + 367",
year = "2007",
DOI = "https://doi.org/10.1007/3-540-49244-5",
ISBN = "3-540-49243-7 (hardcover), 3-540-49244-5",
ISBN-13 = "978-3-540-49243-6 (hardcover), 978-3-540-49244-3",
ISSN = "1619-7100 (print), 2197-845X (electronic)",
ISSN-L = "1619-7100",
LCCN = "QA76.9A25 D44 2007; QA76.9.D35",
bibdate = "Sat Jun 10 08:34:43 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Information Security and Cryptography",
URL = "http://www.springerlink.com/content/gm2886",
abstract = "In the first part, this book covers the key concepts
of cryptography on an undergraduate level, from
encryption and digital signatures to cryptographic
protocols. Essential techniques are demonstrated in
protocols for key exchange, user identification,
electronic elections and digital cash. In the second
part, more advanced topics are addressed, such as the
bit security of one-way functions and computationally
perfect pseudorandom bit generators. The security of
cryptographic schemes is a central topic. Typical
examples of provably secure encryption and signature
schemes and their security proofs are given. Though
particular attention is given to the mathematical
foundations, no special background in mathematics is
presumed. The necessary algebra, number theory and
probability theory are included in the appendix. Each
chapter closes with a collection of exercises.",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography; Computer networks;
Security measures; Cryptography; Security measures;
Computer security; Informatique; Security measures;
Computer security; Cryptography; Coding theory; Data
encryption (Computer science); Data protection; Data
structures (Computer science); Number theory; Coding
theory; Data encryption (Computer science); Data
protection; Data structures (Computer science); Number
theory.",
tableofcontents = "1. Introduction \\
2. Symmetric-key encryption \\
3. Public-key cryptography \\
4. Cryptographic protocols \\
5. Probabilistic algorithms \\
6. One-way functions and the basic assumptions \\
7. Bit security of one-way functions \\
8. One-way functions and pseudorandomness \\
9. Provably secure encryption \\
10. Provably secure digital signatures \\
A. Algebra and number theory \\
B. Probabilities and information theory \\
References \\
Index",
}
@InProceedings{Delgado:2007:SCD,
author = "Oscar Delgado and Amparo F{\'u}ster",
title = "Stream Cipher Design for {MANets}",
crossref = "Simos:2007:CMS",
volume = "2B",
pages = "965--968",
year = "2007",
bibdate = "Thu Feb 21 14:34:40 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://proceedings.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&
id=APCPCS000963000002000965000001& idtype=cvips",
acknowledgement = ack-nhfb,
}
@Article{DeLooze:2007:PWS,
author = "Lori DeLooze",
title = "Providing {Web} Service Security in a Federated
Environment",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "73--75",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.16",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{DeSantis:2007:NRN,
author = "Alfredo {De Santis} and Barbara Masucci",
title = "New results on non-perfect sharing of multiple
secrets",
journal = j-J-SYST-SOFTW,
volume = "80",
number = "2",
pages = "216--223",
month = feb,
year = "2007",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Book{Diffie:2007:PLP,
author = "Whitfield Diffie and Susan Eva Landau",
title = "Privacy on the line: the politics of wiretapping and
encryption",
publisher = pub-MIT,
address = pub-MIT:adr,
edition = "Updated and expanded",
pages = "400 (est.)",
year = "2007",
ISBN = "0-262-04240-1",
ISBN-13 = "978-0-262-04240-6",
LCCN = "UB256.U6 D54 2007",
bibdate = "Tue Apr 17 14:28:32 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip073/2006035514.html",
acknowledgement = ack-nhfb,
subject = "Electronic intelligence; United States; Wiretapping;
Data encryption (Computer science); Law and
legislation; Electronic surveillance; Political
aspects; Telecommunication; Privacy, Right of",
}
@Article{Dimitriadis:2007:IMC,
author = "Christos K. Dimitriadis",
title = "Improving Mobile Core Network Security with
Honeynets",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "4",
pages = "40--47",
month = jul # "\slash " # aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.85",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:45 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Ding:2007:ESD,
author = "Xuhua Ding and Daniele Mazzocchi and Gene Tsudik",
title = "Equipping smart devices with public key signatures",
journal = j-TOIT,
volume = "7",
number = "1",
pages = "3:1--3:??",
month = feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1189740.1189743",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 16 10:57:52 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "One of the major recent trends in computing has been
towards so-called smart devices, such as PDAs, cell
phones and sensors. Such devices tend to have a feature
in common: limited computational capabilities and
equally limited power, as most operate on batteries.
This makes them ill-suited for public key signatures.
This article explores practical and conceptual
implications of using Server-Aided Signatures (SAS) for
these devices. SAS is a signature method that relies on
partially-trusted servers for generating (normally
expensive) public key signatures for regular users.
Although the primary goal is to aid small,
resource-limited devices in signature generation, SAS
also offers fast certificate revocation, signature
causality and reliable timestamping. It also has some
interesting features such as built-in attack detection
for users and DoS resistance for servers. Our
experimental results also validate the feasibility of
deploying SAS on smart devices.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "digital signatures; public key infrastructure",
}
@Article{Domingo-Ferrer:2007:ASC,
author = "Josep Domingo-Ferrer and Joachim Posegga and Francesc
Seb{\'e} and Vicen{\c{c}} Torra",
title = "Advances in smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2219--2222",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Doncel:2007:ODS,
author = "Victor Rodriguez Doncel and Nikos Nikolaidis and
Ioannis Pitas",
title = "An Optimal Detector Structure for the {Fourier}
Descriptors Domain Watermarking of {$2$D} Vector
Graphics",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "13",
number = "5",
pages = "851--863",
month = sep # "\slash " # oct,
year = "2007",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2007.1050",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Thu Jul 3 15:20:23 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@TechReport{Dorrendorf:2007:CRNa,
author = "Leo Dorrendorf and Zvi Gutterman and Benny Pinkas",
title = "Cryptanalysis of the Random Number Generator of the
{Windows} Operating System",
type = "Technical report",
number = "2007/419",
institution = "Cryptology ePrint Archive, International Association
for Cryptologic Research",
address = "San Jose, CA, USA",
year = "2007",
bibdate = "Fri Nov 16 16:07:16 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eprint.iacr.org/2007/419",
abstract = "The pseudo-random number generator (PRNG) used by the
Windows operating system is the most commonly used
PRNG. The pseudo-randomness of the output of this
generator is crucial for the security of almost any
application running in Windows. Nevertheless, its exact
algorithm was never published.\par
We examined the binary code of a distribution of
Windows 2000, which is still the second most popular
operating system after Windows XP. (This investigation
was done without any help from Microsoft.) We
reconstructed, for the first time, the algorithm used
by the pseudo-random number generator (namely, the
function CryptGenRandom). We analyzed the security of
the algorithm and found a non-trivial attack: given the
internal state of the generator, the previous state can
be computed in $ O(2^{23}) $ work (this is an attack on
the forward-security of the generator, an $ O(1) $
attack on backward security is trivial). The attack on
forward-security demonstrates that the design of the
generator is flawed, since it is well known how to
prevent such attacks.\par
We also analyzed the way in which the generator is run
by the operating system, and found that it amplifies
the effect of the attacks: The generator is run in user
mode rather than in kernel mode, and therefore it is
easy to access its state even without administrator
privileges. The initial values of part of the state of
the generator are not set explicitly, but rather are
defined by whatever values are present on the stack
when the generator is called.Furthermore, each process
runs a different copy of the generator, and the state
of the generator is refreshed with system generated
entropy only after generating 128 KBytes of output for
the process running it. The result of combining this
observation with our attack is that learning a single
state may reveal 128 Kbytes of the past and future
output of the generator.\par
The implication of these findings is that a buffer
overflow attack or a similar attack can be used to
learn a single state of the generator, which can then
be used to predict all random values, such as SSL keys,
used by a process in all its past and future operation.
This attack is more severe and more efficient than
known attacks, in which an attacker can only learn SSL
keys if it is controlling the attacked machine at the
time the keys are used.",
}
@InProceedings{Dorrendorf:2007:CRNb,
author = "Leo Dorrendorf and Zvi Gutterman and Benny Pinkas",
booktitle = "{CCS '07: Proceedings of the 14th ACM conference on
computer and communications security}",
title = "Cryptanalysis of the Random Number Generator of the
{Windows} Operating System",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "????",
year = "2007",
DOI = "https://doi.org/10.1145/1315245.1315304",
ISBN = "1-59593-703-X",
ISBN-13 = "978-1-59593-703-2",
LCCN = "????",
bibdate = "Fri Jan 06 09:36:58 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
abstract = "The pseudo-random number generator (PRNG) used by the
Windows operating system is the most commonly used
PRNG. The pseudo-randomness of the output of this
generator is crucial for the security of almost any
application running in Windows. Nevertheless, its exact
algorithm was never published.\par
We examined the binary code of a distribution of
Windows 2000, which is still the second most popular
operating system after Windows XP. (This investigation
was done without any help from Microsoft.) We
reconstructed, for the first time, the algorithm used
by the pseudo-random number generator (namely, the
function CryptGenRandom). We analyzed the security of
the algorithm and found a non-trivial attack: given the
internal state of the generator, the previous state can
be computed in $ O(2^{23}) $ work (this is an attack on
the forward-security of the generator, an $ O(1) $
attack on backward security is trivial). The attack on
the forward-security demonstrates that the design of
the generator is flawed, since it is well known how to
prevent such attacks.\par
We also analyzed the way in which the generator is run
by the operating system, and found that it amplifies
the effect of the attacks. As a result, learning a
single state may reveal 128 Kbytes of the past and
future output of the generator. The implication of
these findings is that a buffer overflow attack or a
similar attack can be used to learn a single state of
the generator, which can then be used to predict all
random values, such as SSL keys, used by a process in
all its past and future operation. This attack is more
severe and more efficient than known attacks, in which
an attacker can only learn SSL keys if it is
controlling the attacked machine at the time the keys
are used.",
acknowledgement = ack-nhfb,
}
@Book{Dowd:2007:ASS,
author = "Mark Dowd and John McDonald and Justin Schuh",
title = "The art of software security assessment: identifying
and preventing software vulnerabilities",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxi + 1174",
year = "2007",
ISBN = "0-321-44442-6 (paperback)",
ISBN-13 = "978-0-321-44442-4 (paperback)",
LCCN = "QA76.9.A25 D75 2007",
bibdate = "Wed Feb 21 14:25:34 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0618/2006023446.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer software; Development;
Computer networks; Security measures",
}
@TechReport{Drimer:2007:KYE,
author = "Saar Drimer and Steven J. Murdoch",
title = "Keep Your Enemies Close: Distance Bounding Against
{Smartcard} Relay Attacks",
type = "Report",
number = "??",
institution = "Computer Laboratory, University of Cambridge",
address = "Cambridge, UK",
pages = "16",
day = "15",
month = may,
year = "2007",
bibdate = "Thu Nov 04 14:57:14 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also published in USENIX Security Symposium, August
2007, pages 87--102.",
URL = "http://www.cl.cam.ac.uk/~sd410/papers/sc_relay.bib",
abstract = "Modern smartcards, capable of sophisticated
cryptography, provide a high assurance of tamper
resistance and are thus commonly used in payment
applications. Although extracting secrets out of
smartcards requires resources beyond the means of many
would-be thieves, the manner in which they are used can
be exploited for fraud. Cardholders authorize financial
transactions by presenting the card and disclosing a
PIN to a terminal without any assurance as to the
amount being charged or who is to be paid, and have no
means of discerning whether the terminal is authentic
or not. Even the most advanced smartcards cannot
protect customers from being defrauded by the simple
relaying of data from one location to another. We
describe the development of such an attack, and show
results from live experiments on the UK's EMV
implementation, Chip \& PIN. We discuss previously
proposed defences, and show that these cannot provide
the required security assurances. A new defence based
on a distance bounding protocol is described and
implemented, which requires only modest alterations to
current hardware and software. As far as we are aware,
this is the first complete design and implementation of
a secure distance bounding protocol. Future smartcard
generations could use this design to provide
cost-effective resistance to relay attacks, which are a
genuine threat to deployed applications. We also
discuss the security-economics impact to customers of
enhanced authentication mechanisms.",
acknowledgement = ack-nhfb,
}
@InProceedings{Dziembowski:2007:IRS,
author = "S. Dziembowski and K. Pietrzak",
title = "Intrusion-Resilient Secret Sharing",
crossref = "IEEE:2007:PAI",
pages = "227--237",
year = "2007",
DOI = "https://doi.org/10.1109/FOCS.2007.63",
bibdate = "Thu Apr 12 09:33:17 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466",
}
@Article{Eisenbarth:2007:SLC,
author = "Thomas Eisenbarth and Christof Paar and Axel Poschmann
and Sandeep Kumar and Leif Uhsadel",
title = "A Survey of Lightweight Cryptography Implementations",
journal = j-IEEE-DES-TEST-COMPUT,
volume = "24",
number = "6",
pages = "522--533",
month = nov # "\slash " # dec,
year = "2007",
DOI = "https://doi.org/10.1109/MDT.2007.178",
ISSN = "0740-7475 (print), 1558-1918 (electronic)",
ISSN-L = "0740-7475",
bibdate = "Sun Dec 30 10:35:24 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
annote = "dtco-24-06-pos.3d",
fjournal = "IEEE Design \& Test of Computers",
}
@Article{English:2007:MAC,
author = "Jennifer English and David Coe and Rhonda Gaede and
David Hyde and Jeffrey Kulick",
title = "{MEMS}-Assisted Cryptography for {CPI} Protection",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "4",
pages = "14--21",
month = jul # "\slash " # aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.90",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:45 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Faliszewski:2007:BRB,
author = "Piotr Faliszewski",
title = "Book Review: {{\booktitle{Complexity Theory and
Cryptology: An Introduction to Cryptocomplexity}}, by
J{\"o}rg Rothe, Springer, 2005, 484 pages}",
journal = j-SIGACT,
volume = "38",
number = "2",
pages = "20--22",
month = jun,
year = "2007",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1272729.1272736",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:29 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Faliszewski07;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Rothe:2005:CTC}.",
URL = "http://doi.acm.org/10.1145/1272729.1272736",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Frith:2007:SAO,
author = "David Frith",
title = "Steganography approaches, options, and implications",
journal = j-NETWORK-SECURITY,
volume = "2007",
number = "8",
pages = "4--7",
month = aug,
year = "2007",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(07)70071-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:42 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485807700715",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@InProceedings{Garay:2007:RCA,
author = "J. A. Garay and J. Katz and Chiu-Yuen Koo and R.
Ostrovsky",
title = "Round Complexity of Authenticated Broadcast with a
Dishonest Majority",
crossref = "IEEE:2007:PAI",
pages = "658--668",
year = "2007",
DOI = "https://doi.org/10.1109/FOCS.2007.44",
bibdate = "Thu Apr 12 09:33:17 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4389466",
}
@InProceedings{Gavinsky:2007:ESO,
author = "Dmitry Gavinsky and Julia Kempe and Iordanis Kerenidis
and Ran Raz and Ronald de Wolf",
title = "Exponential separations for one-way quantum
communication complexity, with applications to
cryptography",
crossref = "ACM:2007:SPA",
pages = "516--525",
year = "2007",
DOI = "https://doi.org/10.1145/1250790.1250866",
bibdate = "Fri Jun 20 18:28:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We give an exponential separation between one-way
quantum and classical communication protocols for two
partial Boolean functions, both of which are variants
of the Boolean Hidden Matching Problem of Bar-Yossef et
al. Earlier such an exponential separation was known
only for a relational version of the Hidden Matching
Problem. Our proofs use the Fourier coefficients
inequality of Kahn, Kalai, and Linial. We give a number
of applications of this separation. In particular, in
the bounded-storage model of cryptography we exhibit a
scheme that is secure against adversaries with a
certain amount of classical storage, but insecure
against adversaries with a similar (or even much
smaller) amount of quantum storage; in the setting of
privacy amplification, we show that there are strong
extractors that yield a classically secure key, but are
insecure against a quantum adversary.",
acknowledgement = ack-nhfb,
keywords = "communication complexity; cryptography; quantum",
}
@Article{Geiselmann:2007:SPH,
author = "Willi Geiselmann and Rainer Steinwandt",
title = "Special-Purpose Hardware in Cryptanalysis: The Case of
1,024-Bit {RSA}",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "63--66",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.20",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Ghafarian:2007:IPU,
author = "Ahmad Ghafarian",
title = "Ideas for projects in undergraduate information
assurance and security courses",
journal = j-SIGCSE,
volume = "39",
number = "3",
pages = "322--322",
month = sep,
year = "2007",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1269900.1268889",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 16:57:36 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
note = "Proceedings of the 12th Annual SIGCSE Conference on
Innovation and Technology in Computer Science Education
(ITiCSE'07).",
abstract = "In this work, we present some ideas for projects that
can be used in undergraduate Information Assurance and
Security (IAS) courses. The projects range from
cryptanalysis of ciphertext, network security, security
vulnerability analysis, and programming to demonstrate
buffer overflow. The projects can be used in IAS
courses such as cryptography, network security, and
computer security. Alternatively, they can be used as
separate modules in computer science courses such as
operating systems, networking, and programming. Some of
these projects have been piloted by the author and have
achieved their objectives.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Book{Gillespie:2007:WSC,
author = "Tarleton Gillespie",
title = "Wired shut: copyright and the shape of digital
culture",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "420 (est.)",
year = "2007",
ISBN = "0-262-07282-3",
ISBN-13 = "978-0-262-07282-3",
LCCN = "K1447.15 .G55 2007",
bibdate = "Tue Apr 17 14:28:52 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0620/2006030129.html",
acknowledgement = ack-nhfb,
subject = "Copyright; Electronic information resources; Piracy
(Copyright)",
tableofcontents = "The technological fix \\
The copyright balance and the weight of DRM \\
The speed bump \\
A heroic tale of devilish piracy and glorious progress
\\
Why SMDI failed \\
Protecting DVDs: locks, licenses, and laws \\
Raising the broadcast flag \\
Effective frustration \\
The cultural implications of encryption.",
}
@Article{Goodell:2007:TOR,
author = "Geoffrey Goodell and Paul Syverson",
title = "Technical opinion: {The} right place at the right
time",
journal = j-CACM,
volume = "50",
number = "5",
pages = "113--117",
month = may,
year = "2007",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1230819.1241689",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jun 16 18:30:27 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cacm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Examining the use of network location in
authentication and abuse prevention.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InProceedings{Haitner:2007:SHC,
author = "Iftach Haitner and Omer Reingold",
title = "Statistically-hiding commitment from any one-way
function",
crossref = "ACM:2007:SPA",
pages = "1--10",
year = "2007",
DOI = "https://doi.org/10.1145/1250790.1250792",
bibdate = "Fri Jun 20 18:28:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We give a construction of statistically-hiding
commitment schemes (ones where the hiding property
holds information theoretically), based on the minimal
cryptographic assumption that one-way functions exist.
Our construction employs two-phase commitment schemes,
recently constructed by Nguyen, Ong and Vadhan (FOCS
'06), and universal one-way hash functions introduced
and constructed by Naor and Yung (STOC '89) and Rompel
(STOC '90).",
acknowledgement = ack-nhfb,
keywords = "cryptography; one-way functions; statistically hiding
and computationally binding commitment",
}
@Article{Han:2007:FIE,
author = "Fengling Han and Jiankun Hu and Xinghuo Yu and Yi
Wang",
title = "Fingerprint images encryption via multi-scroll chaotic
attractors",
journal = j-APPL-MATH-COMP,
volume = "185",
number = "2",
pages = "931--939",
day = "15",
month = feb,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Book{Harman:2007:PDS,
author = "G. (Glyn) Harman",
title = "Prime-detecting sieves",
publisher = pub-PRINCETON,
address = pub-PRINCETON:adr,
pages = "????",
year = "2007",
ISBN = "0-691-12437-X",
ISBN-13 = "978-0-691-12437-7",
LCCN = "QA246 .H375 2007",
bibdate = "Thu Nov 15 15:55:11 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "London Mathematical Society monographs",
URL = "http://www.loc.gov/catdir/enhancements/fy0731/2007061051-d.html;
http://www.loc.gov/catdir/enhancements/fy0731/2007061051-t.html;
http://www.loc.gov/catdir/enhancements/fy0734/2007061051-b.html",
acknowledgement = ack-nhfb,
remark = "From the publisher: This book seeks to describe the
rapid development in recent decades of sieve methods to
detect prime numbers. No other book has undertaken such
a systematic treatment of prime-detecting sieves. It
contains much that is accessible to beginning graduate
students, yet also provides insights that will benefit
established researchers.",
subject = "sieves (mathematics); numbers, prime; number theory",
}
@Article{Hars:2007:DIH,
author = "Laszlo Hars",
title = "{Discryption}: Internal Hard-Disk Encryption for
Secure Storage",
journal = j-COMPUTER,
volume = "40",
number = "6",
pages = "103--105",
month = jun,
year = "2007",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2007.202",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{Hasenplaugh:2007:FMR,
author = "William Hasenplaugh and Gunnar Gaubatz and Vinodh
Gopal",
title = "Fast Modular Reduction",
crossref = "Kornerup:2007:PIS",
pages = "225--229",
year = "2007",
DOI = "https://doi.org/10.1109/ARITH.2007.18",
bibdate = "Tue Oct 9 17:16:03 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "It is widely acknowledged that efficient modular
multiplication is a key to high-performance
implementation of public-key cryptography, be it
classical RSA, Diffie--Hellman, or (hyper-) elliptic
curve algorithms. In the recent decade, practitioners
have relied mainly on two popular methods: Montgomery
Multiplication and regular long-integer multiplication
in combination with Barrett's modular reduction
technique. In this paper, we propose a modification to
Barrett's algorithm that leads to a significant
reduction (25\% to 75\%) in multiplications and
additions.",
acknowledgement = ack-nhfb,
}
@Article{Heikkila:2007:ESC,
author = "Faith M. Heikkila",
title = "Encryption: Security Considerations for Portable Media
Devices",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "4",
pages = "22--27",
month = jul # "\slash " # aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.80",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:45 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Hendricks:2007:LOB,
author = "James Hendricks and Gregory R. Ganger and Michael K.
Reiter",
title = "Low-overhead {Byzantine} fault-tolerant storage",
journal = j-OPER-SYS-REV,
volume = "41",
number = "6",
pages = "73--86",
month = dec,
year = "2007",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1294261.1294269",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:18:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "This paper presents an erasure-coded Byzantine
fault-tolerant block storage protocol that is nearly as
efficient as protocols that tolerate only crashes.
Previous Byzantine fault-tolerant block storage
protocols have either relied upon replication, which is
inefficient for large blocks of data when tolerating
multiple faults, or a combination of additional
servers, extra computation, and versioned storage. To
avoid these expensive techniques, our protocol employs
novel mechanisms to optimize for the common case when
faults and concurrency are rare. In the common case, a
write operation completes in two rounds of
communication and a read completes in one round. The
protocol requires a short checksum comprised of
cryptographic hashes and homomorphic fingerprints. It
achieves throughput within 10\% of the crash-tolerant
protocol for writes and reads in failure-free runs when
configured to tolerate up to 6 faulty servers and any
number of faulty clients.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "Byzantine fault-tolerant storage",
}
@Article{Herranz:2007:IBR,
author = "Javier Herranz",
title = "Identity-based ring signatures from {RSA}",
journal = j-THEOR-COMP-SCI,
volume = "389",
number = "1--2",
pages = "100--117",
day = "10",
month = dec,
year = "2007",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 22:11:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Hiary:2007:SSE,
author = "Hazem Hiary and Kia Ng",
title = "A system for segmenting and extracting paper-based
watermark designs",
journal = j-INT-J-DIGIT-LIBR,
volume = "6",
number = "4",
pages = "351--361",
month = jul,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1007/s00799-007-0008-7",
ISSN = "1432-1300 (print), 1432-5012 (electronic)",
ISSN-L = "1432-1300",
bibdate = "Tue May 7 07:43:24 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/intjdigitlibr.bib",
URL = "https://link.springer.com/article/10.1007/s00799-007-0008-7",
acknowledgement = ack-nhfb,
ajournal = "Int. J. Digit. Libr.",
fjournal = "International Journal on Digital Libraries",
journal-URL = "https://link.springer.com/journal/799",
}
@Article{Hines:2007:AIF,
author = "Stephen Roderick Hines and Gary Tyson and David
Whalley",
title = "Addressing instruction fetch bottlenecks by using an
instruction register file",
journal = j-SIGPLAN,
volume = "42",
number = "7",
pages = "165--174",
month = jul,
year = "2007",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1254766.1254800",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 10:57:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The Instruction Register File (IRF) is an
architectural extension for providing improved access
to frequently occurring instructions. An optimizing
compiler can exploit an IRF by packing an application's
instructions, resulting in decreased code size, reduced
energy consumption and improved execution time
primarily due to a smaller footprint in the instruction
cache. The nature of the IRF also allows the execution
of packed instructions to overlap with instruction
fetch, thus providing a means for tolerating increased
fetch latencies, like those experienced by encrypted
ICs as well as the presence of low-power L0 caches.
Although previous research has focused on the direct
benefits of instruction packing, this paper explores
the use of increased fetch bandwidth provided by packed
instructions. Small L0 caches improve energy efficiency
but can increase execution time due to frequent cache
misses. We show that this penalty can be significantly
reduced by overlapping the execution of packed
instructions with miss stalls. The IRF can also be used
to supply additional instructions to a more aggressive
execution engine, effectively reducing dependence on
instruction cache bandwidth. This can improve energy
efficiency, in addition to providing additional
flexibility for evaluating various design tradeoffs in
a pipeline with asymmetric instruction bandwidth. Thus,
we show that the IRF is a complementary technique,
operating as a buffer tolerating fetch bottlenecks, as
well as providing additional fetch bandwidth for an
aggressive pipeline backend.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "instruction packing; instruction register file;
L0/filter cache",
}
@Article{Hinkelmann:2007:CUN,
author = "Markus Hinkelmann and Andreas Jakoby",
title = "Communications in unknown networks: {Preserving} the
secret of topology",
journal = j-THEOR-COMP-SCI,
volume = "384",
number = "2--3",
pages = "184--200",
day = "1",
month = oct,
year = "2007",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 22:11:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@InProceedings{Howgrave-Graham:2007:HLR,
author = "Nick Howgrave-Graham",
title = "A hybrid lattice-reduction and meet-in-the-middle
attack against {NTRU}",
crossref = "Menezes:2007:ACC",
pages = "150--169",
year = "2007",
bibdate = "Thu Apr 21 10:04:37 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://portal.acm.org/citation.cfm?id=1777777.1777791",
abstract = "To date the NTRUEncrypt security parameters have been
based on the existence of two types of attack: a
meet-in-the-middle attack due to Odlyzko, and a
conservative extrapolation of the running times of the
best (known) lattice reduction schemes to recover the
private key. We show that there is in fact a continuum
of more efficient attacks between these two attacks. We
show that by combining lattice reduction and a
meet-in-the-middle strategy one can reduce the number
of loops in attacking the NTRUEncrypt private key from
$ 2^{84.2} $ to $ 2^{60.3} $, for the $ k = 80 $
parameter set. In practice the attack is still
expensive (dependent on ones choice of cost-metric),
although there are certain space\slash time tradeoffs
that can be applied. Asymptotically our attack remains
exponential in the security parameter k, but it
dictates that NTRUEncrypt parameters must be chosen so
that the meet-in-the-middle attack has complexity $ 2^k
$ even after an initial lattice basis reduction of
complexity $ 2^k $.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUEncrypt",
}
@Article{Hu:2007:DWD,
author = "Ming-Chiang Hu and Der-Chyuan Lou and Ming-Chang
Chang",
title = "Dual-wrapped digital watermarking scheme for image
copyright protection",
journal = j-COMPUT-SECUR,
volume = "26",
number = "4",
pages = "319--330",
month = jun,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404806002070",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Huang:2007:EPS,
author = "Chung-Ming Huang and Jian-Wei Li",
title = "Efficient and Provably Secure {IP} Multimedia
Subsystem Authentication for {UMTS}",
journal = j-COMP-J,
volume = "50",
number = "6",
pages = "739--757",
month = nov,
year = "2007",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxm029",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:33 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol50/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/50/6/739;
http://comjnl.oxfordjournals.org/cgi/content/full/50/6/739;
http://comjnl.oxfordjournals.org/cgi/reprint/50/6/739",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Huang:2007:MPK,
author = "Dijiang Huang and Manish Mehta and Appie van de
Liefvoort and Deep Medhi",
title = "Modeling pairwise key establishment for random key
predistribution in large-scale sensor networks",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "5",
pages = "1204--1215",
month = oct,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:57:26 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Sensor networks are composed of a large number of low
power sensor devices. For secure communication among
sensors, secret keys are required to be established
between them. Considering the storage limitations and
the lack of post-deployment configuration information
of sensors, RandomKey Predistribution schemes have been
proposed. Due to limited number of keys, sensors can
only share keys with a subset of the neighboring
sensors. Sensors then use these neighbors to establish
pairwise keys with the remaining neighbors. In order to
study the communication overhead incurred due to
pairwise key establishment, we derive probability
models to design and analyze pairwise key establishment
schemes for large-scale sensor networks. Our model
applies the binomial distribution and a modified
binomial distribution and analyzes the key path length
in a hop-by-hop fashion. We also validate our models
through a systematic validation procedure. We then show
the robustness of our results and illustrate how our
models can be used for addressing sensor network design
problems.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "random key distributions; security; sensor networks",
}
@Article{Hwang:2007:PEA,
author = "Ren-Junn Hwang and Sheng-Hua Shiau",
title = "Provably Efficient Authenticated Key Agreement
Protocol for Multi-Servers",
journal = j-COMP-J,
volume = "50",
number = "5",
pages = "602--615",
month = sep,
year = "2007",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxm030",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:33 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol50/issue5/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/50/5/602;
http://comjnl.oxfordjournals.org/cgi/content/full/50/5/602;
http://comjnl.oxfordjournals.org/cgi/reprint/50/5/602",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@InProceedings{Ishai:2007:ZKS,
author = "Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky
and Amit Sahai",
title = "Zero-knowledge from secure multiparty computation",
crossref = "ACM:2007:SPA",
pages = "21--30",
year = "2007",
DOI = "https://doi.org/10.1145/1250790.1250794",
bibdate = "Fri Jun 20 18:28:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present a general construction of a zero-knowledge
proof for an NP relation $ R(x, w) $ which only makes a
black-box use of a secure protocol for a related
multi-party functionality $f$. The latter protocol is
only required to be secure against a small number of
`honest but curious' players. As an application, we can
translate previous results on the efficiency of secure
multiparty computation to the domain of zero-knowledge,
improving over previous constructions of efficient
zero-knowledge proofs. In particular, if verifying $R$
on a witness of length $m$ can be done by a circuit $C$
of size $s$, and assuming one-way functions exist, we
get the following types of zero-knowledge proof
protocols.\par
\begin{description} \item[Approaching the witness
length.] If $C$ has constant depth over $ \land $, $
\lor $, $ \oplus $, $ \lnot $ gates of unbounded
fan-in, we get a zero-knowledge protocol with
communication complexity $m$ \cdot$ \poly (k) $ \cdot$
\polylog (s) $, where $k$ is a security parameter. Such
a protocol can be implemented in either the standard
interactive model or, following a trusted setup, in a
non-interactive model.\par
\item[`Constant-rate' zero-knowledge.] For an arbitrary
circuit $C$ of size $s$ and a bounded fan-in, we get a
zero-knowledge protocol with communication complexity $
O(s) + \poly (k) $. Thus, for large circuits, the ratio
between the communication complexity and the circuit
size approaches a constant. This improves over the $
O(k s) $ complexity of the best previous
protocols.\par
\end{description}",
acknowledgement = ack-nhfb,
keywords = "black-box reductions; cryptography; secure
computation; zero-knowledge",
}
@Article{Iyer:2007:TAA,
author = "Ravishankar K. Iyer and Zbigniew Kalbarczyk and
Karthik Pattabiraman and William Healey and Wen-Mei W.
Hwu and Peter Klemperer and Reza Farivar",
title = "Toward Application-Aware Security and Reliability",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "57--62",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.23",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Jakobsson:2007:DPD,
author = "Markus Jakobsson and Steven Myers",
title = "Delayed password disclosure",
journal = j-SIGACT,
volume = "38",
number = "3",
pages = "56--75",
month = sep,
year = "2007",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1324215.1324228",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:29 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#JakobssonM07;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://doi.acm.org/10.1145/1324215.1324228",
abstract = "We present a new authentication protocol called
Delayed Password Disclosure. Based on the traditional
username and password paradigm, the protocol's goal is
aimed at reducing the effectiveness of
phishing/spoofing attacks that are becoming
increasingly problematic for Internet users. This is
done by providing the user with dynamic feedback while
password entry occurs. While this is a process that
would normally be frowned upon by the cryptographic
community, we argue that it may result in more
effective security than that offered by currently
proposed ``cryptographically acceptable'' alternatives.
While the protocol cannot prevent partial disclosure of
one's password to the phisher, it does provide a user
with the tools necessary to recognize an ongoing
phishing attack, and prevent the disclosure of his/her
entire password, providing graceful security
degradation.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Jakubowska:2007:MCT,
author = "Gizela Jakubowska and Wojciech Penczek",
title = "Modelling and Checking Timed Authentication of
Security Protocols",
journal = j-FUND-INFO,
volume = "79",
number = "3--4",
pages = "363--378",
month = feb,
year = "2007",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:05:58 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Johnson:2007:EIS,
author = "M. Eric Johnson and Eric Goetz",
title = "Embedding Information Security into the Organization",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "16--24",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.59",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Book{Kadrich:2007:ES,
author = "Mark Kadrich",
title = "Endpoint security",
publisher = "Addison Wesley Professional",
address = "Indianapolis, IN, USA",
pages = "????",
year = "2007",
ISBN = "0-321-43695-4 (paperback)",
ISBN-13 = "978-0-321-43695-5 (paperback)",
LCCN = "QA76.9.A25 K325 2007",
bibdate = "Fri Apr 20 14:01:47 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computer security; Computer networks; Security
measures",
}
@Article{Kamp:2007:DEB,
author = "Jesse Kamp and David Zuckerman",
title = "Deterministic Extractors for Bit-Fixing Sources and
Exposure-Resilient Cryptography",
journal = j-SIAM-J-COMPUT,
volume = "36",
number = "5",
pages = "1231--1247",
month = "????",
year = "2007",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:39 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/36/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Kamvar:2007:DTM,
author = "Maryam Kamvar and Shumeet Baluja",
title = "Deciphering Trends in Mobile Search",
journal = j-COMPUTER,
volume = "40",
number = "8",
pages = "58--62",
month = aug,
year = "2007",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2007.270",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:35 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Kaps:2007:CSD,
author = "Jens-Peter Kaps and Gunnar Gaubatz and Berk Sunar",
title = "Cryptography on a Speck of Dust",
journal = j-COMPUTER,
volume = "40",
number = "2",
pages = "38--44",
month = feb,
year = "2007",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2007.52",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:33 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "As tiny wireless sensors and RFID tags become
ubiquitous, they impact privacy, trust, and control.
Protecting data on these devices requires new
algorithms suitable for ultralow-power implementations.
This paper presents a survey of cryptographic
algorithms. It also discusses the design
recommendations for new algorithms.",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Kashefi:2007:SZK,
author = "Elham Kashefi and Iordanis Kerenidis",
title = "Statistical {Zero Knowledge} and quantum one-way
functions",
journal = j-THEOR-COMP-SCI,
volume = "378",
number = "1",
pages = "101--116",
day = "3",
month = jun,
year = "2007",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:47 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Kidwell:2007:CSB,
author = "Peggy Aldrich Kidwell",
title = "{{\booktitle{Colossus: The Secrets of Bletchley Park's
Codebreaking Computers}}} (review)",
journal = j-TECH-CULTURE,
volume = "48",
number = "3",
pages = "663--664",
month = jul,
year = "2007",
CODEN = "TECUA3",
DOI = "https://doi.org/10.1353/tech.2007.0112",
ISSN = "0040-165X (print), 1097-3729 (electronic)",
ISSN-L = "0040-165X",
bibdate = "Sat Sep 30 08:25:03 MDT 2023",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/techculture2000.bib",
URL = "https://muse.jhu.edu/pub/1/article/218709",
acknowledgement = ack-nhfb,
ajournal = "Tech. Culture",
fjournal = "Technology and Culture",
journal-URL = "https://muse.jhu.edu/journal/194",
}
@Article{Kim:2007:SBE,
author = "Jin-Ha Kim and Gyu Sang Choi and Chita R. Das",
title = "An {SSL} Back-End Forwarding Scheme in Cluster-Based
{Web} Servers",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "18",
number = "7",
pages = "946--957",
month = jul,
year = "2007",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2007.1062",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu Jul 3 14:26:52 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@TechReport{Klein:2007:BDC,
author = "Amit Klein",
title = "{BIND 9 DNS} Cache Poisoning",
type = "Report",
institution = "Trusteer, Ltd.",
address = "3 Hayetzira Street, Ramat Gan 52521, Israel",
pages = "21",
year = "2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.trusteer.com/docs/BIND_9_DNS_Cache_Poisoning.pdf",
abstract = "The paper shows that BIND 9 DNS queries are
predictable i.e. that the source UDP port and DNS
transaction ID can be effectively predicted. A
predictability algorithm is described that, in optimal
conditions, provides very few guesses for the next
query (10 in the basic attack, and 1 in the advanced
attack), thereby overcoming whatever protection offered
by the transaction ID mechanism. This enables a much
more effective DNS cache poisoning than the currently
known attacks against BIND 9. The net effect is that
pharming attacks are feasible against BIND 9 caching
DNS servers, without the need to directly attack
neither DNS servers nor clients (PCs). The results are
applicable to all BIND 9 releases [1], when BIND (the
named daemon) is in caching DNS server configuration.",
remark = "Part of this work involves reconstructing the state of
the pseudo-random number generator to allow prediction
of randomized port numbers. The report also discusses
birthday attacks.",
}
@Article{Knutson:2007:BPS,
author = "Tina R. Knutson",
title = "Building Privacy into Software Products and Services",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "72--74",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.55",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@InProceedings{Ko:2007:SRT,
author = "Hoon Ko and Jiyeon Kim and Jongjin Jung and Susan Joe
and Yongjun Lee and Yoonseok Chang",
title = "A Study on the {RFID} Tag Encryption using Fast
{SEED}",
crossref = "Simos:2007:CMS",
volume = "2A",
pages = "571--574",
year = "2007",
bibdate = "Thu Feb 21 14:34:40 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://proceedings.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&
id=APCPCS000963000002000571000001& idtype=cvips",
acknowledgement = ack-nhfb,
}
@InProceedings{Kobayashi:2007:AIG,
author = "Katsuki Kobayashi and Naofumi Takagi and Kazuyoshi
Takagi",
title = "An Algorithm for Inversion in {$ \mathrm {GF}(2^m) $}
Suitable for Implementation Using a Polynomial Multiply
Instruction on {$ \mathrm {GF}(2) $}",
crossref = "Kornerup:2007:PIS",
pages = "105--112",
year = "2007",
DOI = "https://doi.org/10.1109/ARITH.2007.9",
bibdate = "Tue Oct 9 16:32:41 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "An algorithm for inversion in $ \mathrm {GF}(2^m) $
suitable for implementation using a polynomial multiply
instruction on $ \mathrm {GF}(2) $ is proposed. It is
based on the extended Euclid's algorithm. In the
algorithm, operations corresponding to several
contiguous iterations of the VLSI algorithm proposed by
Brunner et al. is represented as a matrix. They are
calculated at once through the matrix efficiently by
means of a polynomial multiply instruction on $ \mathrm
{GF}(2) $. For example, in the case where the word size
of a processor and $m$ are $ 32 $ and $ 571 $,
respectively, the algorithm calculates inversion with
about the half number of instructions of the
conventional algorithm on the average.",
acknowledgement = ack-nhfb,
}
@Article{Koblitz:2007:URB,
author = "Neal Koblitz",
title = "The uneasy relationship between mathematics and
cryptography",
journal = j-NAMS,
volume = "54",
number = "8",
pages = "972--979",
month = sep,
year = "2007",
CODEN = "AMNOAN",
ISSN = "0002-9920 (print), 1088-9477 (electronic)",
ISSN-L = "0002-9920",
MRclass = "00A99 (01A60 11T71 94-03 94A60)",
MRnumber = "2340704",
bibdate = "Thu Aug 15 07:17:02 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/nams2000.bib",
acknowledgement = ack-nhfb,
ajournal = "Notices Amer. Math. Soc.",
fjournal = "Notices of the American Mathematical Society",
journal-URL = "http://www.ams.org/notices/",
}
@Article{Komninos:2007:ALS,
author = "Nikos Komninos and Dimitrios D. Vergados and Christos
Douligeris",
title = "Authentication in a layered security approach for
mobile ad hoc networks",
journal = j-COMPUT-SECUR,
volume = "26",
number = "5",
pages = "373--380",
month = aug,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404807000041",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Kramer:2007:LCC,
author = "Simon Kramer",
title = "Logical concepts in cryptography",
journal = j-SIGACT,
volume = "38",
number = "4",
pages = "65--66",
month = dec,
year = "2007",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1345189.1345205",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:29 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Kramer07;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://doi.acm.org/10.1145/1345189.1345205",
abstract = "The thesis is about a breadth-first exploration of
logical concepts in cryptography and their linguistic
abstraction and model-theoretic combination in a
comprehensive logical system, called CPL (for
Cryptographic Protocol Logic). We focus on two
fundamental aspects of cryptography. Namely, the
security of communication (as opposed to security of
storage) and cryptographic protocols (as opposed to
cryptographic operators). The logical concepts explored
are the following. Primary concepts: the modal concepts
of belief, knowledge, norms, provability, space, and
time. Secondary concepts: belief with error control,
individual and propositional knowledge, confidentiality
norms, truth-functional and relevant (in particular,
intuitionistic) implication, multiple and complex truth
values, and program types. The distinguishing feature
of CPL is that it unifies and refines a variety of
existing approaches. This feature is the result of our
holistic conception of property-based (modal logics)
and model-based (process algebra) formalisms. We
illustrate the expressiveness of CPL on representative
requirements engineering case studies. Further, we
extend (core) CPL (qualitative time) with
rational-valued time, i.e., time stamps, timed keys,
and potentially drifting local clocks, to tCPL
(quantitative time). Our extension is conservative and
provides further evidence for Lamport's claim that
adding real time to an untimed formalism is really
simple. Furthermore, we sketch an extension of (core)
CPL with a notion of probabilistic polynomial-time (PP)
computation. We illustrate the expressiveness of this
extended logic (ppCPL) on tentative formalisation case
studies of fundamental and applied concepts.
Fundamental concepts: (1) one-way function, (2)
hard-core predicate, (3) computational
indistinguishability, (4) ($n$-party) interactive
proof, and (5) ($n$-prover) zero-knowledge. Applied
concepts: (1) security of encryption schemes, (2)
unforgeability of signature schemes, (3) attacks on
encryption schemes, (4) attacks on signature schemes,
and (5) breaks of signature schemes. In the light of
logic, adding PP to a formalism for cryptographic
protocols is perhaps also simple and can be achieved
with an Ockham's razor extension of an existing core
logic, namely CPL.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Kumagai:2007:RSK,
author = "J. Kumagai",
title = "A Robotic Sentry For {Korea}'s {Demilitarized Zone}",
journal = j-IEEE-SPECTRUM,
volume = "44",
number = "3",
pages = "16--17",
month = mar,
year = "2007",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2007.323429",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Daewoo K3; Digital cameras; Embedded
software; gun-toting sentry robot; Humans; light
camera; Local government; machine gun; military
equipment; military service; military systems; mobile
robots; Pattern recognition; pattern recognition
software; Robot vision systems; Robotic assembly;
robotic sentry; Robotics and automation; Samsung
Techwin Co.; SGR-AI robot; South Korea;
Telecommunications",
}
@Article{Laguillaumie:2007:MDV,
author = "Fabien Laguillaumie and Damien Vergnaud",
title = "Multi-designated verifiers signatures: anonymity
without encryption",
journal = j-INFO-PROC-LETT,
volume = "102",
number = "2--3",
pages = "127--132",
day = "30",
month = apr,
year = "2007",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:52:39 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Laird:2007:THL,
author = "Cameron Laird",
title = "Taking a Hard-Line Approach to Encryption",
journal = j-COMPUTER,
volume = "40",
number = "3",
pages = "13--15",
month = mar,
year = "2007",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2007.105",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:33 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@InProceedings{LaMacchia:2007:SSA,
author = "Brian LaMacchia and Kristin Lauter and Anton
Mityagin",
editor = "Willy Susilo and Joseph K. Liu and Yi Mu",
booktitle = "{Provable Security First International Conference,
ProvSec 2007, Wollongong, Australia, November 1--2,
2007. Proceedings}",
title = "Stronger security of authenticated key exchange",
publisher = pub-SV,
address = pub-SV:adr,
pages = "1--16",
year = "2007",
DOI = "https://doi.org/10.1007/978-3-540-75670-5_1",
bibdate = "Fri Jul 29 08:04:28 2022",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://link.springer.com/chapter/10.1007/978-3-540-75670-5_1",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-540-75670-5",
}
@Book{Lambert:2007:SLG,
author = "David Lambert",
title = "Super little giant book of secret codes",
publisher = "Sterling Pub. Co.",
address = "New York, NY, USA",
pages = "287",
year = "2007",
ISBN = "1-4027-3739-4 (paperback)",
ISBN-13 = "978-1-4027-3739-8 (paperback)",
LCCN = "Z103.3 .L36 2007",
bibdate = "Sat May 15 09:18:17 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0738/2007276461-d.html",
abstract = "Learn to create secret codes using symbols, dots,
lines, rearranged letters and more.",
acknowledgement = ack-nhfb,
subject = "cryptography; juvenile literature; ciphers",
}
@Article{Laskari:2007:AEC,
author = "E. C. Laskari and G. C. Meletiou and Y. C. Stamatiou
and M. N. Vrahatis",
title = "Applying evolutionary computation methods for the
cryptanalysis of {Feistel} ciphers",
journal = j-APPL-MATH-COMP,
volume = "184",
number = "1",
pages = "63--72",
day = "1",
month = jan,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lavoue:2007:SSW,
author = "Guillaume Lavou{\'e} and Florence Denis and Florent
Dupont",
title = "Subdivision surface watermarking",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "31",
number = "3",
pages = "480--492",
month = jun,
year = "2007",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2007.01.022",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 16:41:55 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849307000507",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Lee:2007:RKD,
author = "Hyoung-joo Lee and Sungzoon Cho",
title = "Retraining a keystroke dynamics-based authenticator
with impostor patterns",
journal = j-COMPUT-SECUR,
volume = "26",
number = "4",
pages = "300--310",
month = jun,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404806002057",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Lei:2007:CSA,
author = "Jun Lei and Xiaoming Fu and Dieter Hogrefe and
Jianrong Tan",
title = "Comparative studies on authentication and key exchange
methods for 802.11 wireless {LAN}",
journal = j-COMPUT-SECUR,
volume = "26",
number = "5",
pages = "401--409",
month = aug,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:06 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404807000053",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Lemke-Rust:2007:MAP,
author = "Kerstin Lemke-Rust",
title = "Models and Algorithms for Physical Cryptanalysis",
volume = "4",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Bochum, Germany",
pages = "xiv + 232",
year = "2007",
ISBN = "3-89966-272-5",
ISBN-13 = "978-3-89966-272-6",
ISSN = "1864-1709",
LCCN = "????",
bibdate = "Fri May 13 08:45:20 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "EUR 24.90",
series = "IT-Security",
acknowledgement = ack-nhfb,
}
@Article{Li:2007:NBA,
author = "Weihai Li and Yuan Yuan",
title = "A New Blind Attack Procedure for {DCT}-Based Image
Encryption with Spectrum Learning",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "7",
number = "3",
pages = "481--496",
month = jul,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467807002787",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:01 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Li:2007:PBS,
author = "F. Li and X. Xin and Y. Hu",
title = "A Pairing-Based Signcryption Scheme Using
Self-Certified Public Keys",
journal = j-INT-J-COMPUT-APPL,
volume = "29",
number = "3",
pages = "278--282",
year = "2007",
DOI = "https://doi.org/10.1080/1206212X.2007.11441857",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:24:05 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2007.11441857",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Lian:2007:MDE,
author = "S. Lian and Z. Liu and Z. Ren and Z. Wang",
title = "Multimedia Data Encryption in Block-Based Codecs",
journal = j-INT-J-COMPUT-APPL,
volume = "29",
number = "1",
pages = "18--24",
year = "2007",
DOI = "https://doi.org/10.1080/1206212X.2007.11441828",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:23:43 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2007.11441828",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Lin:2007:PFT,
author = "Jenn-Wei Lin",
title = "Providing fault-tolerant authentication and
authorization in wireless mobile {IP} networks",
journal = j-J-SYST-SOFTW,
volume = "80",
number = "2",
pages = "149--163",
month = feb,
year = "2007",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Liu:2007:IFW,
author = "Shao-Hui Liu and Hong-Xun Yao and Wen Gao and
Yong-Liang Liu",
title = "An image fragile watermark scheme based on chaotic
image pattern and pixel-pairs",
journal = j-APPL-MATH-COMP,
volume = "185",
number = "2",
pages = "869--882",
day = "15",
month = feb,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Lopez:2007:SCB,
author = "Andr{\'e}s Mar{\'\i}n L{\'o}pez and Daniel D{\'\i}az
S{\'a}nchez and Florina Almen{\'a}rez and Carlos
Garc{\'\i}a Rubio and Celeste Campo",
title = "Smart card-based agents for fair non-repudiation",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2288--2298",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Lu:2007:NPL,
author = "Rongxing Lu and Zhenfu Cao and Xiaolei Dong",
title = "A New Practical Limited Identity-Based Encryption
Scheme",
journal = j-FUND-INFO,
volume = "80",
number = "4",
pages = "461--474",
month = dec,
year = "2007",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:06:10 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Lu:2007:NSC,
author = "HongQian Karen Lu",
title = "Network smart card review and analysis",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2234--2248",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Lyda:2007:UEA,
author = "Robert Lyda and James Hamrock",
title = "Using Entropy Analysis to Find Encrypted and Packed
Malware",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "40--45",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.48",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Lysyanskaya:2007:AI,
author = "Anna Lysyanskaya",
title = "Authentication without Identification",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "69--71",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.52",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Mabry:2007:USE,
author = "Frank J. Mabry and John R. James and Aaron J.
Ferguson",
title = "{Unicode} Steganographic Exploits: Maintaining
Enterprise Border Security",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "5",
pages = "32--39",
month = sep # "\slash " # oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.128",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Jul 3 12:03:37 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Unicode is rapidly becoming the preferred means for
representing symbols used in creating multimedia
content, especially for information that's presented in
multiple languages. This article discusses a Unicode
vulnerability that makes such content susceptible to
being used for creation of covert channel
communications. We also developed a solution
architecture, the Unified Secure Message Augmentation
(USMA) service. The USMA service incorporates rules (in
an XML vocabulary) that we can apply to Unicode
transmissions that will detect an attempt to transmit a
potential exploit, alert network managers to the
presence of the Unicode anomaly, and take action to
mitigate the exploit.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Marti-Farre:2007:NSS,
author = "Jaume Mart{\'\i}-Farr{\'e}",
title = "A note on secret sharing schemes with three
homogeneous access structure",
journal = j-INFO-PROC-LETT,
volume = "102",
number = "4",
pages = "133--137",
day = "16",
month = may,
year = "2007",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:52:41 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Martin:2007:SCE,
author = "Keye Martin",
title = "Secure Communication without Encryption?",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "68--71",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.39",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@InProceedings{Matsumoto:2007:FSC,
author = "Makoto Matsumoto and Mutsuo Saito and Takuji Nishimura
and Mariko Hagita",
title = "A Fast Stream Cipher with Huge State Space and
Quasigroup Filter for Software",
crossref = "Adams:2007:SAC",
pages = "246--263",
year = "2007",
DOI = "https://doi.org/10.1007/978-3-540-77360-3_16",
bibdate = "Mon Jun 27 22:48:38 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Recent personal computers have high-spec CPUs and
plenty of memory. The motivation of this study is to
take these advantages in designing a tough and fast
key-stream generator. Natural controversies on using a
large state space for a generator are (1) effectiveness
is unclear, (2) slower generation speed, (3) expensive
initialization, and (4) costs in a hardware
implementation.\par
Our proposal is to combine a linear feedback shift
register (LFSR) and a uniform quasigroup filter with
memory of wordsize. We prove theorems which assure the
period and the distribution property of such
generators, answering to (1). As for (2), the
generation speed of a LFSR is independent of the state
size. In addition, we propose a filter based on integer
multiplication, which is rather fast in modern CPUs. We
analyze the algebraic degree of such filters. We answer
to (3) by a simple trick to use another small generator
to initialize LFSR while outputting. We have no answer
to (4), but comment that recent hardwares tend to have
larger memory and sophisticated instructions.\par
As a concrete example, we propose CryptMT stream
generator with period (no less than) $ 2^{19937} - 1 $,
1241-dimensional equidistribution property, which is
sometimes faster than SNOW2.0 in modern CPUs.",
acknowledgement = ack-nhfb,
keywords = "combined generator; CryptMT; distribution; eSTREAM;
filter with memory; multiplicative filter; period;
quasigroup filter; stream cipher",
}
@Book{Maurer:2007:ICP,
author = "Ueli Maurer and Martin Abadi and Ross Anderson",
title = "Introduction to Cryptography: Principles and
Applications",
publisher = pub-SV,
address = pub-SV:adr,
pages = "371",
year = "2007",
ISBN = "3-540-49244-5, 3-642-08040-5",
ISBN-13 = "978-3-540-49244-3, 978-3-642-08040-1",
LCCN = "QA76.9.A25.D447 2007eb",
bibdate = "Sat Jun 10 08:34:43 MDT 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
subject = "Computer networks; Security measures; Computer
security; Cryptography",
tableofcontents = "Preface to the Second, Extended Edition \\
Preface \\
Contents \\
Notation \\
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",
}
@Article{Meseguer:2007:SRA,
author = "Jos{\'e} Meseguer and Prasanna Thati",
title = "Symbolic reachability analysis using narrowing and its
application to verification of cryptographic
protocols",
journal = j-HIGHER-ORDER-SYMB-COMPUT,
volume = "20",
number = "1--2",
pages = "123--160",
month = jun,
year = "2007",
CODEN = "LSCOEX",
DOI = "https://doi.org/10.1007/s10990-007-9000-6",
ISSN = "1388-3690 (print), 2212-0793 (electronic)",
ISSN-L = "1388-3690",
bibdate = "Wed Jul 9 12:34:45 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=20&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/higherordersymbcomput.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1388-3690&volume=20&issue=1&spage=123",
acknowledgement = ack-nhfb,
fjournal = "Higher-Order and Symbolic Computation",
keywords = "Narrowing; Reachability; Rewrite theories; Security
protocols",
}
@Book{Moldovyan:2007:IC,
author = "Nick Moldovyan and Alex Moldovyan",
title = "Innovative cryptography",
publisher = "Charles River Media",
address = "Boston, MA, USA",
edition = "Second",
pages = "xiii + 386",
year = "2007",
ISBN = "1-58450-467-6 (paperback)",
ISBN-13 = "978-1-58450-467-2 (paperback)",
LCCN = "QA76.9.A25 M665 2007",
bibdate = "Sat Jun 13 08:35:09 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Charles River Media programming series",
URL = "http://www.loc.gov/catdir/toc/ecip0611/2006009839.html",
acknowledgement = ack-nhfb,
subject = "data encryption (computer science); telecommunication;
security measures; cryptography",
}
@Book{Mollin:2007:IC,
author = "Richard A. Mollin",
title = "An introduction to cryptography",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Second",
pages = "x + 413",
year = "2007",
ISBN = "1-58488-618-8",
ISBN-13 = "978-1-58488-618-1",
LCCN = "QA268 .M65 2007",
bibdate = "Sun Dec 13 08:48:47 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Discrete mathematics and its applications",
URL = "http://www.loc.gov/catdir/enhancements/fy0664/2006049639-d.html",
acknowledgement = ack-nhfb,
subject = "coding theory; textbooks",
}
@Article{Moore:2007:CQK,
author = "Samuel K. Moore",
title = "Commercializing Quantum Keys",
journal = j-IEEE-SPECTRUM,
volume = "44",
number = "3",
pages = "15--17",
month = mar,
year = "2007",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2007.323419",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "commercialization; Commercialization; cryptographic
key; Cryptography; data decoding; data encoding;
Decoding; Distributed computing; encryptor; esoteric
quantum properties; ID Quantique; MagiQ; off-the-shelf
distribution technology; Optical computing; optical
fiber transmission; Optical fibers; photon; photons;
Physics; polarization filters; Quantum computing;
quantum cryptography; quantum keys; Quantum mechanics;
quantum physics; SmartQuantum; Turning",
}
@Book{Mrayati:2007:TTC,
editor = "M. Mrayati and Y. Meer Alam and M. H. at-Tayyan",
title = "Two treatises on cryptanalysis: the two essays the
treatise of {ibn Wahab al-Ka tib}",
volume = "6",
publisher = "KFCRIS \& KACST",
address = "Riyadh, Saudi Arabia",
pages = "xii + 125",
year = "2007",
ISBN = "9960-893-58-8",
ISBN-13 = "978-9960-893-58-7",
LCCN = "????",
bibdate = "Thu May 12 06:53:13 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "{Arabic} origins of cryptology",
acknowledgement = ack-nhfb,
keywords = "cryptography / Arab countries / history",
remark = "Translated by Said M. Asaad. Revised by Mohammed
Ibrahim Al-Suwaiyel and Marwan Bawab and Ishaq ibn
Ibrahim Katib",
}
@Book{Mullen:2007:FFA,
author = "Gary L. Mullen and Carl Mummert",
title = "Finite Fields and Applications",
volume = "41",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "ix + 175",
year = "2007",
ISBN = "0-8218-4418-0 (paperback)",
ISBN-13 = "978-0-8218-4418-2 (paperback)",
LCCN = "QA247.3 .M85 2007",
bibdate = "Thu Mar 22 12:12:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Student mathematical library",
acknowledgement = ack-nhfb,
subject = "Finite fields (Algebra); Coding theory; Cryptography",
}
@Article{Munilla:2007:HMF,
author = "J. Munilla and A. Peinado",
title = "{HB-MP}: a further step in the {HB}-family of
lightweight authentication protocols",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2262--2267",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Nagy:2007:AQK,
author = "Naya Nagy and Selim G. Akl",
title = "Authenticated Quantum Key Distribution Without
Classical Communication",
journal = j-PARALLEL-PROCESS-LETT,
volume = "17",
number = "3",
pages = "323--335",
month = sep,
year = "2007",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626407003058",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
bibdate = "Thu Sep 2 09:08:11 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Nahum:2007:ESS,
author = "Erich M. Nahum and John Tracey and Charles P. Wright",
title = "Evaluating {SIP} server performance",
journal = j-SIGMETRICS,
volume = "35",
number = "1",
pages = "349--350",
month = jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1254882.1254924",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Fri Jun 27 09:42:48 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib",
abstract = "SIP is a protocol of growing importance, with uses for
VoIP, instant messaging, presence, and more. However,
its performance is not well-studied or understood. In
this extended abstract we overview our experimental
evaluation of common SIP server scenarios using
open-source SIP software such as OpenSER and SIP
pruning on Linux.\par
We show performance varies greatly depending on the
server scenario and how the protocol is used. Depending
on the configuration, through put can vary from
hundreds to thousands of operations per second. For
example, we observe that the choice of stateless vs.
stateful proxying, using TCP rather than UDP, or
including MD5-based authentication can each can affect
performance by a factor of 2-4. We also provide kernel
and application profiles using Oprofile that help
explain and illustrate processing costs. Finally, we
provide a simple fix for transaction-stateful proxying
that improves performance by a factor of 10. Full
details can be found in our accompanying technical
report.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
keywords = "experimental evaluation; performance; server; SIP",
}
@Article{Nichols:2007:MFD,
author = "Elizabeth A. Nichols and Gunnar Peterson",
title = "A Metrics Framework to Drive Application Security
Improvement",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "88--91",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.26",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Obimbo:2007:PAD,
author = "Charlie Obimbo and Behzad Salami",
title = "A parallel algorithm for determining the inverse of a
matrix for use in blockcipher encryption\slash
decryption",
journal = j-J-SUPERCOMPUTING,
volume = "39",
number = "2",
pages = "113--130",
month = feb,
year = "2007",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-007-0107-7",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 9 17:32:30 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=39&issue=2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=39&issue=2&spage=113",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
keywords = "Block Ciphers; Cryptography; Inverse of a matrix;
Modular arithmetic; Parallel Algorithms; Row-echelon
reduction; Systems of linear equations",
}
@Article{Pan:2007:IBS,
author = "Jianping Pan and Lin Cai and Xuemin (Sherman) Shen and
Jon W. Mark",
title = "Identity-based secure collaboration in wireless ad hoc
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "3",
pages = "853--865",
day = "21",
month = feb,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Misc{Panditaratne:2007:TRN,
author = "Vidura Panditaratne",
title = "True random number generator goes online",
howpublished = "World-Wide Web document",
day = "18",
month = jul,
year = "2007",
bibdate = "Thu Jul 26 14:17:39 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://pressesc.com/01184778212_qrbgs;
http://qrbg.irb.hr/; http://random.irb.hr/",
remark = "Briefly describes the Quantum Random Bit Generator
Service (QRBGS) at the Ruder Bo{\v{s}}kovic Institute
(RBI) in Zagreb, Croatia. See also
\cite{Stipcevic:2007:QRN}.",
}
@Article{Peeters:2007:CES,
author = "Johan Peeters and Paul Dyson",
title = "Cost-Effective Security",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "85--87",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.56",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Peng:2007:BZK,
author = "Kun Peng and Colin Boyd and Ed Dawson",
title = "Batch zero-knowledge proof and verification and its
applications",
journal = j-TISSEC,
volume = "10",
number = "2",
pages = "6:1--6:??",
month = may,
year = "2007",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1237500.1237502",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:05 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The batch verification technique of Bellare et al. is
extended to verification of several frequently employed
zero-knowledge proofs. The new techniques are correct,
sound, efficient, and can be widely applied. Specific
applications are discussed in detail, including batch
ZK proof and verification of validity of encryption (or
reencryption) and batch ZK proof and verification of
validity of decryption. Considerable efficiency
improvements are gained in these two applications
without compromising security. As a result, efficiency
of the practical cryptographic systems (such as mix
networks) based on these two applications is
dramatically improved.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "batch proof and verification of decryption; batch
proof and verification of reencryption; mix network",
}
@Article{Perez:2007:URR,
author = "O. P{\'e}rez and Y. Berviller and C. Tanougast and S.
Weber",
title = "The Use of Runtime Reconfiguration on {FPGA} Circuits
to Increase the Performance of the {AES} Algorithm
Implementation",
journal = j-J-UCS,
volume = "13",
number = "3",
pages = "349--362",
month = "????",
year = "2007",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_13_3/the_use_of_runtime",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "Advanced Encryption Standard",
}
@Article{Pfleeger:2007:GEI,
author = "Shari Lawrence Pfleeger and Roland L. Trope and
Charles C. Palmer",
title = "{Guest Editors}' Introduction: Managing Organizational
Security",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "13--15",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.62",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Pfleeger:2007:IBC,
author = "Shari Lawrence Pfleeger and Martin Libicki and Michael
Webber",
title = "{I}'ll Buy That! Cybersecurity in the {Internet}
Marketplace",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "25--31",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.64",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Book{Pfleeger:2007:SC,
author = "Charles P. Pfleeger and Shari Lawrence Pfleeger",
title = "Security in computing",
publisher = pub-PH,
address = pub-PH:adr,
edition = "Fourth",
pages = "xxiii + 845",
year = "2007",
ISBN = "0-13-239077-9 (hardcover)",
ISBN-13 = "978-0-13-239077-4 (hardcover)",
LCCN = "QA76.9.A25 P45 2006",
bibdate = "Thu Dec 14 17:59:14 MST 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0619/2006026798.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Data protection; Privacy, Right
of",
xxnote = "Check year: 2006 or 2007?? Catalogs disagree.",
}
@Article{Potter:2007:CWW,
author = "Bruce Potter",
title = "Converging wired and wireless authentication",
journal = j-NETWORK-SECURITY,
volume = "2007",
number = "10",
pages = "18--20",
month = oct,
year = "2007",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(07)70096-X",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:44 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S135348580770096X",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Power:2007:SBB,
author = "E. Michael Power and Jonathan Gilhen and Roland L.
Trope",
title = "Setting Boundaries at Borders: Reconciling Laptop
Searches and Privacy",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "72--75",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.40",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Prattichizzo:2007:PIH,
author = "Domenico Prattichizzo and Mauro Barni and Gloria
Menegaz and Alessandro Formaglio and Hong Z. Tan and
Seungmoon Choi",
title = "Perceptual Issues in Haptic Digital Watermarking",
journal = j-IEEE-MULTIMEDIA,
volume = "14",
number = "3",
pages = "84--91",
month = jul # "\slash " # sep,
year = "2007",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2007.58",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Jul 2 18:03:19 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Preneel:2007:SRD,
author = "Bart Preneel",
title = "A survey of recent developments in cryptographic
algorithms for smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2223--2233",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Pucella:2007:Ib,
author = "Riccardo Pucella",
title = "Introduction",
journal = j-SIGACT,
volume = "38",
number = "4",
pages = "64--64",
month = dec,
year = "2007",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1345189.1345204",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:29 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Pucella07b;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://doi.acm.org/10.1145/1345189.1345204",
abstract = "A short column this time around. Simon Kramer sent me
a synopsis of his Ph.D. thesis, defended earlier this
year at l'{\'E}cole Polytechnique F{\'e}d{\'e}rale de
Lausanne. He introduces a new logic for reasoning about
cryptographic protocol called CPL (Cryptographic
Protocol Logic). The result is an intriguing blend of
modal logic and process algebra, reminiscent of spatial
logics for process calculi, but extended with
knowledge, belief, and provability operators.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Ramaswamy:2007:HSP,
author = "Ramaswamy Ramaswamy and Tilman Wolf",
title = "High-speed prefix-preserving {IP} address
anonymization for passive measurement systems",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "1",
pages = "26--39",
month = feb,
year = "2007",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2006.890128",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:53:54 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Passive network measurement and packet header trace
collection are vital tools for network operation and
research. To protect a user's privacy, it is necessary
to anonymize header fields, particularly IP addresses.
To preserve the correlation between IP addresses,
prefix-preserving anonymization has been proposed. The
limitations of this approach for a high-performance
measurement system are the need for complex
cryptographic computations and potentially large
amounts of memory. We propose a new prefix-preserving
anonymization algorithm, top-hash subtree-replicated
anonymization (TSA), that features three novel
improvements: precomputation, replicated subtrees, and
top hashing. TSA makes anonymization practical to be
implemented on network processors or dedicated logic at
Gigabit rates. The performance of TSA is compared with
a conventional cryptography based prefix-preserving
anonymization scheme which utilizes caching. TSA
performs better as it requires no online cryptographic
computation and a small number of memory lookups per
packet. Our analytic comparison of the susceptibility
to attacks between conventional anonymization and our
approach shows that TSA performs better for small scale
attacks and comparably for medium scale attacks. The
processing cost for TSA is reduced by two orders of
magnitude and the memory requirements are a few
Megabytes. The ability to tune the memory requirements
and security level makes TSA ideal for a broad range of
network systems with different capabilities.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "anonymization; network measurement; privacy",
}
@Article{Rich:2007:ATS,
author = "Donald Rich",
title = "Authentication in Transient Storage Device
Attachments",
journal = j-COMPUTER,
volume = "40",
number = "4",
pages = "102--104",
month = apr,
year = "2007",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2007.116",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:34 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Rodwell:2007:NIBa,
author = "P. M. Rodwell and S. M. Furnell and P. L. Reynolds",
title = "A non-intrusive biometric authentication mechanism
utilising physiological characteristics of the human
head",
journal = j-COMPUT-SECUR,
volume = "26",
number = "7--8",
pages = "468--478",
month = dec,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:07 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404807001095",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Rodwell:2007:NIBb,
author = "P. M. Rodwell and S. M. Furnell and P. L. Reynolds",
title = "A non-intrusive biometric authentication mechanism
utilising physiological characteristics of the human
head",
journal = j-COMPUT-SECUR,
volume = "26",
number = "7--8",
pages = "468--478",
month = dec,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:08 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404807001095",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Rodwell:2007:NIBc,
author = "P. M. Rodwell and S. M. Furnell and P. L. Reynolds",
title = "A non-intrusive biometric authentication mechanism
utilising physiological characteristics of the human
head",
journal = j-COMPUT-SECUR,
volume = "26",
number = "7--8",
pages = "468--478",
month = dec,
year = "2007",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:08 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404807001095",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Roman:2007:SCP,
author = "Rodrigo Roman and Cristina Alcaraz and Javier Lopez",
title = "A survey of cryptographic primitives and
implementations for hardware-constrained sensor network
nodes",
journal = "Mobile Networks and Applications",
volume = "12",
number = "4",
pages = "231--244",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1007/s11036-007-0024-2",
ISSN = "1383-469X",
bibdate = "Thu Apr 21 10:25:26 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In a wireless sensor network environment, a sensor
node is extremely constrained in terms of hardware due
to factors such as maximizing lifetime and minimizing
physical size and overall cost. Nevertheless, these
nodes must be able to run cryptographic operations
based on primitives such as hash functions, symmetric
encryption and public key cryptography in order to
allow the creation of secure services. Our objective in
this paper is to survey how the existing research-based
and commercial-based sensor nodes are suitable for this
purpose, analyzing how the hardware can influence the
provision of the primitives and how software
implementations tackles the task of implementing
instances of those primitives. As a result, it will be
possible to evaluate the influence of provision of
security in the protocols and applications\slash
scenarios where sensors can be used.",
acknowledgement = ack-nhfb,
keywords = "cryptography, hardware, sensor networks",
}
@Article{Rosenblum:2007:WAC,
author = "David Rosenblum",
title = "What Anyone Can Know: The Privacy Risks of Social
Networking Sites",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "40--49",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.75",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Rothe:2007:BRB,
author = "J{\"o}rg Rothe",
title = "Book Review: {{\booktitle{Complexity and Cryptography:
An Introduction}}, by John Talbot and Dominic Welsh,
Cambridge University Press, 2006, 292 pages}",
journal = j-SIGACT,
volume = "38",
number = "2",
pages = "16--20",
month = jun,
year = "2007",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1272729.1272735",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:29 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact38.html#Rothe07;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2007.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Talbot:2006:CCI}.",
URL = "http://doi.acm.org/10.1145/1272729.1272735",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Sakr:2007:RCB,
author = "Ziad Sakr and Nicolas D. Georganas",
title = "Robust content-based {MPEG}-4 {XMT} scene structure
authentication and multimedia content location",
journal = j-TOMCCAP,
volume = "3",
number = "3",
pages = "18:1--18:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1236471.1236477",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Mon Jun 16 17:10:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "For the past decade, there have been numerous research
works focusing on the protection of digital images,
audio, video, 3D virtual scenes, and software data from
unauthorized use and distribution. With the emerging
technology of the MPEG-4 standard, MPEG-4 scenes that
may include images, video, audio, and 3D objects can
easily be built using the text-based MPEG-4 XMT
standard. XMT allows content authors to exchange their
content with other authors, tools, or service providers
and facilitates interoperability with MPEG-4, X3D, and
SMIL. In order for owners and designers to protect
and/or authenticate their work, some form of security
needs to be applied into the MPEG-4 XMT structure and
its media content. Unlike images or videos,
watermarking an XMT structure is not an easy task,
since the structure contains no noise components to
embed the watermark. This article is the first one
proposing a novel robust algorithm for the
authentication of a given MPEG-4 XMT structured scene
and the location of its multimedia content.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "MPEG-4; multimedia; polynomial; pseudorandom
sequences; steganography; VRML; watermarking; XML;
XMT",
}
@InProceedings{Saldamli:2007:SME,
author = "Gokay Saldamli and Cetin K. Koc",
title = "Spectral Modular Exponentiation",
crossref = "Kornerup:2007:PIS",
pages = "123--132",
year = "2007",
DOI = "https://doi.org/10.1109/ARITH.2007.34",
bibdate = "Tue Oct 9 16:32:41 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We describe a new method to perform the modular
exponentiation operation, i.e., the computation of $ c
= m e \bmod n $, where $c$, $m$, $e$ and $n$ are large
integers. The new method uses the discrete Fourier
transform over a finite ring, and relies on new
techniques to perform multiplication and reduction
operations. The method yields efficient and highly
parallel architectures for hardware realizations of
public-key cryptosystems requiring the modular
exponentiation as the core computation, such as the RSA
and Diffie--Hellman algorithms.",
acknowledgement = ack-nhfb,
}
@Article{Salido:2007:EBE,
author = "Javier Salido and Loukas Lazos and Radha Poovendran",
title = "Energy and bandwidth-efficient key distribution in
wireless ad hoc networks: a cross-layer approach",
journal = j-IEEE-TRANS-NETWORKING,
volume = "15",
number = "6",
pages = "1527--1540",
month = dec,
year = "2007",
CODEN = "IEANEP",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Thu Jun 19 09:58:21 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "We address the problem of resource-efficient access
control for group communications in wireless ad hoc
networks. Restricting the access to group data can be
reduced to the problem of securely distributing
cryptographic keys to group members, known as the key
distribution problem (KDP). We examine the KDP under
four metrics: (a) member key storage, (b) group
controller (GC) transmissions, (c) multicast group (MG)
update messages, and (d) average update energy. For
each metric, we formulate an optimization problem and
show that the KDP has unique solutions for metrics (a)
and (b), while is NP-complete for (c) and (d). We
propose a cross-layer heuristic algorithm called VP3
that bounds member key storage, and GC transmissions,
while significantly reducing the energy and bandwidth
consumption of the network. We define the notion of
path divergence as a measure of bandwidth efficiency of
multicasting, and establish an analytical worst-case
bound for it. Finally, we propose On-line VP3, which
dynamically updates the key assignment structure
according to the dynamics of the communication group in
a resource-efficient way.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "Ad hoc; key distribution; key management; multicast;
secure group communication; security",
}
@Book{Salomon:2007:DCC,
author = "David Salomon",
title = "Data Compression: The Complete Reference",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxv + 1092",
year = "2007",
ISBN = "1-84628-602-6",
ISBN-13 = "978-1-84628-602-5",
LCCN = "????",
bibdate = "Tue Jan 23 14:16:11 MST 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
note = "With contributions by Giovanni Motta and David
Bryant.",
acknowledgement = ack-nhfb,
}
@Article{Sasse:2007:REB,
author = "M. Angela Sasse",
title = "Red-Eye Blink, Bendy Shuffle, and the Yuck Factor: a
User Experience of Biometric Airport Systems",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "78--81",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.69",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Saxena:2007:TCP,
author = "Nitesh Saxena and Gene Tsudik and Jeong Hyun Yi",
title = "Threshold cryptography in {P2P} and {MANETs}: {The}
case of access control",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "12",
pages = "3632--3649",
day = "22",
month = aug,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:20 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Scharwaechter:2007:AAE,
author = "Hanno Scharwaechter and David Kammler and Andreas
Wieferink and Manuel Hohenauer and Kingshuk Karuri and
Jianjiang Ceng and Rainer Leupers and Gerd Ascheid and
Heinrich Meyr",
title = "{ASIP} architecture exploration for efficient {IPSec}
encryption: a case study",
journal = j-TECS,
volume = "6",
number = "2",
pages = "12:1--12:??",
month = may,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1234675.1234679",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Jun 12 15:21:17 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Application-Specific Instruction-Set Processors
(ASIPs) are becoming increasingly popular in the world
of customized, application-driven System-on-Chip (SoC)
designs. Efficient ASIP design requires an iterative
architecture exploration loop---gradual refinement of
the processor architecture starting from an initial
template. To accomplish this task, design automation
tools are used to detect bottlenecks in embedded
applications, to implement application-specific
processor instructions, and to automatically generate
the required software tools (such as instruction-set
simulator, C-compiler, assembler, and profiler), as
well as to synthesize the hardware. This paper
describes an architecture exploration loop for an ASIP
coprocessor that implements common encryption
functionality used in symmetric block cipher algorithms
for internet protocol security (IPSec). The coprocessor
is accessed via shared memory and, as a consequence,
our approach is easily adaptable to arbitrary main
processor architectures. This paper presents the
extended version of our case study that has been
already published on the SCOPES conference in 2004. In
both papers, a MIPS architecture is used as the main
processor and Blowfish as encryption algorithm.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "ADL; ASIP; computer-aided design; IPSec",
}
@Article{Schlager:2007:EAA,
author = "Christian Schl{\"a}ger and Thomas Nowey",
title = "On the effects of authentication and authorisation
infrastructures on e-commerce activities",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "22",
number = "5",
pages = "??--??",
month = sep,
year = "2007",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:36:12 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Schneier:2007:NCS,
author = "Bruce Schneier",
title = "Nonsecurity Considerations in Security Decisions",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "88",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.68",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Book{Sebag-Montefiore:2007:EBC,
author = "Hugh Sebag-Montefiore",
title = "{Enigma}: the battle for the code",
publisher = pub-BN,
address = pub-BN:adr,
pages = "x + 422 + 16",
year = "2007",
ISBN = "0-7607-9118-X",
ISBN-13 = "978-0-7607-9118-9",
LCCN = "D810.C88 S43 2007",
bibdate = "Mon Dec 19 12:28:07 MST 2016",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Winston Churchill called the cracking of the German
Enigma code 'the secret weapon that won the war.' Now,
for the first time, noted British journalist Hugh
Sebag-Montefiore reveals the complete story of the
breaking of the code by the Allies --- a breakthrough
that played a crucial role in the outcome of World War
II. This fascinating account recounts the
never-before-told, hair-raising stories of the heroic
British and American sailors, spies, and secret agents
who faced death in order to capture vital codebooks
form sinking ships and snatch them from under the noses
of Nazi officials. The author also relates new details
about the genesis of the code, little-known facts about
how the Poles first cracked the Luftwaffe's version of
the code (and then passed it along to the British), and
the feverish activities at Bletchley Park, where the
day-to-day grind to decode Enigma went on.",
acknowledgement = ack-nhfb,
remark = "Reprint. Originally published: New York: John Wiley,
2000.",
subject = "Turing, Alan Mathison; Hinsley, F. H. (Francis Harry);
Schmidt, Hans Thilo; Enigma cipher system; History;
World War, 1939--1945; Cryptography; Electronic
intelligence; Great Britain; Secret service; France;
Naval operations, German; Machine ciphers;
Cryptography; Electronic intelligence; Enigma cipher
system; Machine ciphers; Military operations, Naval;
German; Secret service; Bletchley Park (Milton Keynes,
England); England; Milton Keynes; Bletchley Park",
subject-dates = "1912--1954; 1918; 1888--1943; 1918; 1888--1943;
1912--1954",
tableofcontents = "The betrayal: Belgium and Germany, 1931 \\
The leak: Poland, Belgium and Germany, 1929--38 \\
An inspired guess: Poland, 1932 \\
A terrible mistake: Poland, 1933--9 \\
Flight: Germany, Poland, France and England, 1939--40
\\
The first capture: Scotland, 1940 \\
Mission Impossible: Norway and Bletchley Park, 1940 \\
Keeping the Enigma secret: France and Bletchley Park,
May \\
September 1940 \\
Deadlock: Bletchley Park, August \\
October, 1940 \\
The Italian affair: Bletchley Park and the
Mediterranean, March 1941 \\
The end of the beginning: Norway, March 1941 \\
Breakthrough: North of Iceland, May 1941 \\
Operation Primrose: the Atlantic, May 1941 \\
The knock-out blow: North of Iceland, June 1941 \\
Suspicion: Bletchley Park, the Atlantic and Berlin, May
\\
October 1941 \\
A two-edged sword: the Atlantic and the Cape Verde
Islands, September 1941 \\
Living dangerously: the South Atlantic and Norway,
November 1941 \\
March 1942 \\
The hunt for the Bigram tables: Bletchley Park and
Norway, December 1941 \\
Black out: the Barents Sea, Bletchley Park, and the
admiralty, February \\
July 1942 \\
Breaking the deadlock: the Mediterranean and Bletchley
Park, October \\
December 1942 \\
The turning point: South France, the Mediterranean and
the Atlantic, November 1942 \\
September 1943 \\
Trapped: South France, November 1942 \\
March 1943 \\
The arrest: Berlin, March \\
September 1943 \\
Sinking the Scharnhorst: the Barents Sea, December 1943
\\
Operation covered: Paris, the Indian Ocean, and the
Atlantic, August 1943 \\
March 1944 \\
The last Hiccough: Germany, France, and the South
Atlantic, March \\
June 1944 \\
Epilogue: Where did they go?",
}
@Article{Sebe:2007:SMO,
author = "Francesc Seb{\'e} and Alexandre Viejo and Josep
Domingo-Ferrer",
title = "Secure many-to-one symbol transmission for
implementation on smart cards",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2299--2307",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@InProceedings{Shaltiel:2007:LEU,
author = "Ronen Shaltiel and Christopher Umans",
title = "Low-end uniform hardness vs. randomness tradeoffs for
{AM}",
crossref = "ACM:2007:SPA",
pages = "430--439",
year = "2007",
DOI = "https://doi.org/10.1145/1250790.1250854",
bibdate = "Fri Jun 20 18:28:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In 1998, Impagliazzo and Wigderson [18] proved a
hardness vs. randomness tradeoff for BPP in the uniform
setting,which was subsequently extended to give optimal
tradeoffs for the full range of possible hardness
assumptions by Trevisan and Vadhan [29] (in a slightly
weaker setting). In 2003, Gutfreund,Shaltiel and
Ta-Shma [11] proved a uniform hardness vs. randomness
tradeoff for AM, but that result only worked on the
`high-end' of possible hardness assumptions.\par
In this work, we give uniform hardness vs. randomness
tradeoffs for AM that are near-optimal for the full
range of possible hardness assumptions. Following [11],
we do this by constructing a hitting-set-generator
(HSG) for AM with `resilient reconstruction.' Our
construction is a recursive variant of the
Miltersen-Vinodchandran HSG [24], the only known HSG
construction with this required property. The main new
idea is to have the reconstruction procedure operate
implicitly and locally on superpolynomially large
objects, using tools from PCPs(low-degree testing,
self-correction) together with a novel use of
extractors that are built from Reed--Muller codes [28,
26] for a sort of locally-computable error-reduction.
As a consequence we obtain gap theorems for AM (and AM
$ \cap $ coAM) that state, roughly, that either AM (or
AM $ \cap $ coAM)protocols running in time t(n) can
simulate all of EXP('Arthur--Merlin games are
powerful'), or else all of AM (or AM $ \cap $ coAM) can
be simulated in nondeterministic time s(n)
('Arthur--Merlin games can be derandomized'), for a
near-optimal relationship between t(n) and s(n). As in
GST, the case of AM $ \cap $ coAM yields a particularly
clean theorem that is of special interest due to the
wide array of cryptographic and other problems that lie
in this class.",
acknowledgement = ack-nhfb,
keywords = "Arthur--Merlin games; derandomization; hardness vs.
randomness tradeoff; hitting-set generator",
}
@Article{Shehab:2007:WSD,
author = "Mohamed Shehab and Kamal Bhattacharya and Arif
Ghafoor",
title = "{Web} services discovery in secure collaboration
environments",
journal = j-TOIT,
volume = "8",
number = "1",
pages = "5:1--5:??",
month = nov,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1294148.1294153",
ISSN = "1533-5399 (print), 1557-6051 (electronic)",
ISSN-L = "1533-5399",
bibdate = "Mon Jun 16 10:58:59 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toit/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/toit.bib",
abstract = "Multidomain application environments where distributed
domains interoperate with each other is a reality in
Web-services-based infrastructures. Collaboration
enables domains to effectively share resources;
however, it introduces several security and privacy
challenges. In this article, we use the current web
service standards such as SOAP and UDDI to enable
secure interoperability in a service-oriented
mediator-free environment. We propose a multihop SOAP
messaging protocol that enables domains to discover
secure access paths to access roles in different
domains. Then we propose a path authentication
mechanism based on the encapsulation of SOAP messages
and the SOAP-DISG standard. Furthermore, we provide a
service discovery protocol that enables domains to
discover service descriptions stored in private UDDI
registries.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Internet Technology (TOIT)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780",
keywords = "encapsulated SOAP; private UDDI registries; protocols;
secure access paths; secure collaboration; services",
}
@Article{Shimizu:2007:CBE,
author = "K. Shimizu and H. P. Hofstee and J. S. Liberty",
title = "{Cell Broadband Engine} processor vault security
architecture",
journal = j-IBM-JRD,
volume = "51",
number = "5",
pages = "521--??",
month = sep,
year = "2007",
CODEN = "IBMJAE",
ISSN = "0018-8646 (print), 2151-8556 (electronic)",
ISSN-L = "0018-8646",
bibdate = "Wed Oct 31 11:53:46 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.research.ibm.com/journal/",
URL = "http://www.research.ibm.com/journal/rd/515/shimizu.html",
acknowledgement = ack-nhfb,
fjournal = "IBM Journal of Research and Development",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520",
}
@Misc{Shumow:2007:PBD,
author = "Dan Shumow and Niels Ferguson",
title = "On the Possibility of a Back Door in the {NIST
SP800-90 Dual EC Prng}",
howpublished = "Web slide show.",
day = "21",
month = aug,
year = "2007",
bibdate = "Fri Aug 15 11:45:01 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://rump2007.cr.yp.to/15-shumow.pdf",
acknowledgement = ack-nhfb,
remark = "The authors demonstrate key recovery from encrypted
streams produced by the method in the title.",
}
@Article{Slind:2007:PPS,
author = "Konrad Slind and Scott Owens and Juliano Iyoda and
Mike Gordon",
title = "Proof producing synthesis of arithmetic and
cryptographic hardware",
journal = j-FORM-ASP-COMPUT,
volume = "19",
number = "3",
pages = "343--362",
month = aug,
year = "2007",
CODEN = "FACME5",
DOI = "https://doi.org/10.1007/s00165-007-0028-5",
ISSN = "0934-5043 (print), 1433-299X (electronic)",
ISSN-L = "0934-5043",
bibdate = "Tue Mar 17 20:58:24 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
URL = "http://link.springer.com/article/10.1007/s00165-007-0028-5",
acknowledgement = ack-nhfb,
fjournal = "Formal Aspects of Computing",
journal-URL = "http://link.springer.com/journal/165",
}
@TechReport{Song:2007:TAK,
author = "Dawn Xiaodong Song and David Wagner and Xuqing Tian",
title = "Timing Analysis of Keystrokes and Timing Attacks on
{SSH}",
type = "Report",
institution = "University of California, Berkeley",
address = "Berkeley, CA, USA",
day = "15",
month = jul,
year = "2007",
bibdate = "Fri Sep 04 13:13:21 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cs.berkeley.edu/~dawnsong/papers/ssh-timing.pdf",
abstract = "SSH is designed to provide a secure channel between
two hosts. Despite the encryption and authentication
mechanisms it uses, SSH has two weakness: First, the
transmitted packets are padded only to an eight-byte
boundary (if a block cipher is in use), which reveals
the approximate size of the original data. Second, in
interactive mode, every individual keystroke that a
user types is sent to the remote machine in a separate
IP packet immediately after the key is pressed, which
leaks the interkeystroke timing information of users
typing. In this paper, we show how these seemingly
minor weaknesses result in serious security
risks.\par
First we show that even very simple statistical
techniques suffice to reveal sensitive information such
as the length of users passwords or even root
passwords. More importantly, we further show that by
using more advanced statistical techniques on timing
information collected from the network, the
eavesdropper can learn significant information about
what users type in SSH sessions. In particular, we
perform a statistical study of users typing patterns
and show that these patterns reveal information about
the keys typed. By developing a Hidden Markov Model and
our key sequence prediction algorithm, we can predict
key sequences from the interkeystroke timings. We
further develop an attacker system, Herbivore , which
tries to learn users passwords by monitoring SSH
sessions. By collecting timing information on the
network, Herbivore can speed up exhaustive search for
passwords by a factor of 50. We also propose some
countermeasures.\par
In general our results apply not only to SSH, but also
to a general class of protocols for encrypting
interactive traffic. We show that timing leaks open a
new set of security risks, and hence caution must be
taken when designing this type of protocol.",
acknowledgement = ack-nhfb,
}
@Book{Stallings:2007:CSP,
author = "William Stallings and Lawrie Brown",
title = "Computer Security: Principles and Practice",
publisher = pub-PH,
address = pub-PH:adr,
pages = "????",
year = "2007",
ISBN = "0-13-600424-5",
ISBN-13 = "978-0-13-600424-0",
LCCN = "????",
bibdate = "Thu Jul 26 12:35:05 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
}
@Book{Stamp:2007:ACB,
author = "Mark Stamp and Richard M. Low",
title = "Applied cryptanalysis: breaking ciphers in the real
world",
publisher = pub-WILEY-INTERSCIENCE,
address = pub-WILEY-INTERSCIENCE:adr,
pages = "xix + 401",
year = "2007",
ISBN = "0-470-11486-X",
ISBN-13 = "978-0-470-11486-5",
LCCN = "QA76.9.A25 S687 2007",
bibdate = "Sat Jun 13 08:32:27 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
}
@Article{Stipcevic:2007:QRN,
author = "M. Stip{\c{c}}evi{\'c} and B. Medved Rogina",
title = "Quantum random number generator",
journal = j-REV-SCI-INSTRUM,
volume = "78",
number = "045104",
pages = "9",
year = "2007",
CODEN = "RSINAK",
ISSN = "1089-7623, 0034-6748",
ISSN-L = "0034-6748",
bibdate = "Thu Jul 26 14:18:06 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "arXiv:quant-ph/0609043v2.",
URL = "http://qrbg.irb.hr/0609043v2.pdf",
abstract = "We report upon a novel realization of a fast
nondeterministic random number generator whose
randomness relies on intrinsic randomness of the
quantum physical processes of photonic emission in
semiconductors and subsequent detection by the
photoelectric effect. Timing information of detected
photons is used to generate binary random digits-bits.
The bit extraction method based on the restartable
clock method theoretically eliminates both bias and
autocorrelation while reaching efficiency of almost 0.5
bits per random event. A prototype has been built and
statistically tested.",
fjournal = "Review of scientific instruments",
journal-URL = "http://rsi.aip.org/",
}
@Article{Sung:2007:CIB,
author = "Jaechul Sung and Deukjo Hong and Seokhie Hong",
title = "Cryptanalysis of an involutional block cipher using
cellular automata",
journal = j-INFO-PROC-LETT,
volume = "104",
number = "5",
pages = "183--185",
day = "30",
month = nov,
year = "2007",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:52:52 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Book{Sutton:2007:FBF,
author = "Michael Sutton and Adam Greene and Pedram Amini",
title = "Fuzzing: brute force vulnerability discovery",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxvii + 543",
year = "2007",
ISBN = "0-321-44611-9 (paperback)",
ISBN-13 = "978-0-321-44611-4 (paperback)",
LCCN = "QA76.9.A25 S89 2007",
bibdate = "Mon Jun 30 08:54:19 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0713/2007011463.html",
acknowledgement = ack-nhfb,
subject = "computer security; computer networks; security
measures; computer software; development",
}
@Article{Tague:2007:CSA,
author = "Patrick Tague and Radha Poovendran",
title = "A canonical seed assignment model for key
predistribution in wireless sensor networks",
journal = j-TOSN,
volume = "3",
number = "4",
pages = "19:1--19:??",
month = oct,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1281492.1281494",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jun 16 17:50:34 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "A promising solution for trust establishment in
wireless sensor networks is the assignment of
cryptographic seeds (keys, secrets, etc.) to sensor
nodes prior to network deployment, known as key
predistribution. In this article, we propose a
canonical seed assignment model for key predistribution
characterizing seed assignment in terms of the
probability distribution describing the number of nodes
receiving each seed and the algorithm for seed
assignment. In addition, we present a sampling
framework for seed assignment algorithms in the
canonical model. We propose a probabilistic
$k$-connectivity model for randomly deployed secure
networks using spatial statistics and geometric random
graph theory. We analyze key predistribution schemes in
the canonical model in terms of network connectivity
and resilience to node capture. The analytical results
can be used to determine the average or worst-case
connectivity or resilience to node capture for a key
predistribution scheme. Furthermore, we demonstrate the
design of new key predistribution schemes and the
inclusion of existing schemes in the canonical model.
Finally, we present a general approach to analyze the
addition of nodes to an existing secure network and
derive results for a well-known scheme.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "key establishment; key predistribution; network
models; sensor networks",
}
@InProceedings{Tang:2007:MMU,
author = "Ping Tak Peter Tang",
title = "Modular Multiplication using Redundant Digit
Division",
crossref = "Kornerup:2007:PIS",
pages = "217--224",
year = "2007",
DOI = "https://doi.org/10.1109/ARITH.2007.22",
bibdate = "Tue Oct 9 17:16:03 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Most implementations of the modular exponentiation, $
M E \bmod N $, computation in cryptographic algorithms
employ Montgomery multiplication, $ (A B R - 1) \bmod N
$, instead of modular multiplication, $ A B \bmod N $,
even the former requires some transformational
overheads. This is so because a state-of-the-art
Montgomery multiplication implementation has a
performance advantage over direct modular
multiplication based on the Barrett algorithm that more
than compensates for the overhead. In this paper, we
present a direct modular multiplication method that is
comparable in speed to Montgomery multiplication. One
consequence is that when the exponent in small, direct
computation (which does not incur the transformational
overhead) using the modular multiplication algorithm
presented here results in practical performance gain.
For the exponent 17, for instance, which requires five
modular multiplication, a saving of up to 40\% can be
achieved.",
acknowledgement = ack-nhfb,
}
@Article{Tang:2007:SGK,
author = "Qiang Tang",
title = "On The Security of a Group Key Agreement Protocol",
journal = j-COMP-J,
volume = "50",
number = "5",
pages = "589--590",
month = sep,
year = "2007",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxm024",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:33 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol50/issue5/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/50/5/589;
http://comjnl.oxfordjournals.org/cgi/content/full/50/5/589;
http://comjnl.oxfordjournals.org/cgi/reprint/50/5/589",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Theoharidou:2007:CBK,
author = "Marianthi Theoharidou and Dimitris Gritazalis",
title = "Common Body of Knowledge for Information Security",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "64--67",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.32",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Thomas:2007:HQU,
author = "David B. Thomas and Wayne Luk",
title = "High Quality Uniform Random Number Generation Using
{LUT} Optimised State-transition Matrices",
journal = j-J-VLSI-SIGNAL-PROC,
volume = "47",
number = "1",
pages = "77--92",
year = "2007",
CODEN = "JVSPED",
DOI = "https://doi.org/10.1007/s11265-006-0014-9",
ISSN = "0922-5773",
ISSN-L = "0922-5773",
bibdate = "Mon Jun 27 22:53:35 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "From the issue entitled ``Special Issue: Field
Programmable Technology. Guest Editors: Gordon Brebner,
Samarjit Chakraborty, and Weng-Fai Wong''.",
abstract = "This paper presents a family of uniform random number
generators designed for efficient implementation in
Lookup table (LUT) based FPGA architectures. A
generator with a period of $ 2^k - 1 $ can be
implemented using $k$ flip-flops and $k$ LUTs, and
provides $k$ random output bits each cycle. Each
generator is based on a binary linear recurrence, with
a state-transition matrix designed to make best use of
all available LUT inputs in a given FPGA architecture,
and to ensure that the critical path between all
registers is a single LUT. This class of generator
provides a higher sample rate per area than LFSR and
Combined Tausworthe generators, and operates at similar
or higher clock-rates. The statistical quality of the
generators increases with $k$, and can be used to pass
all common empirical tests such as Diehard, Crush and
the NIST cryptographic test suite. Theoretical
properties such as global equidistribution can also be
calculated, and best and average case statistics shown.
Due to the large number of random bits generated per
cycle these generators can be used as a basis for
generators with even higher statistical quality, and an
example involving combination through addition is
demonstrated.",
acknowledgement = ack-nhfb,
fjournal = "Journal of VLSI Signal Processing",
keywords = "FPGA; Simulation; Uniform Random Numbers",
}
@Article{Torres:2007:ANS,
author = "Joaquin Torres and Antonio Izquierdo and Jose Maria
Sierra",
title = "Advances in network smart cards authentication",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "9",
pages = "2249--2261",
day = "20",
month = jun,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:18 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Trope:2007:CSD,
author = "Roland L. Trope and E. Michael Power and Vincent I.
Polley and Bradford C. Morley",
title = "A Coherent Strategy for Data Security through Data
Governance",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "3",
pages = "32--39",
month = may # "\slash " # jun,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.51",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:44 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Tsai:2007:TTA,
author = "Yuh-Ren Tsai and Shiuh-Jeng Wang",
title = "Two-tier authentication for cluster and individual
sets in mobile ad hoc networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "51",
number = "3",
pages = "883--900",
day = "21",
month = feb,
year = "2007",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Tsang:2007:WCT,
author = "Patrick P. Tsang",
title = "When Cryptographers Turn Lead into Gold",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "2",
pages = "76--79",
month = mar # "\slash " # apr,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.49",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Tseng:2007:SAG,
author = "Yuh-Min Tseng",
title = "A secure authenticated group key agreement protocol
for resource-limited mobile devices",
journal = j-COMP-J,
volume = "50",
number = "1",
pages = "41--52",
month = jan,
year = "2007",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxl043",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:32 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol50/issue1/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/50/1/41;
http://comjnl.oxfordjournals.org/cgi/content/full/50/1/41;
http://comjnl.oxfordjournals.org/cgi/reprint/50/1/41",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{vanOorschot:2007:IRS,
author = "P. C. van Oorschot and Tao Wan and Evangelos
Kranakis",
title = "On interdomain routing security and pretty secure {BGP
(psBGP)}",
journal = j-TISSEC,
volume = "10",
number = "3",
pages = "11:1--11:??",
month = jul,
year = "2007",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1266977.1266980",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:14 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "It is well known that the Border Gateway Protocol
(BGP), the IETF standard interdomain routing protocol,
is vulnerable to a variety of attacks, and that a
single misconfigured or malicious BGP speaker could
result in large-scale service disruption. In this
paper, we present Pretty Secure BGP (psBGP) ---a
proposal for securing BGP, including an architectural
overview, design details for significant aspects, and
preliminary security and operational analysis. psBGP
differs from other security proposals (e. g. , S-BGP
and soBGP) in that it makes use of a single-level PKI
for AS number authentication, a decentralized trust
model for verifying the propriety of IP prefix origin,
and a rating-based stepwise approach for AS_PATH
(integrity) verification. psBGP trades off the strong
security guarantees of S-BGP for presumed-simpler
operation, e. g. , using a PKI with a simple structure,
with a small number of certificate types, and of
manageable size. psBGP is designed to successfully
defend against various (nonmalicious and malicious)
threats from uncoordinated BGP speakers, and to be
incrementally deployed with incremental benefits.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "authentication; BGP; certificates; interdomain
routing; public-key infrastructure; secure routing
protocols; trust",
}
@InProceedings{Vaudenay:2007:POK,
author = "Serge Vaudenay and Martin Vuagnoux",
editor = "Carlisle Adams and Ali Miri and Michael Wiener",
booktitle = "{Selected areas in cryptography: 14th international
workshop, SAC 2007, Ottawa, Canada, August 16--17,
2007, revised selected papers}",
title = "Passive-Only Key Recovery Attacks on {RC4}",
volume = "4876",
publisher = pub-SV,
address = pub-SV:adr,
pages = "344--359",
year = "2007",
ISBN = "3-540-77359-2 (softcover)",
ISBN-13 = "978-3-540-77359-7 (softcover)",
LCCN = "QA76.9 2007",
bibdate = "Mon Jan 23 06:51:58 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.loc.gov/catdir/enhancements/fy0826/2007941250-d.html",
abstract = "We present several weaknesses in the key scheduling
algorithm of RC4 when the secret key contains an
initialization vector --- a cryptographic scheme
typically used by the WEP and WPA protocols to protect
IEEE 802.11 wireless communications. First, we show how
the previously discovered key recovery attacks can be
improved by reducing the dependency between the secret
key bytes. Then, we describe two new weaknesses related
to the modulo operation of the key scheduling
algorithm. Finally, we describe a passive-only attack
able to significantly improve the key recovery process
on WEP with a data complexity of $ 2^{15} $
eavesdropped packets.",
acknowledgement = ack-nhfb,
remark = "The Fedora Linux {\tt airsnort} package implements an
attack on WEP. See the remark in entry
\cite{Fluhrer:2001:WKS}.",
}
@InProceedings{Vural:2007:IND,
author = "Cabir Vural and Serap Kazan",
title = "Image Normalization and Discrete Wavelet Transform
Based Robust Digital Image Watermarking",
crossref = "Simos:2007:CMS",
volume = "2B",
pages = "1404--1407",
year = "2007",
bibdate = "Thu Feb 21 14:34:40 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://proceedings.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&
id=APCPCS000963000002001404000001& idtype=cvips",
acknowledgement = ack-nhfb,
}
@Article{Wang:2007:NCD,
author = "Zhenghong Wang and Ruby B. Lee",
title = "New cache designs for thwarting software cache-based
side channel attacks",
journal = j-COMP-ARCH-NEWS,
volume = "35",
number = "2",
pages = "494--505",
month = may,
year = "2007",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/1250662.1250723",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Tue Jun 17 11:48:43 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Software cache-based side channel attacks are a
serious new class of threats for computers. Unlike
physical side channel attacks that mostly target
embedded cryptographic devices, cache-based side
channel attacks can also undermine general purpose
systems. The attacks are easy to perform, effective on
most platforms, and do not require special instruments
or excessive computation power. In recently
demonstrated attacks on software implementations of
ciphers like AES and RSA, the full key can be recovered
by an unprivileged user program performing simple
timing measurements based on cache misses.\par
We first analyze these attacks, identifying cache
interference as the root cause of these attacks. We
identify two basic mitigation approaches: the
partition-based approach eliminates cache interference
whereas the randomization-based approach randomizes
cache interference so that zero information can be
inferred. We present new security-aware cache designs,
the Partition-Locked cache (PLcache) and Random
Permutation cache (RPcache), analyze and prove their
security, and evaluate their performance. Our results
show that our new cache designs with built-in security
can defend against cache-based side channel attacks in
general-rather than only specific attacks on a given
cryptographic algorithm-with very little performance
degradation and hardware cost.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
keywords = "cache; computer architecture; processor; security;
side channel; timing attacks",
}
@Article{Wang:2007:VBW,
author = "Feng-Hsing Wang and Lakhmi C. Jain and Jeng-Shyang
Pan",
title = "{VQ}-based watermarking scheme with genetic codebook
partition",
journal = j-J-NETW-COMPUT-APPL,
volume = "30",
number = "1",
pages = "4--23",
month = jan,
year = "2007",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S108480450500038X",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Williams:2007:FTA,
author = "D. Williams and H. Lutfiyya",
title = "Fault-Tolerant Authentication Services",
journal = j-INT-J-COMPUT-APPL,
volume = "29",
number = "2",
pages = "107--114",
year = "2007",
CODEN = "IJCAFW",
DOI = "https://doi.org/10.1080/1206212X.2007.11441838",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:23:55 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2007.11441838",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Woody:2007:COS,
author = "Carol Woody and Christopher Alberts",
title = "Considering Operational Security Risk during System
Development",
journal = j-IEEE-SEC-PRIV,
volume = "5",
number = "1",
pages = "30--35",
month = jan # "\slash " # feb,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2007.3",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Aug 2 17:50:43 MDT 2007",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security \& Privacy",
}
@Article{Xie:2007:ISP,
author = "Tao Xie and Xiao Qin",
title = "Improving security for periodic tasks in embedded
systems through scheduling",
journal = j-TECS,
volume = "6",
number = "3",
pages = "20:1--20:??",
month = jul,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1275986.1275992",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Jun 12 15:49:41 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "While many scheduling algorithms for periodic tasks
ignore security requirements posed by sensitive
applications and are, consequently, unable to perform
properly in embedded systems with security constraints,
in this paper, we present an approach to scheduling
periodic tasks in embedded systems subject to security
and timing constraints. We design a necessary and
sufficient feasibility check for a set of periodic
tasks with security requirements. With the feasibility
test in place, we propose a scheduling algorithm, or
SASES (security-aware scheduling for embedded systems),
which accounts for both security and timing
requirements. SASES judiciously distributes slack times
among a variety of security services for a set of
periodic tasks, thereby optimizing security for
embedded systems without sacrificing schedulability. To
demonstrate the effectiveness of SASES, we apply the
proposed SASES to real-world embedded systems such as
an automated flight control system. We show, through
extensive simulations, that SASES is able to maximize
security for embedded systems while guaranteeing
timeliness. In particular, SASES significantly improves
security over three baseline algorithms by up to
107\%.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "embedded systems; periodic tasks; real-time systems;
scheduling; security-sensitive applications",
}
@Article{Xu:2007:CAD,
author = "Changsheng Xu and Namunu C. Maddage and Xi Shao and Qi
Tian",
title = "Content-adaptive digital music watermarking based on
music structure analysis",
journal = j-TOMCCAP,
volume = "3",
number = "1",
pages = "??--??",
month = feb,
year = "2007",
CODEN = "????",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Sat Apr 14 11:19:17 MDT 2007",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
}
@Book{Yan:2007:CAR,
author = "Song Y. Yan",
title = "Cryptanalytic attacks on {RSA}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xx + 254",
year = "2007",
ISBN = "0-387-48741-7",
ISBN-13 = "978-0-387-48741-0",
LCCN = "QA76.9.A25 Y34 2007",
bibdate = "Fri Mar 23 19:15:13 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.bibsys.no:2100/BIBSYS",
abstract = "RSA is a public-key cryptographic system, and is the
most famous and widely-used cryptographic system in
today's digital world. Cryptanalytic Attacks on RSA, a
professional book, covers almost all known
cryptanalytic attacks and defenses of the RSA
cryptographic system and its variants. Since RSA
depends heavily on computational complexity theory and
number theory, background information on complexity
theory and number theory is presented first, followed
by an account of the RSA cryptographic system and its
variants. This book is also suitable as a secondary
text for advanced-level students in computer science
and mathematics",
acknowledgement = ack-nhfb,
subject = "Data encryption (Computer science); Computer networks;
Security measures; Cryptography",
}
@Article{Yang:2007:IIS,
author = "Ching-Nung Yang and Tse-Shih Chen and Kun Hsuan Yu and
Chung-Chun Wang",
title = "Improvements of image sharing with steganography and
authentication",
journal = j-J-SYST-SOFTW,
volume = "80",
number = "7",
pages = "1070--1076",
month = jul,
year = "2007",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Ye:2007:NAW,
author = "Dengpan Ye and Changfu Zou and Yuewei Dai and Zhiquan
Wang",
title = "A new adaptive watermarking for real-time {MPEG}
videos",
journal = j-APPL-MATH-COMP,
volume = "185",
number = "2",
pages = "907--918",
day = "15",
month = feb,
year = "2007",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:02 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@PhdThesis{Yekhanin:2007:LDC,
author = "Sergey Yekhanin",
title = "Locally Decodable Codes and Private Information
Retrieval Schemes",
type = "{Ph.D.} dissertation",
school = "Massachusetts Institute of Technology",
address = "Cambridge, MA, USA",
year = "2007",
bibdate = "Thu Jun 12 09:50:44 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Winner of the ACM 2007 Doctoral Dissertation Award.",
URL = "http://www.acm.org/press-room/news-releases/dd-award-07",
acknowledgement = ack-nhfb,
}
@Article{Yu:2007:NSM,
author = "Yuan-Hui Yu and Chin-Chen Chang and Iuon-Chang Lin",
title = "A new steganographic method for color and grayscale
image hiding",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "107",
number = "3",
pages = "183--194",
month = sep,
year = "2007",
CODEN = "CVIUF4",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Apr 2 10:55:53 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@Article{Yue:2007:SEV,
author = "Tai-Wen Yue and Suchen Chiang",
title = "The semipublic encryption for visual cryptography
using {Q'tron} neural networks",
journal = j-J-NETW-COMPUT-APPL,
volume = "30",
number = "1",
pages = "24--41",
month = jan,
year = "2007",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:07 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804505000391",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Zheng:2007:SRI,
author = "Dong Zheng and Yan Liu and Jiying Zhao and
Abdulmotaleb El Saddik",
title = "A survey of {RST} invariant image watermarking
algorithms",
journal = j-COMP-SURV,
volume = "39",
number = "2",
pages = "5:1--5:91",
month = jul,
year = "2007",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1242471.1242473",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Thu Jun 19 10:21:12 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this article, we review the algorithms for
rotation, scaling and translation (RST) invariant image
watermarking. There are mainly two categories of RST
invariant image watermarking algorithms. One is to
rectify the RST transformed image before conducting
watermark detection. Another is to embed and detect
watermark in an RST invariant or semi-invariant domain.
In order to help readers understand, we first introduce
the fundamental theories and techniques used in the
existing RST invariant image watermarking algorithms.
Then, we discuss in detail the work principles,
embedding process, and detection process of the typical
RST invariant image watermarking algorithms. Finally,
we analyze and evaluate these typical algorithms
through implementation, and point out their advantages
and disadvantages.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Digital image watermarking; feature points;
Fourier-Mellin transform; ILPM; LPM; moments; Radon
transform; RST invariant; template matching",
}
@Article{Zhu:2007:EIB,
author = "Robert W. Zhu and Guomin Yang and Duncan S. Wong",
title = "An efficient identity-based key exchange protocol with
{KGS} forward secrecy for low-power devices",
journal = j-THEOR-COMP-SCI,
volume = "378",
number = "2",
pages = "198--207",
day = "6",
month = jun,
year = "2007",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Mar 29 08:55:48 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zhu:2007:IHH,
author = "Sencun Zhu and Sanjeev Setia and Sushil Jajodia and
Peng Ning",
title = "Interleaved hop-by-hop authentication against false
data injection attacks in sensor networks",
journal = j-TOSN,
volume = "3",
number = "3",
pages = "14:1--14:??",
month = aug,
year = "2007",
CODEN = "????",
DOI = "https://doi.org/10.1145/1267060.1267062",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jun 16 17:50:25 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Sensor networks are often deployed in unattended
environments, thus leaving these networks vulnerable to
false data injection attacks in which an adversary
injects false data into the network with the goal of
deceiving the base station or depleting the resources
of the relaying nodes. Standard authentication
mechanisms cannot prevent this attack if the adversary
has compromised one or a small number of sensor nodes.
We present three interleaved hop-by-hop authentication
schemes that guarantee that the base station can detect
injected false data immediately when no more than $t$
nodes are compromised, where $t$ is a system design
parameter. Moreover, these schemes enable an
intermediate forwarding node to detect and discard
false data packets as early as possible. Our
performance analysis shows that our scheme is efficient
with respect to the security it provides, and it also
allows a tradeoff between security and performance. A
prototype implementation of our scheme indicates that
our scheme is practical and can be deployed on the
current generation of sensor nodes.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "authentication; filtering false data; interleaved
hop-by-hop; sensor networks",
}
@Article{Zirkind:2007:ADC,
author = "Givon Zirkind",
title = "{AFIS} data compression: an example of how domain
specific compression algorithms can produce very high
compression ratios",
journal = j-COMP-GRAPHICS,
volume = "41",
number = "4",
pages = "1--36",
month = nov,
year = "2007",
CODEN = "CGRADI, CPGPBZ",
DOI = "https://doi.org/10.1145/1331098.1331103",
ISSN = "0097-8930 (print), 1558-4569 (electronic)",
ISSN-L = "0097-8930",
bibdate = "Wed Jun 18 10:13:23 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This article describes the development and
implementation of a data compression algorithm designed
specifically for fingerprints, referred to as GBP
compression. The algorithm is herein discussed. Data
Compression algorithms can be designed for general
applications, meaning the input data is unknown. This
is more commonly referred to as generic data. [LI01]
Or, data compression algorithms can be designed for
specific applications. E.g. AFIS [Automated Fingerprint
Identification Systems] 'When the input is known,
higher compression ratios can be achieved with the
knowledge of the input data stream.' To-date, the
highest compression ratio for an unknown input data
stream, for all data compression algorithms, is JPEG
with an average compression ratio range of 1:17 ---
1:23. [PEN03] The algorithm herein discussed, has a
compression ratio range of 1:68 --- 1:92. There is a
value, time and place for each design method ---
generic or specific --- depending upon a variety of
factors. Due to the nature of the use of AFIS for law
enforcement and incrimination as well as criminal
conviction, there are social issues that make data
integrity of paramount concern. This factor influences
algorithm selection and design. A lossless algorithm is
a must! Also, the nature of AFIS is such that it
operates across borders and between states,
municipalities and jurisdictions. In addition to the
usual issues and resistance to accepting new
technology, including software [e.g. resistance to
change, fear of system failure, etc.], there are the
issues of changing engineering standards [hardware and
software] which are governmentally determined as well
as governmental policy decisions. Likewise, the
portability required in implementing a new algorithm,
will have to deal with a variety of hardware and
software; as well as be designed to integrate into
existing systems. This integration must include the
ability to incorporate existing JPEG data files, from
existing police databases. This requires a handshaking
of standards and conversion programs that maintain data
integrity. In addition, there is an in depth discussion
of the limits of compression with a novel
perspective.",
acknowledgement = ack-nhfb,
fjournal = "Computer Graphics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J166",
keywords = "AFIS; automated fingerprint identification systems;
compatibility; compression; data compression; data
encryption; data integrity; double compression;
fingerprinting; graphics; image compression; image
quality; limits of compression; portability;
retrofitting; serial compression; software
engineering",
}
@Article{Aaraj:2008:ADH,
author = "Najwa Aaraj and Anand Raghunathan and Niraj K. Jha",
title = "Analysis and design of a hardware\slash software
trusted platform module for embedded systems",
journal = j-TECS,
volume = "8",
number = "1",
pages = "8:1--8:??",
month = dec,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1457246.1457254",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Jan 6 14:36:01 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Trusted platforms have been proposed as a promising
approach to enhance the security of general-purpose
computing systems. However, for many
resource-constrained embedded systems, the size and
cost overheads of a separate Trusted Platform Module
(TPM) chip are not acceptable. One alternative is to
use a software-based TPM, which implements TPM
functions using software that executes in a protected
execution domain on the embedded processor itself.
However, since many embedded systems have limited
processing capabilities and are battery-powered, it is
also important to ensure that the computational and
energy requirements for SW-TPMs are acceptable.\par
In this article, we perform an evaluation of the energy
and execution time overheads for a SW-TPM
implementation on a handheld appliance (Sharp Zaurus
PDA). We characterize the execution time and energy
required by each TPM command through actual
measurements on the target platform. We observe that
for most commands, overheads are primarily due to the
use of 2,048-bit RSA operations that are performed
within the SW-TPM. In order to alleviate SW-TPM
overheads, we evaluate the use of Elliptic Curve
Cryptography (ECC) as a replacement for the RSA
algorithm specified in the Trusted Computing Group
(TCG) standards. In addition, we also evaluate the
overheads of using the SW-TPM in the context of various
end applications, including trusted boot of the Linux
operating system (OS), a secure VoIP client, and a
secure Web browser. Furthermore, we analyze the
computational workload involved in running SW-TPM
commands using ECC. We then present a suite of hardware
and software enhancements to accelerate these commands
--- generic custom instructions and exploitation of
parallel processing capabilities in multiprocessor
systems-on-chip (SoCs). We report results of evaluating
the proposed architectures on a commercial embedded
processor (Xtensa from Tensilica). Through uniprocessor
and multiprocessor optimizations, we could achieve
speed-ups of up to 5.71X for individual TPM commands.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "Custom instructions; embedded systems; multiprocessor
systems",
}
@Article{Abadi:2008:SAC,
author = "Mart{\'i}n Abadi and Bogdan Warinschi",
title = "Security analysis of cryptographically controlled
access to {XML} documents",
journal = j-J-ACM,
volume = "55",
number = "2",
pages = "6:1--6:29",
month = may,
year = "2008",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1346330.1346331",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Jun 16 18:08:44 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Some promising recent schemes for XML access control
employ encryption for implementing security policies on
published data, avoiding data duplication. In this
article, we study one such scheme, due to Miklau and
Suciu [2003]. That scheme was introduced with some
intuitive explanations and goals, but without precise
definitions and guarantees for the use of cryptography
(specifically, symmetric encryption and secret
sharing). We bridge this gap in the present work. We
analyze the scheme in the context of the rigorous
models of modern cryptography. We obtain formal results
in simple, symbolic terms close to the vocabulary of
Miklau and Suciu. We also obtain more detailed
computational results that establish security against
probabilistic polynomial-time adversaries. Our
approach, which relates these two layers of the
analysis, continues a recent thrust in security
research and may be applicable to a broad class of
systems that rely on cryptographic data protection.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "access control; authorization; encryption; XML",
}
@Book{Adjeroh:2008:BWT,
author = "Donald Adjeroh and Tim Bell and Amar Mukherjee",
title = "The {Burrows--Wheeler} Transform: Data Compression,
Suffix Arrays, and Pattern Matching",
publisher = "Springer Science+Business Media, LLC",
address = "Boston, MA",
pages = "xxii + 351",
year = "2008",
DOI = "https://doi.org/10.1007/978-0-387-78909-5",
ISBN = "0-387-78908-1, 0-387-78909-X",
ISBN-13 = "978-0-387-78908-8, 978-0-387-78909-5",
LCCN = "QA76.9.D33 A35 2008",
bibdate = "Fri Mar 23 18:07:56 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
subject = "Data Structures; Computer Science; Database
management; Information Storage and Retrieval; Data
structures (Computer science); Information storage and
retrieval systems; Data Structures, Cryptology and
Information Theory; datakomprimering",
}
@Article{Agarwal:2008:DWS,
author = "Rashmi Agarwal and M. S. Santhanam",
title = "Digital Watermarking in the Singular Vector Domain",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "8",
number = "3",
pages = "351--368",
month = jul,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467808003131",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Agreste:2008:NAP,
author = "Santa Agreste and Guido Andaloro",
title = "A new approach to pre-processing digital image for
wavelet-based watermark",
journal = j-J-COMPUT-APPL-MATH,
volume = "221",
number = "2",
pages = "274--283",
day = "15",
month = nov,
year = "2008",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:13:27 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2005.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042707005602",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@Article{Ahmad:2008:ATT,
author = "David Ahmad",
title = "Attack Trends: Two Years of Broken Crypto: {Debian}'s
Dress Rehearsal for a Global {PKI} Compromise",
journal = j-IEEE-SEC-PRIV,
volume = "6",
number = "5",
pages = "70--73",
month = sep # "\slash " # oct,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2008.131",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Jul 2 10:02:21 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "A patch to the OpenSSL package maintained by Debian
GNU/Linux (an operating system composed of free and
open source software that can be used as a desktop or
server OS) submitted in 2006 weakened its pseudo-random
number generator (PRNG), a critical component for
secure key generation. Putting both servers and users
at risk, this vulnerability affected OpenSSH, Apache
(mod\_ssl), the onion router (TOR), OpenVPN, and other
applications. In this article, the author examines
these issue and its consequences. OpenSSL is an open
source library implementing the SSL (Secure Socket
Layer) and TLS (Transport Layer Security) protocols.
Several widely deployed applications on many OSs rely
on it for secure communications, particularly Linux and
BSD-based systems. Where in use, it's a critical part
of the OS's security subsystem.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Ahmadi:2008:PFS,
author = "O. Ahmadi and D. Hankerson and F.
Rodr{\'\i}guez-Henr{\'\i}quez",
title = "Parallel Formulations of Scalar Multiplication on
{Koblitz} Curves",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "481--504",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/parallel_formulations_of_scalar",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Book{Aid:2008:NSA,
author = "Matthew M. Aid and Thomas R. Johnson",
title = "{National Security Agency} releases history of cold
war intelligence activities: {Soviet} strategic forces
went on alert three times during {September--October
1962} because of apprehension over {Cuban} situation,
top secret codeword history of {National Security
Agency} shows",
volume = "260",
publisher = "National Security Archive",
address = "Washington, DC, USA",
year = "2008",
LCCN = "JZ5630",
bibdate = "Mon Mar 9 12:12:19 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "National Security Archive electronic briefing book",
URL = "http://www.gwu.edu/~nsarchiv/NSAEBB/NSAEBB260/index.htm",
abstract = "In response to a declassification request by the
National Security Archive, the secretive National
Security Agency has declassified large portions of a
four-part top-secret Umbra study, American cryptology
during the Cold War. Despite major redactions, this
history discloses much new information about the
agency's history and the role of SIGINT and
communications intelligence (COMINT) during the Cold
War. Researched and written by NSA historian Thomas
Johnson, the three parts released so far provide a
frank assessment of the history of the Agency and its
forerunners, warts-and-all.",
acknowledgement = ack-nhfb,
remark = "Posted November 14, 2008",
subject = "Military intelligence; History; 20th century;
Cryptography; United States; Electronic surveillance;
Official secrets; Cold War; Cryptography.; Electronic
surveillance.; Military intelligence.; Official
secrets.",
}
@InProceedings{Al-Jarrah:2008:NKM,
author = "Omar Al-Jarrah and Ramzy Saifan",
editor = "Gabriele Kotsis and others",
booktitle = "{MoMM '08: Proceedings of the 6th International
Conference on Advances in Mobile Computing and
Multimedia, 24--26 November 2008, Linz, Austria}",
title = "A novel key management algorithm in sensor networks",
publisher = pub-ACM,
address = pub-ACM:adr,
bookpages = "xvi + 497",
pages = "291--294",
year = "2008",
DOI = "https://doi.org/10.1145/1497185.1497246",
ISBN = "1-60558-269-7",
ISBN-13 = "978-1-60558-269-6",
LCCN = "QA76.59 .I565 2008",
bibdate = "Thu Apr 21 10:29:57 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Data security in wireless sensor networks is very
important, especially in hostile environment, where we
must ensure that data is authentic, confidential, and
not tampered on the road. Network authenticity and
confidentiality need the existence of shared keys.
These keys are highly recommended to be in small scopes
so that the compromise of one node will not affect the
whole network. Key management is critical to maintain
the security functions. In this paper we introduce a
new key management algorithm, which ensures that most
of the node's neighbors are reliable. The proposed
algorithm minimizes interaction with base station,
number of transmitted packets, and energy consumption.
In addition, it does not use large scope keys.
Simulation results proof that the proposed algorithm is
scalable in terms of storage and communication
overhead, such that there is no correlation between the
number of nodes in the network from one side and number
of reliable neighbors and number of packets transmitted
from the other side.",
acknowledgement = ack-nhfb,
numpages = "4",
}
@Article{Anderson:2008:MMM,
author = "M. Anderson",
title = "Media: The Mash Monsters",
journal = j-IEEE-SPECTRUM,
volume = "45",
number = "5",
pages = "22--23",
month = may,
year = "2008",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2008.4505306",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Communication system security; copyright; copyright
law; Cryptography; Internet; Law; mash-up songs;
Mashups; music; Power engineering and energy; Power
system security; Telecommunication traffic; Ubiquitous
computing; Wireless networks",
}
@Book{Anderson:2008:SEG,
author = "Ross Anderson",
title = "Security engineering: a guide to building dependable
distributed systems",
publisher = pub-WILEY,
address = pub-WILEY:adr,
edition = "Second",
pages = "xl + 1040",
year = "2008",
ISBN = "0-470-06852-3 (cloth)",
ISBN-13 = "978-0-470-06852-6 (cloth)",
LCCN = "QA76.9.A25 A54 2008",
bibdate = "Tue Jul 20 17:22:15 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0827/2008006392-d.html;
http://www.loc.gov/catdir/enhancements/fy0827/2008006392-t.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Electronic data processing;
Distributed processing",
tableofcontents = "What is security engineering? \\
Usability and psychology \\
Protocols \\
Access control \\
Cryptography \\
Distributed systems \\
Economics \\
Multilevel security \\
Multilateral security \\
Banking and bookkeeping \\
Physical protection \\
Monitoring and metering \\
Nuclear command and control \\
Security printing and seals \\
Biometrics \\
Physical tamper resistance \\
Emission security \\
API attacks \\
Electronic and information warfare \\
Telecom system security \\
Network attack and defense \\
Copyright and DRM \\
The bleeding edge \\
Terror, justice and freedom \\
Managing the development of secure systems \\
System evaluation and assurance..",
}
@Article{Anonymous:2008:KAD,
author = "Anonymous",
title = "{Kaspersky} asks for decryption help",
journal = j-NETWORK-SECURITY,
volume = "2008",
number = "7",
pages = "1--2",
month = jul,
year = "2008",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(08)70081-3",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:54 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485808700813",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2008:RCB,
author = "Anonymous",
title = "Researchers crack bot net secrets",
journal = j-NETWORK-SECURITY,
volume = "2008",
number = "5",
pages = "2--2",
month = may,
year = "2008",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(08)70058-8",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:51 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485808700588",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Anonymous:2008:RES,
author = "Anonymous",
title = "Researchers encode secret messages in {VoIP} calls",
journal = j-NETWORK-SECURITY,
volume = "2008",
number = "7",
pages = "2--2",
month = jul,
year = "2008",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(08)70083-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:54 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485808700837",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@TechReport{Anonymous:2008:SHS,
author = "Anonymous",
key = "FIPS-180-3",
title = "{Secure Hash Standard (SHS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 180-3",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "v + 27",
month = oct,
year = "2008",
bibdate = "Thu Aug 21 06:08:01 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Superceded by FIPS 180-4 \cite{Anonymous:2012:SHS}.",
URL = "http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Federal Information
Processing Standards; hash algorithm; hash function;
message digest; Secure Hash Standard",
}
@Article{Askarov:2008:CMF,
author = "Aslan Askarov and Daniel Hedin and Andrei Sabelfeld",
title = "Cryptographically-masked flows",
journal = j-THEOR-COMP-SCI,
volume = "402",
number = "2--3",
pages = "82--101",
day = "8",
month = aug,
year = "2008",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:39 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Avoine:2008:CIT,
author = "Gildas Avoine and Pascal Junod and Philippe Oechslin",
title = "Characterization and Improvement of Time-Memory
Trade-Off Based on Perfect Tables",
journal = j-TISSEC,
volume = "11",
number = "4",
pages = "17:1--17:??",
month = jul,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1380564.1380565",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Aug 5 19:37:22 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Cryptanalytic time-memory trade-offs have been studied
for 25 years and have benefited from several
improvements since the original work of Hellman. The
ensuing variants definitely improve the original
trade-off but their real impact has never been
evaluated in practice. We fill this lack by analyzing
the {\em perfect\/} form of classic tables,
distinguished point-based tables, and rainbow tables.
We especially provide a thorough analysis of the latter
variant, whose performances have never been formally
calculated yet. Our analysis leads to the concept of a
{\em characteristic\/} that enables to measure the
intrinsic quality of a trade-off. We finally introduce
a new technique based on {\em checkpoints\/} that still
reduces the cryptanalysis time by ruling out false
alarms probabilistically. Our analysis yields the exact
gain of this approach and establishes its efficiency
when applied on rainbow tables.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "cryptography; Hellman's time-memory trade-off;
password cracking; rainbow tables",
}
@Article{Backes:2008:KDM,
author = "Michael Backes and Birgit Pfitzmann and Andre
Scedrov",
title = "Key-dependent message security under active attacks
--- {BRSIM\slash UC}-soundness of {Dolev--Yao}-style
encryption with key cycles",
journal = j-J-COMP-SECUR,
volume = "16",
number = "5",
pages = "497--530",
month = "????",
year = "2008",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2008-0332",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:03 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@PhdThesis{Baigneres:2008:QSB,
author = "Thomas Baign{\`e}res",
title = "Quantitative security of block ciphers : designs and
cryptanalysis tools",
type = "Th{\`e}se",
number = "4208",
school = "Facult{\'e} informatique et communications IC,
Programme doctoral Informatique, Communications et
Information, Institut de syst{\`e}mes de communication
ISC (Laboratoire de s{\'e}curit{\'e} et de
cryptographie LASEC), {\'E}cole polytechnique
f{\'e}d{\'e}rale de Lausanne EPFL",
address = "Lausanne, Switzerland",
pages = "243",
year = "2008",
bibdate = "Sat May 14 07:12:05 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
advisor = "Serge Vaudenay",
}
@Article{Bar-Yossef:2008:ESQ,
author = "Ziv Bar-Yossef and T. S. Jayram and Iordanis
Kerenidis",
title = "Exponential Separation of Quantum and Classical
One-Way Communication Complexity",
journal = j-SIAM-J-COMPUT,
volume = "38",
number = "1",
pages = "366--384",
month = "????",
year = "2008",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:55 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/38/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@InProceedings{Barkol:2008:CPR,
author = "Omer Barkol and Yuval Ishai and Enav Weinreb",
title = "Communication in the presence of replication",
crossref = "ACM:2008:SPA",
pages = "661--670",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374472",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We consider the following problem. Suppose that a big
amount of data is distributed among several parties, so
that each party misses only few pieces of data. The
parties wish to perform some global computation on the
data while minimizing the communication between them.
This situation is common in many real-life scenarios. A
naive solution to this problem is to first perform a
synchronization step, letting one party learn all
pieces of data, and then let this party perform the
required computation locally. We study the question of
obtaining better solutions to the problem, focusing
mainly on the case of computing low-degree polynomials
via non-interactive protocols. We present interesting
connections between this problem and the well studied
cryptographic problem of secret sharing. We use this
connection to obtain nontrivial upper bounds and lower
bounds using results and techniques from the domain of
secret sharing. The relation with open problems from
the area of secret sharing also provides evidence for
the difficulty of resolving some of the questions we
leave open.",
acknowledgement = ack-nhfb,
keywords = "communication complexity; secret sharing; simultaneous
messages",
}
@Article{Bartolini:2008:EIS,
author = "S. Bartolini and I. Branovic and R. Giorgi and E.
Martinelli",
title = "Effects of Instruction-Set Extensions on an Embedded
Processor: a Case Study on Elliptic Curve Cryptography
over {$ \mathrm {GF}(2^m) $}",
journal = j-IEEE-TRANS-COMPUT,
volume = "57",
number = "5",
pages = "672--685",
month = may,
year = "2008",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2007.70832",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 12:17:41 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4358294",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Bauer:2008:EHE,
author = "Friedrich L. Bauer",
title = "{Erich H{\"u}ttenhain: Entzifferung 1939--1945}.
({German}) [{Erich H{\"u}ttenhain}: deciphering
1939--1945]",
journal = j-INFORMATIK-SPEKTRUM,
volume = "31",
number = "3",
pages = "??--??",
month = "????",
year = "2008",
CODEN = "INSKDW",
DOI = "https://doi.org/10.1007/s00287-008-0242-4",
ISSN = "0170-6012 (print), 1432-122X (electronic)",
ISSN-L = "0170-6012",
bibdate = "Sat Aug 22 15:20:53 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.com/article/10.1007/s00287-008-0242-4",
acknowledgement = ack-nhfb,
author-dates = "Friedrich (``Fritz'') Ludwig Bauer (10 June 1924--26
March 2015)",
fjournal = "Informatik Spektrum",
journal-URL = "http://link.springer.com/journal/287",
language = "German",
}
@Article{Beimel:2008:CIW,
author = "Amos Beimel and Tamir Tassa and Enav Weinreb",
title = "Characterizing Ideal Weighted Threshold Secret
Sharing",
journal = j-SIAM-J-DISCR-MATH,
volume = "22",
number = "1",
pages = "360--397",
month = "????",
year = "2008",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/S0895480104445654",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Tue May 18 21:37:06 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/22/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/siamjdiscrmath.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@Misc{Bello:2008:OPR,
author = "L. Bello",
title = "{{\tt openssl}} --- predictable random number
generator",
howpublished = "Debian security advisory 1571-1.",
year = "2008",
bibdate = "Sat Nov 29 13:51:14 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
}
@TechReport{Bernstein:2008:CVS,
author = "Daniel J. Bernstein",
title = "{ChaCha}, a variant of {Salsa20}",
type = "Report",
institution = "Department of Mathematics, Statistics, and Computer
Science (M/C 249), The University of Illinois at
Chicago",
address = "Chicago, IL 60607-7045",
day = "28",
month = jan,
year = "2008",
bibdate = "Thu Jan 10 06:56:33 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://cr.yp.to/chacha/chacha-20080128.pdf",
abstract = "ChaCha8 is a 256-bit stream cipher based on the
8-round cipher Salsa20/8. The changes from Salsa20/8 to
ChaCha8 are designed to improve diffusion per round,
conjecturally increasing resistance to cryptanalysis,
while preserving --- and often improving --- time per
round. ChaCha12 and ChaCha20 are analogous
modifications of the 12-round and 20-round ciphers
Salsa20/12 and Salsa20/20. This paper presents the
ChaCha family and explains the differences between
Salsa20 and ChaCha.",
acknowledgement = ack-nhfb,
}
@Article{Bertolotti:2008:ERA,
author = "Ivan Cibrario Bertolotti and Luca Durante and Riccardo
Sisto and Adriano Valenzano",
title = "Efficient representation of the attacker's knowledge
in cryptographic protocols analysis",
journal = j-FORM-ASP-COMPUT,
volume = "20",
number = "3",
pages = "303--348",
month = may,
year = "2008",
CODEN = "FACME5",
DOI = "https://doi.org/10.1007/s00165-008-0078-3",
ISSN = "0934-5043 (print), 1433-299X (electronic)",
ISSN-L = "0934-5043",
bibdate = "Tue Mar 17 20:58:27 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/formaspcomput.bib",
URL = "http://link.springer.com/article/10.1007/s00165-008-0078-3",
acknowledgement = ack-nhfb,
fjournal = "Formal Aspects of Computing",
journal-URL = "http://link.springer.com/journal/165",
}
@InProceedings{Bhargavan:2008:CVI,
author = "Karthikeyan Bhargavan and C{\'e}dric Fournet and
Ricardo Corin and Eugen Zalinescu",
editor = "????",
booktitle = "ACM Conference on Computer and Communications
Security",
title = "Cryptographically verified implementations for {{\tt
tls}}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "459--468",
year = "2008",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:27:54 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 8]{Schneier:2015:SWC}.",
}
@Article{Bhargavan:2008:VII,
author = "Karthikeyan Bhargavan and C{\'e}dric Fournet and
Andrew D. Gordon and Stephen Tse",
title = "Verified interoperable implementations of security
protocols",
journal = j-TOPLAS,
volume = "31",
number = "1",
pages = "5:1--5:57",
month = dec,
year = "2008",
CODEN = "ATPSDT",
DOI = "https://doi.org/10.1145/1452044.1452049",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
ISSN-L = "0164-0925",
bibdate = "Tue Dec 23 11:52:52 MST 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toplas/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/toplas.bib",
abstract = "We present an architecture and tools for verifying
implementations of security protocols. Our
implementations can run with both concrete and symbolic
implementations of cryptographic algorithms. The
concrete implementation is for production and
interoperability testing. The symbolic implementation
is for debugging and formal verification. We develop
our approach for protocols written in F\#, a dialect of
ML, and verify them by compilation to ProVerif, a
resolution-based theorem prover for cryptographic
protocols. We establish the correctness of this
compilation scheme, and we illustrate our approach with
protocols for Web Services security.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Programming Languages and
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783",
keywords = "Functional programming; pi calculus; Web services; XML
security",
}
@Article{Bhargavan:2008:VPB,
author = "Karthikeyan Bhargavan and C{\'e}dric Fournet and
Andrew D. Gordon",
title = "Verifying policy-based web services security",
journal = j-TOPLAS,
volume = "30",
number = "6",
pages = "30:1--30:59",
month = oct,
year = "2008",
CODEN = "ATPSDT",
DOI = "https://doi.org/10.1145/1391956.1391957",
ISSN = "0164-0925 (print), 1558-4593 (electronic)",
ISSN-L = "0164-0925",
bibdate = "Sat Nov 1 20:05:05 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/toplas/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/toplas.bib",
abstract = "WS-SecurityPolicy is a declarative language for
configuring web services security mechanisms. We
describe a formal semantics for WS-SecurityPolicy and
propose a more abstract language for specifying secure
links between web services and their clients. We
present the architecture and implementation of tools
that (1) compile policy files from link specifications,
and (2) verify by invoking a theorem prover whether a
set of policy files run by any number of senders and
receivers correctly implements the goals of a link
specification, in spite of active attackers.
Policy-driven web services implementations are prone to
the usual subtle vulnerabilities associated with
cryptographic protocols; our tools help prevent such
vulnerabilities. We can verify policies when first
compiled from link specifications, and also re-verify
policies against their original goals after any
modifications during deployment. Moreover, we present
general security theorems for all configurations that
rely on compiled policies.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Programming Languages and
Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783",
keywords = "pi calculus; Web services; XML security",
}
@Book{Biggs:2008:CII,
author = "Norman Biggs",
title = "Codes: An introduction to Information Communication
and Cryptography",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 273",
year = "2008",
ISBN = "1-84800-273-4 (e-book), 1-84800-272-6 (paperback)",
ISBN-13 = "978-1-84800-273-9 (e-book), 978-1-84800-272-2
(paperback)",
LCCN = "QA268 .B496 2008eb",
bibdate = "Fri Mar 23 10:32:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
jenson.stanford.edu:2210/unicorn",
series = "Springer undergraduate mathematics series",
abstract = "This book is an integrated introduction to the
mathematics of coding, that is, replacing information
expressed in symbols, such as a natural language or a
sequence of bits, by another message using (possibly)
different symbols. There are three main reasons for
doing this: economy, reliability, and security, and
each is covered in detail. Only a modest mathematical
background is assumed, the mathematical theory being
introduced at a level that enables the basic problems
to be stated carefully, but without unnecessary
abstraction.",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Computer Science; IT;
COMPUTERS; Information Theory; Kryptologie",
tableofcontents = "Coding and its uses \\
Prefix-free codes \\
Economical coding \\
Data compression \\
Noisy channels \\
The problem of reliable communication \\
The noisy coding theorems \\
Linear codes \\
Algebraic coding theory \\
Coding natural languages \\
The development of cryptography \\
Cryptography in theory and practice \\
The RSA cryptosystem \\
Cryptography and calculation \\
Elliptic curve cryptography",
}
@InProceedings{Biham:2008:BA,
author = "E. Biham and Y. Carmeli and A. Shamir",
editor = "????",
booktitle = "{Advances in Cryptology, Proceedings of CRYPTO 08}",
title = "Bug attacks",
volume = "5157",
publisher = pub-SV,
address = pub-SV:adr,
pages = "221--240",
year = "2008",
bibdate = "Thu Sep 22 18:42:07 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Blaszczyk:2008:NMT,
author = "M. Blaszczyk and R. A. Guinee",
booktitle = "{MILCOM 2008. IEEE Military Communications Conference,
2008}",
title = "A novel modelled true random binary number generator
for key stream generation in cryptographic
applications",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--7",
year = "2008",
DOI = "https://doi.org/10.1109/MILCOM.2008.4753211",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4753211",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4723889",
}
@Article{Bogomjakov:2008:PMD,
author = "Alexander Bogomjakov and Craig Gotsman and Martin
Isenburg",
title = "Points and Meshes: Distortion-Free Steganography for
Polygonal Meshes",
journal = j-CGF,
volume = "27",
number = "2",
pages = "637--642",
month = apr,
year = "2008",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2008.01161.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:26:43 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "24 Apr 2008",
}
@Article{Boldyreva:2008:NMS,
author = "Alexandra Boldyreva and Craig Gentry and Adam O'Neill
and Dae Hyun Yum",
title = "New Multiparty Signature Schemes for Network Routing
Applications",
journal = j-TISSEC,
volume = "12",
number = "1",
pages = "3:1--3:??",
month = oct,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1410234.1410237",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Nov 11 15:54:06 MST 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We construct two new multiparty digital signature
schemes that allow multiple signers to sequentially and
non-interactively produce a compact, fixed-length
signature. First, we introduce a new primitive that we
call {\em ordered multisignature\/} (OMS) scheme, which
allows signers to attest to a common message as well as
the order in which they signed. Our OMS construction
substantially improves computational efficiency and
scalability over any existing scheme with suitable
functionality. Second, we design a new identity-based
sequential aggregate signature scheme, where signers
can attest to different messages and signature
verification does not require knowledge of traditional
public keys. The latter property permits savings on
bandwidth and storage as compared to public-key
solutions. In contrast to the only prior scheme to
provide this functionality, ours offers improved
security that does not rely on synchronized clocks or a
trusted first signer. We provide formal security
definitions and support the proposed schemes with
security proofs under appropriate computational
assumptions. We focus on applications of our schemes to
secure network routing, but we believe that they will
find other applications as well.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "aggregate signatures; digital signatures;
identity-based signatures; multisignatures; network
security; pairings",
}
@InProceedings{Boneh:2008:IBI,
author = "D. Boneh and P. Papakonstantinou and C. Rackoff and Y.
Vahlis and B. Waters",
title = "On the Impossibility of Basing Identity Based
Encryption on Trapdoor Permutations",
crossref = "IEEE:2008:PAI",
pages = "283--292",
year = "2008",
DOI = "https://doi.org/10.1109/FOCS.2008.67",
bibdate = "Thu Apr 12 09:33:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923",
}
@Article{Bouganim:2008:DAC,
author = "Luc Bouganim and Fran{\c{c}}ois Dang Ngoc and Philippe
Pucheral",
title = "Dynamic access-control policies on {XML} encrypted
data",
journal = j-TISSEC,
volume = "10",
number = "4",
pages = "4:1--4:??",
month = jan,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1284680.1284684",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:24 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The erosion of trust put in traditional database
servers and in Database Service Providers and the
growing interest for different forms of selective data
dissemination are different factors that lead to move
the access-control from servers to clients. Different
data encryption and key dissemination schemes have been
proposed to serve this purpose. By compiling the
access-control rules into the encryption process, all
these methods suffer from a static way of sharing data.
With the emergence of hardware security elements on
client devices, more dynamic client-based
access-control schemes can be devised. This paper
proposes a tamper-resistant client-based XML
access-right controller supporting flexible and dynamic
access-control policies. The access-control engine is
embedded in a hardware-secure device and, therefore,
must cope with specific hardware resources. This engine
benefits from a dedicated index to quickly converge
toward the authorized parts of a potentially streaming
XML document. Pending situations (i. e. , where data
delivery is conditioned by predicates, which apply to
values encountered afterward in the document stream)
are handled gracefully, skipping, whenever possible the
pending elements and reassembling relevant parts when
the pending situation is solved. Additional security
mechanisms guarantee that (1) the input document is
protected from any form of tampering and (2) no
forbidden information can be gained by replay attacks
on different versions of the XML document and of the
access-control rules. Performance measurements on
synthetic and real datasets demonstrate the
effectiveness of the approach. Finally, the paper
reports on two experiments conducted with a prototype
running on a secured hardware platform.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "access-control; data confidentiality; smartcard;
ubiquitous data management",
}
@Article{Bucci:2008:FDR,
author = "M. Bucci and R. Luzzi",
title = "Fully Digital Random Bit Generators for Cryptographic
Applications",
journal = j-IEEE-TRANS-CIRCUITS-SYST-1,
volume = "55",
number = "3",
pages = "861--875",
month = "????",
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1109/TCSI.2008.916446",
ISSN = "1549-8328 (print), 1558-0806 (electronic)",
ISSN-L = "1549-8328",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4432925",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=8919",
fjournal = "IEEE Transactions on Circuits and Systems I: Regular
Papers",
}
@InProceedings{Caboara:2008:GBP,
author = "Massimo Caboara and Fabrizio Caruso and Carlo
Traverso",
title = "{Gr{\"o}bner} bases for public key cryptography",
crossref = "Jeffrey:2008:PAM",
pages = "315--324",
year = "2008",
DOI = "https://doi.org/10.1145/1390768.1390811",
bibdate = "Wed Aug 6 09:11:59 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Up to now, any attempt to use Gr{\"o}bner bases in the
design of public key cryptosystems has failed, as
anticipated by a classical paper of B. Barkee et al.;
we show why, and show that the only residual hope is to
use binomial ideals, i.e., lattices. We propose two
lattice-based cryptosystems that will show the
usefulness of multivariate polynomial algebra and
Gr{\"o}bner bases in the construction of public key
cryptosystems. The first one tries to revive two
cryptosystems Polly Cracker and GGH, that have been
considered broken, through a hybrid; the second one
improves a cryptosystem (NTRU) that only has heuristic
and challenged evidence of security, providing evidence
that the extension cannot be broken with some of the
standard lattice tools that can be used to break some
reduced form of NTRU. Because of the bounds on length,
we only sketch the construction of these two
cryptosystems, and leave many details of the
construction of private and public keys, of the proofs
and of the security considerations to forthcoming
technical papers.",
acknowledgement = ack-nhfb,
keywords = "Gr{\"o}bner basis; Gr{\"o}bner Hermite normal form;
lattice; public key cryptosystem",
}
@Article{Casey:2008:IFD,
author = "Eoghan Casey and Gerasimos J. Stellatos",
title = "The impact of full disk encryption on digital
forensics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "93--98",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368519",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The integration of strong encryption into operating
systems is creating challenges for forensic examiners,
potentially preventing us from recovering any digital
evidence from a computer. Because strong encryption
cannot be circumvented without a key or passphrase,
forensic examiners may not be able to access data after
a computer is shut down, and must decide whether to
perform a live forensic acquisition. In addition, with
encryption becoming integrated into the operating
system, in some cases, virtualization is the most
effective approach to performing a forensic examination
of a system with FDE. This paper presents the evolution
of full disk encryption (FDE) and its impact on digital
forensics. Furthermore, by demonstrating how full disk
encryption has been dealt with in past investigations,
this paper provides forensics examiners with practical
techniques for recovering evidence that would otherwise
be inaccessible.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
keywords = "computer forensics; full disk encryption; live
forensic acquisition; virtual forensic analysis",
}
@Article{Cayrel:2008:SIS,
author = "P.-L. Cayrel and P. Gaborit and E. Prouff",
title = "Secure Implementation of the {Stern} Authentication
and Signature Schemes",
journal = j-LECT-NOTES-COMP-SCI,
volume = "5189",
pages = "191--205",
year = "2008",
CODEN = "LNCSD9",
DOI = "",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Thu Aug 31 16:00:05 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "",
acknowledgement = ack-nhfb,
fjournal = "Lecture Notes in Computer Science",
journal-URL = "http://link.springer.com/bookseries/558",
remark = "roc. IFIP WG 8.8/11.2 Int l Conf. Smart Card Research
and Advanced Applications (CARDIS 08)",
}
@Article{Chaitanya:2008:QQM,
author = "Shiva Chaitanya and Bhuvan Urgaonkar and Anand
Sivasubramaniam",
title = "{QDSL}: a queuing model for systems with differential
service levels",
journal = j-SIGMETRICS,
volume = "36",
number = "1",
pages = "289--300",
month = jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1384529.1375490",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Fri Jun 27 09:43:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "A feature exhibited by many modern computing systems
is their ability to improve the quality of output they
generate for a given input by spending more computing
resources on processing it. Often this improvement
comes at the price of degraded performance in the form
of reduced throughput or increased response time. We
formulate QDSL, a class of constrained optimization
problems defined in the context of a queueing server
equipped with multiple levels of service. Solutions to
QDSL provide rules for dynamically varying the service
level to achieve desired trade-offs between output
quality and performance. Our approach involves reducing
restricted versions of such systems to Markov Decision
Processes. We find two variants of such systems worth
studying: (i) VarSL, in which a single request may be
serviced using a combination of multiple levels during
its lifetime and (ii) FixSL in which the service level
may not change during the lifetime of a request. Our
modeling indicates that optimal service level selection
policies in these systems correspond to very simple
rules that can be implemented very efficiently in
realistic, online systems. We find our policies to be
useful in two response-time-sensitive real-world
systems: (i) qSecStore, an iSCSI-based secure storage
system that has access to multiple encryption
functions, and (ii) qPowServer, a server with
DVFS-capable processor. As a representative result, in
an instance of qSecStore serving disk requests derived
from the well-regarded TPC-H traces, we are able to
improve the fraction of requests using more reliable
encryption functions by 40-60\%, while meeting
performance targets. In a simulation of qPowServer
employing realistic DVFS parameters, we are able to
improve response times significantly while only
violating specified server-wide power budgets by less
than 5W.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
keywords = "differential service levels; dynamic voltage frequency
scaling; Markov decision process; secure storage",
}
@Article{Chang:2008:AWM,
author = "Chin-Chen Chang and Pei-Yu Lin",
title = "Adaptive watermark mechanism for rightful ownership
protection",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "7",
pages = "1118--1129",
month = jul,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chang:2008:DAP,
author = "Katharine Chang and Kang G. Shin",
title = "Distributed {Authentication} of {Program Integrity
Verification} in {Wireless Sensor Networks}",
journal = j-TISSEC,
volume = "11",
number = "3",
pages = "14:1--14:??",
month = mar,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1341731.1341735",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:50 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Security in wireless sensor networks has become
important as they are being developed and deployed for
an increasing number of applications. The severe
resource constraints in each sensor make it very
challenging to secure sensor networks. Moreover,
sensors are usually deployed in hostile and unattended
environments and hence are susceptible to various
attacks, including node capture, physical tampering,
and manipulation of the sensor program. Park and Shin
[2005] proposed a soft tamper-proofing scheme that
verifies the integrity of the program in each sensor
device, called the program integrity verification
(PIV), in which sensors authenticate PIV servers
(PIVSs) using centralized and trusted third-party
entities, such as authentication servers (ASs). This
article presents a distributed authentication protocol
of PIVSs (DAPP) without requiring the commonly used
ASs. DAPP uses the Blundo scheme [Blundo et al. 1992]
for sensors and PIVSs to establish pairwise keys and
for PIVSs to authenticate one another. We also present
a protocol for PIVSs to cooperatively detect and revoke
malicious PIVSs in the network. We implement and
evaluate both DAPP and PIV on Mica2 Motes and laptops,
showing that DAPP reduces the sensors' communication
traffic in the network by more than 90\% and the energy
consumption on each sensor by up to 85\%, as compared
to the case of using a centralized AS for
authenticating PIVSs. We also analyze the security of
DAPP under various attack models, demonstrating its
capability in dealing with diverse types of attacks.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "distributed authentication; node revocation; program
integrity verification; wireless sensor networks",
}
@Article{Chang:2008:EBD,
author = "Mei-Chu Chang and Chui Zhi Yao",
title = "An Explicit Bound On Double Exponential Sums Related
to {Diffie--Hellman} Distributions",
journal = j-SIAM-J-DISCR-MATH,
volume = "22",
number = "1",
pages = "348--359",
month = "????",
year = "2008",
CODEN = "SJDMEC",
DOI = "https://doi.org/10.1137/070699767",
ISSN = "0895-4801 (print), 1095-7146 (electronic)",
ISSN-L = "0895-4801",
bibdate = "Tue May 18 21:37:06 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SIDMA/22/1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Discrete Mathematics",
journal-URL = "http://epubs.siam.org/sidma",
}
@Article{Chen:2008:BUK,
author = "L. Chen and Q. Tang",
title = "Bilateral Unknown Key-Share Attacks in Key Agreement
Protocols",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "416--440",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/bilateral_unknown_key_share",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Article{Chen:2008:CCS,
author = "L. Chen and W. Susilo and H. Wang and D. S. Wong and
E. Dawson and X. Lai and M. Mambo and A. Miyaji and Y.
Mu and D. Pointcheval and B. Preneel and N. Smart",
title = "Cryptography in Computer System Security",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "314--317",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14;
http://www.jucs.org/jucs_14_3#;
http://www.jucs.org/jucs_14_3/cryptography_in_computer_system",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Chen:2008:CIS,
author = "Wen-Yuan Chen",
title = "Color image steganography scheme using {DFT}, {SPIHT}
codec, and modified differential phase-shift keying
techniques",
journal = j-APPL-MATH-COMP,
volume = "196",
number = "1",
pages = "40--54",
day = "15",
month = feb,
year = "2008",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:10 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chen:2008:MWS,
author = "Wen-Yuan Chen",
title = "Multiple-watermarking scheme of the {European Article
Number Barcode} using similar code division multiple
access technique",
journal = j-APPL-MATH-COMP,
volume = "197",
number = "1",
pages = "243--261",
day = "15",
month = mar,
year = "2008",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Sat Jul 12 09:03:11 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@Article{Chen:2008:NMA,
author = "Yalin Chen and Jue-Sam Chou and Hung-Min Sun",
title = "A novel mutual authentication scheme based on
quadratic residues for {RFID} systems",
journal = j-COMP-NET-AMSTERDAM,
volume = "52",
number = "12",
pages = "2373--2380",
day = "22",
month = aug,
year = "2008",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Chen:2008:OVBa,
author = "Xiaoxin Chen and Tal Garfinkel and E. Christopher
Lewis and Pratap Subrahmanyam and Carl A. Waldspurger
and Dan Boneh and Jeffrey Dwoskin and Dan R. K. Ports",
title = "{Overshadow}: a virtualization-based approach to
retrofitting protection in commodity operating
systems",
journal = j-COMP-ARCH-NEWS,
volume = "36",
number = "1",
pages = "2--13",
month = mar,
year = "2008",
CODEN = "CANED2",
DOI = "https://doi.org/10.1145/1346281.1346284",
ISSN = "0163-5964 (print), 1943-5851 (electronic)",
ISSN-L = "0163-5964",
bibdate = "Tue Jun 17 11:51:35 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Commodity operating systems entrusted with securing
sensitive data are remarkably large and complex, and
consequently, frequently prone to compromise. To
address this limitation, we introduce a
virtual-machine-based system called Overshadow that
protects the privacy and integrity of application data,
even in the event of a total OS compromise. Overshadow
presents an application with a normal view of its
resources, but the OS with an encrypted view. This
allows the operating system to carry out the complex
task of managing an application's resources, without
allowing it to read or modify them. Thus, Overshadow
offers a last line of defense for application
data.\par
Overshadow builds on multi-shadowing, a novel mechanism
that presents different views of 'physical' memory,
depending on the context performing the access. This
primitive offers an additional dimension of protection
beyond the hierarchical protection domains implemented
by traditional operating systems and processor
architectures.\par
We present the design and implementation of Overshadow
and show how its new protection semantics can be
integrated with existing systems. Our design has been
fully implemented and used to protect a wide range of
unmodified legacy applications running on an unmodified
Linux operating system. We evaluate the performance of
our implementation, demonstrating that this approach is
practical.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGARCH Computer Architecture News",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89",
keywords = "cloaking; hypervisors; memory protection;
multi-shadowing; operating systems; virtual machine
monitors; VMM",
}
@Article{Chen:2008:OVBb,
author = "Xiaoxin Chen and Tal Garfinkel and E. Christopher
Lewis and Pratap Subrahmanyam and Carl A. Waldspurger
and Dan Boneh and Jeffrey Dwoskin and Dan R. K. Ports",
title = "{Overshadow}: a virtualization-based approach to
retrofitting protection in commodity operating
systems",
journal = j-OPER-SYS-REV,
volume = "42",
number = "2",
pages = "2--13",
month = mar,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1346281.1346284",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:20:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Commodity operating systems entrusted with securing
sensitive data are remarkably large and complex, and
consequently, frequently prone to compromise. To
address this limitation, we introduce a
virtual-machine-based system called Overshadow that
protects the privacy and integrity of application data,
even in the event of a total OS compromise. Overshadow
presents an application with a normal view of its
resources, but the OS with an encrypted view. This
allows the operating system to carry out the complex
task of managing an application's resources, without
allowing it to read or modify them. Thus, Overshadow
offers a last line of defense for application
data.\par
Overshadow builds on multi-shadowing, a novel mechanism
that presents different views of `physical' memory,
depending on the context performing the access. This
primitive offers an additional dimension of protection
beyond the hierarchical protection domains implemented
by traditional operating systems and processor
architectures.\par
We present the design and implementation of Overshadow
and show how its new protection semantics can be
integrated with existing systems. Our design has been
fully implemented and used to protect a wide range of
unmodified legacy applications running on an unmodified
Linux operating system. We evaluate the performance of
our implementation, demonstrating that this approach is
practical.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "cloaking; hypervisors; memory protection;
multi-shadowing; operating systems; virtual machine
monitors; VMM",
}
@Article{Chen:2008:OVBc,
author = "Xiaoxin Chen and Tal Garfinkel and E. Christopher
Lewis and Pratap Subrahmanyam and Carl A. Waldspurger
and Dan Boneh and Jeffrey Dwoskin and Dan R. K. Ports",
title = "{Overshadow}: a virtualization-based approach to
retrofitting protection in commodity operating
systems",
journal = j-SIGPLAN,
volume = "43",
number = "3",
pages = "2--13",
month = mar,
year = "2008",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1346281.1346284",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 11:03:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Commodity operating systems entrusted with securing
sensitive data are remarkably large and complex, and
consequently, frequently prone to compromise. To
address this limitation, we introduce a
virtual-machine-based system called Overshadow that
protects the privacy and integrity of application data,
even in the event of a total OS compromise. Overshadow
presents an application with a normal view of its
resources, but the OS with an encrypted view. This
allows the operating system to carry out the complex
task of managing an application's resources, without
allowing it to read or modify them. Thus, Overshadow
offers a last line of defense for application
data.\par
Overshadow builds on multi-shadowing, a novel mechanism
that presents different views of 'physical' memory,
depending on the context performing the access. This
primitive offers an additional dimension of protection
beyond the hierarchical protection domains implemented
by traditional operating systems and processor
architectures.\par
We present the design and implementation of Overshadow
and show how its new protection semantics can be
integrated with existing systems. Our design has been
fully implemented and used to protect a wide range of
unmodified legacy applications running on an unmodified
Linux operating system. We evaluate the performance of
our implementation, demonstrating that this approach is
practical.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "cloaking; hypervisors; memory protection;
multi-shadowing; operating systems; virtual machine
monitors; VMM",
}
@Article{Chen:2008:RCE,
author = "Tzung-Her Chen and Wei-Bin Lee and Hsing-Bai Chen",
title = "A round- and computation-efficient three-party
authenticated key exchange protocol",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "9",
pages = "1581--1590",
month = sep,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Chen:2008:SNI,
author = "Chien-Chang Chen and Yu-Wei Chien",
title = "Sharing Numerous Images Secretly with Reduced
Possessing Load",
journal = j-FUND-INFO,
volume = "86",
number = "4",
pages = "447--458",
month = oct,
year = "2008",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:07:17 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Cheon:2008:PST,
author = "Jung Hee Cheon and Nicholas Hopper and Yongdae Kim and
Ivan Osipkov",
title = "Provably {Secure Timed-Release Public Key
Encryption}",
journal = j-TISSEC,
volume = "11",
number = "2",
pages = "4:1--4:??",
month = mar,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1330332.1330336",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:41 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "A timed-release cryptosystem allows a sender to
encrypt a message so that only the intended recipient
can read it only after a specified time. We formalize
the concept of a secure timed-release public-key
cryptosystem and show that, if a third party is relied
upon to guarantee decryption after the specified date,
this concept is equivalent to identity-based
encryption; this explains the observation that all
known constructions use identity-based encryption to
achieve timed-release security. We then give several
provably-secure constructions of timed-release
encryption: a generic scheme based on any
identity-based encryption scheme, and two more
efficient schemes based on the existence of
cryptographically admissible bilinear mappings. The
first of these is essentially as efficient as the
Boneh--Franklin Identity-Based encryption scheme, and
is provably secure and authenticated in the random
oracle model; the final scheme is not authenticated but
is provably secure in the standard model (i. e. ,
without random oracles).",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "authenticated encryption; key-insulated encryption;
timed-release",
}
@Article{Chevalier:2008:CRS,
author = "Yannick Chevalier and Ralf K{\"u}sters and Micha{\"e}l
Rusinowitch and Mathieu Turuani",
title = "Complexity results for security protocols with
{Diffie--Hellman} exponentiation and commuting public
key encryption",
journal = j-TOCL,
volume = "9",
number = "4",
pages = "24:1--24:??",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1380572.1380573",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Fri Aug 29 14:02:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We show that the insecurity problem for protocols with
modular exponentiation and arbitrary products allowed
in exponents is NP-complete. This result is based on a
protocol and intruder model which is powerful enough to
uncover known attacks on the Authenticated Group
Diffie--Hellman (A-GDH.2) protocol suite. To prove our
results, we develop a general framework in which the
Dolev--Yao intruder is extended by generic intruder
rules. This framework is also applied to obtain
complexity results for protocols with commuting public
key encryption.",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
keywords = "algebraic properties; complexity; Diffie--Hellman
exponentiation; Dolev--Yao model; protocols",
}
@Article{Chiang:2008:CPB,
author = "Yung-Kuei Chiang and Piyu Tsai and Feng-Long Huang",
title = "Codebook Partition Based Steganography without Member
Restriction",
journal = j-FUND-INFO,
volume = "82",
number = "1--2",
pages = "15--27",
month = jul,
year = "2008",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:06:23 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chien:2008:EPA,
author = "H. Y. Chien",
title = "Efficient and Practical Approach to Authenticating
Public Terminals",
journal = j-INT-J-COMPUT-APPL,
volume = "30",
number = "4",
pages = "319--324",
year = "2008",
DOI = "https://doi.org/10.1080/1206212X.2008.11441911",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:25:20 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2008.11441911",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "11 Jul 2015",
}
@Article{Chien:2008:PAUa,
author = "Hung-Yu Chien",
title = "Practical anonymous user authentication scheme with
security proof",
journal = j-COMPUT-SECUR,
volume = "27",
number = "5--6",
pages = "216--223",
month = oct,
year = "2008",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:11 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000291",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chien:2008:PAUb,
author = "Hung-Yu Chien",
title = "Practical anonymous user authentication scheme with
security proof",
journal = j-COMPUT-SECUR,
volume = "27",
number = "5--6",
pages = "216--223",
month = oct,
year = "2008",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000291",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chien:2008:PAUc,
author = "Hung-Yu Chien",
title = "Practical anonymous user authentication scheme with
security proof",
journal = j-COMPUT-SECUR,
volume = "27",
number = "5--6",
pages = "216--223",
month = oct,
year = "2008",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000291",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chien:2008:SCA,
author = "Hung-Yu Chien",
title = "Selectively Convertible Authenticated Encryption in
the Random Oracle Model",
journal = j-COMP-J,
volume = "51",
number = "4",
pages = "419--434",
month = jul,
year = "2008",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxm090",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:34 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol51/issue4/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/51/4/419;
http://comjnl.oxfordjournals.org/cgi/content/full/51/4/419;
http://comjnl.oxfordjournals.org/cgi/reprint/51/4/419",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Cho:2008:DNP,
author = "Young H. Cho and William H. Mangione-Smith",
title = "Deep network packet filter design for reconfigurable
devices",
journal = j-TECS,
volume = "7",
number = "2",
pages = "21:1--21:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1331331.1331345",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Jun 12 15:22:00 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Most network routers and switches provide some
protection against the network attacks. However, the
rapidly increasing amount of damages reported over the
past few years indicates the urgent need for tougher
security. Deep-packet inspection is one of the
solutions to capture packets that can not be identified
using the traditional methods. It uses a list of
signatures to scan the entire content of the packet,
providing the means to filter harmful packets out of
the network. Since one signature does not depend on the
other, the filtering process has a high degree of
parallelism. Most software and hardware deep-packet
filters that are in use today execute the tasks under
Von Neuman architecture. Such architecture can not
fully take advantage of the parallelism. For instance,
one of the most widely used network intrusion-detection
systems, Snort, configured with 845 patterns, running
on a dual 1-GHz Pentium III system, can sustain a
throughput of only 50 Mbps. The poor performance is
because of the fact that the processor is programmed to
execute several tasks sequentially instead of
simultaneously. We designed scalable deep-packet
filters on field-programmable gate arrays (FPGAs) to
search for all data-independent patterns
simultaneously. With FPGAs, we have the ability to
reprogram the filter when there are any changes to the
signature set. The smallest full-pattern matcher
implementation for the latest Snort NIDS fits in a
single 400k Xilinx FPGA (Spartan 3-XC3S400) with a
sustained throughput of 1.6 Gbps. Given a larger FPGA,
the design can scale linearly to support a greater
number of patterns, as well as higher data
throughput.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "firewall; network intrusion detection; string filter;
virus; worm",
}
@Article{Choo:2008:PLP,
author = "Kim-Kwang Raymond Choo",
title = "Privacy on the Line: The Politics of Wiretapping and
Encryption, Updated and Expanded Edition",
journal = j-COMP-J,
volume = "51",
number = "6",
pages = "744",
month = nov,
year = "2008",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxn026",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:34 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol51/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/full/51/6/744;
http://comjnl.oxfordjournals.org/cgi/reprint/51/6/744",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@PhdThesis{Chowdhury:2008:CBG,
author = "Milton M. Chowdhury",
title = "Cryptanalysis of braid group based protocols",
type = "Thesis ({MPhil})",
school = "Faculty of Engineering and Physical Sciences,
University of Manchester",
address = "Manchester, UK",
pages = "230",
year = "2008",
bibdate = "Fri May 13 05:55:49 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Chu:2008:EOT,
author = "C.-K. Chu and W.-G. Tzeng",
title = "Efficient $k$-out-of-$n$ Oblivious Transfer Schemes",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "397--415",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/efficient_k_out_of",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Book{Cox:2008:DWS,
author = "I. J. (Ingemar J.) Cox and Matthew L. Miller and
Jeffrey A. Bloom and Jessica Fridrich and Ton Kalker",
title = "Digital Watermarking and Steganography",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
edition = "Second",
pages = "xxviii + 593",
year = "2008",
ISBN = "0-12-372585-2 (casebound)",
ISBN-13 = "978-0-12-372585-1 (casebound)",
LCCN = "QA76.9.A25 C68 2008",
bibdate = "Fri Aug 15 11:29:08 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "The Morgan Kaufmann series in multimedia information
and systems; The Morgan Kaufmann series in computer
security",
URL = "http://www.loc.gov/catdir/enhancements/fy0808/2007040595-d.html;
http://www.loc.gov/catdir/toc/ecip081/2007040595.html",
abstract = "Digital audio, video, images, and documents are flying
through cyberspace to their respective owners.
Unfortunately, along the way, individuals may choose to
intervene and take this content for themselves. Digital
watermarking and steganography technology greatly
reduces the instances of this by limiting or
eliminating the ability of third parties to decipher
the content that he has taken. The many techiniques of
digital watermarking (embedding a code) and
steganography (hiding information) continue to evolve
as applications that necessitate them do the same. The
authors of this second edition provide an update on the
framework for applying these techniques that they
provided researchers and professionals in the first
well-received edition. Steganography and steganalysis
(the art of detecting hidden information) have been
added to a robust treatment of digital watermarking, as
many in each field research and deal with the other.
New material includes watermarking with side
information, QIM, and dirty-paper codes. The revision
and inclusion of new material by these influential
authors has created a must-own book for anyone in this
profession. This new edition now contains essential
information on steganalysis and steganography. New
concepts and new applications including QIM introduced
digital watermark embedding is given a complete update
with new processes and applications.",
acknowledgement = ack-nhfb,
remark = "Prev. ed. entered under Cox.",
subject = "Computer security; Digital watermarking; Data
protection",
tableofcontents = "Cover \\
Contents \\
Preface to the First Edition \\
Preface to the Second Edition \\
Example Watermarking Systems \\
Chapter 1. Introduction \\
1.1 Information Hiding, Steganography, and Watermarking
\\
1.2 History of Watermarking \\
1.3 History of Steganography \\
1.4 Importance of Digital Watermarking \\
1.5 Importance of Steganography \\
Chapter 2. Applications and Properties \\
2.1 Applications of Watermarking \\
2.2 Applications of Steganography \\
2.3 Properties of Watermarking Systems \\
2.4 Evaluating Watermarking Systems \\
2.5 Properties of Steganographic and Steganalysis
Systems \\
2.6 Evaluating and Testing Steganographic Systems \\
2.7 Summary \\
Chapter 3. Models of Watermarking \\
3.1 Notation \\
3.2 Communications \\
3.3 Communication-Based Models of Watermarking \\
3.4 Geometric Models of Watermarking \\
3.5 Modeling Watermark Detection by Correlation \\
3.6 Summary \\
Chapter 4. Basic Message Coding \\
4.1 Mapping Messages into Message Vectors \\
4.2 Error Correction Coding \\
4.3 Detecting Multisymbol Watermarks \\
4.4 Summary \\
Chapter 5. Watermarking with Side Information \\
5.1 Informed Embedding \\
5.2 Watermarking Using Side Information \\
5.3 Dirty-Paper Codes \\
5.4 Summary \\
Chapter 6. Practical Dirty-Paper Codes \\
6.1 Practical Considerations for Dirty-Paper Codes \\
6.2 Broad Approaches to Dirty-Paper Code Design \\
6.3 Implementing DM with A Simple Lattice Code \\
6.4 Typical Tricks in Implementing Lattice Codes \\
6.5 Coding with Better Lattices \\
6.6 Making Lattice Codes Survive Valumetric Scaling \\
6.7 Dirty-Paper Trellis Codes \\
6.8 Summary \\
Chapter 7. Analyzing Errors \\
7.1 Message Errors \\
7.2 False Positive Errors \\
7.3 False Negative Errors \\
7.4 ROC Curves \\
7.5 The Effect of Whitening on Error Rates \\
7.6 Analysis of Normalized Correlation \\
7.7 Summary \\
Chapter 8. Using Perceptual Models \\
8.1 Evaluating Perceptual Impact of Watermarks \\
8.2 General Form of A Perceptual Model \\
8.3 Two Examples of Perceptual Models \\
8.4 Perceptually Adaptive Watermarking \\
8.5 Summary \\
Chapter 9. Robust Watermarking \\
9.1 Approaches \\
9.2 Robustness to Valumetric Distortions \\
9.3 Robustness to Temporal and Geometric Distortions
\\
9.4 Summary \\
Chapter 10. Watermark Security \\
10.1 Security Requirements \\
10.2 Watermark Security and Cryptography \\
10.3 Some Significant Known Attacks \\
10.4 Summary \\
Chapter 11. Content Authentication \\
11.1 Exact Authentication \\
11.2 Selective Authentication \\
11.3 Localization \\
11.4 Restoration \\
11.5 Summary \\
Chapter 12. Steganography \\
12.1 Steganographic Communication \\
12.2 Notation and Terminology \\
12.3 Information-Theoretic Foundations of Steganography
\\
12.4 Practical Steganographic Methods \\
12.5 Minimizing the Embedding Impact \\
12.6 Summary \\
Chapter 13. Steganalysis \\
13.1 Steganalysis Scenarios \\
13.2 Some Significant Steganographic Algorithms \\
13.3 Summary \\
Appendix A: Background concepts \\
A.1 Information Theory \\
A.2 Coding Theory \\
A.3 Cryptography \\
Appendix B: Selected Theoretical Results \\
B.1 Information-theoretic Analysis of Watermarking
(Moulin and O'Sullivan) \\
B.2 Error Probabilites Uising Normalized Correlation
Detectors (Miller and Bloom) \\
B.3 Effect of Quantization Noise on Watermarks (Eggers
and Girod) \\
Appendix C: Notation and Common Variables \\
Glossary \\
References \\
Index \\
About the Authors",
}
@InProceedings{Czeskis:2008:DED,
author = "Alexei Czeskis and David J. {St. Hilaire} and Karl
Koscher and Steven D. Gribble and Tadayoshi Kohno and
Bruce Schneier",
editor = "????",
booktitle = "{Proceedings of the 3rd Conference on Hot Topics in
Security, 2008}",
title = "Defeating encrypted and deniable file systems:
{Truecrypt V5}.1a and the case of the tattling {OS} and
applications",
publisher = "????",
address = "????",
pages = "??--??",
year = "2008",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:45:43 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 21]{Schneier:2015:SWC}.",
}
@Article{Damgaard:2008:CBQ,
author = "Ivan B. Damg{\aa}rd and Serge Fehr and Louis Salvail
and Christian Schaffner",
title = "Cryptography in the Bounded-Quantum-Storage Model",
journal = j-SIAM-J-COMPUT,
volume = "37",
number = "6",
pages = "1865--1890",
month = "????",
year = "2008",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:53 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/37/6;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Das:2008:BQC,
author = "S. R. Das",
title = "Breaking Quantum Cryptography's 150-Kilometer Limit
[Update]",
journal = j-IEEE-SPECTRUM,
volume = "45",
number = "9",
pages = "15--15",
month = sep,
year = "2008",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2008.4607918",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Dielectric substrates; Glass;
International Space Station; Lead compounds;
Microelectronics; Quantum entanglement; Satellites;
Space stations; Temperature",
}
@InProceedings{Delaune:2008:FAP,
author = "St{\'e}phanie Delaune and Steve Kremer and Graham
Steel",
editor = "????",
booktitle = "{IEEE Computer Security Foundations Symposium}",
title = "Formal analysis of {PKCS\#11}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "331--344",
year = "2008",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:49:05 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 25]{Schneier:2015:SWC}.",
}
@Article{denHartog:2008:TMC,
author = "Jerry den Hartog",
title = "Towards mechanized correctness proofs for
cryptographic algorithms: {Axiomatization} of a
probabilistic {Hoare} style logic",
journal = j-SCI-COMPUT-PROGRAM,
volume = "74",
number = "1--2",
pages = "52--63",
day = "1",
month = dec,
year = "2008",
CODEN = "SCPGD4",
ISSN = "0167-6423 (print), 1872-7964 (electronic)",
ISSN-L = "0167-6423",
bibdate = "Fri Apr 1 18:39:23 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01676423",
acknowledgement = ack-nhfb,
fjournal = "Science of Computer Programming",
journal-URL = "http://www.sciencedirect.com/science/journal/01676423",
}
@Book{Dewson:2008:BSS,
author = "Robin Dewson",
title = "Beginning {SQL Server 2008} for developers: from
novice to professional; [the quick and efficient path
to proficiency in {SQL Server 2008}]",
publisher = pub-APRESS,
address = pub-APRESS:adr,
pages = "xxiv + 471",
year = "2008",
DOI = "https://doi.org/10.1007/978-1-4302-0584-5",
ISBN = "1-59059-958-6",
ISBN-13 = "978-1-59059-958-7",
LCCN = "????",
bibdate = "Tue Oct 28 16:10:58 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
series = "The expert's voice in SQL Server",
acknowledgement = ack-nhfb,
subject = "Data structures (Computer science); Computer Science;
Data Structures, Cryptology and Information Theory",
}
@Article{Dimitrov:2008:DBN,
author = "Vassil Dimitrov and Laurent Imbert and Pradeep K.
Mishra",
title = "The double-base number system and its application to
elliptic curve cryptography",
journal = j-MATH-COMPUT,
volume = "77",
number = "262",
pages = "1075--1104",
month = apr,
year = "2008",
CODEN = "MCMPAF",
ISSN = "0025-5718 (print), 1088-6842 (electronic)",
ISSN-L = "0025-5718",
bibdate = "Tue Jul 8 06:24:28 MDT 2008",
bibsource = "http://www.ams.org/mcom/2008-77-262;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.ams.org/mcom/2008-77-262/S0025-5718-07-02048-0/home.html;
http://www.ams.org/mcom/2008-77-262/S0025-5718-07-02048-0/S0025-5718-07-02048-0.dvi;
http://www.ams.org/mcom/2008-77-262/S0025-5718-07-02048-0/S0025-5718-07-02048-0.pdf;
http://www.ams.org/mcom/2008-77-262/S0025-5718-07-02048-0/S0025-5718-07-02048-0.ps",
acknowledgement = ack-nhfb,
fjournal = "Mathematics of Computation",
journal-URL = "http://www.ams.org/mcom/",
}
@TechReport{Dinur:2008:CAT,
author = "Itai Dinur and Adi Shamir",
title = "Cube Attacks on Tweakable Black Box Polynomials",
type = "Technical report",
institution = "Computer Science Department, The Weizmann Institute",
address = "Rehobot 76100, Israel",
day = "13",
month = sep,
year = "2008",
bibdate = "Tue Jan 13 13:46:55 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://cryptome.org/cube-attacks.pdf",
abstract = "Almost any cryptographic scheme can be described by
tweakable polynomials over GF(2), which contain both
secret variables (e.g., key bits) and public variables
(e.g., plaintext bits or IV bits). The cryptanalyst is
allowed to tweak the polynomials by choosing arbitrary
values for the public variables, and his goal is to
solve the resultant system of polynomial equations in
terms of their common secret variables. In this paper
we develop a new technique (called a cube attack) for
solving such tweakable polynomials, which is a major
improvement over several previously published attacks
of the same type. For example, on the stream cipher
Trivium with a reduced number of initialization rounds,
the best previous attack (due to Fischer, Khazaei, and
Meier) requires a barely practical complexity of 255 to
attack 672 initialization rounds, whereas a cube attack
can find the complete key of the same variant in 219
bit operations (which take less than a second on a
single PC). Trivium with 735 initialization rounds
(which could not be attacked by any previous technique)
can now be broken with 230 bit operations, and by
extrapolating our experimentally verified complexities
for various sizes, we have reasons to believe that cube
attacks will remain faster than exhaustive search even
for 1024 initialization rounds. Whereas previous
attacks were heuristic, had to be adapted to each
cryptosystem, had no general complexity bounds, and
were not expected to succeed on random looking
polynomials, cube attacks are provably successful when
applied to random polynomials of degree $d$ over $n$
secret variables whenever the number $m$ of public
variables exceeds $ d + \log_d n $. Their complexity is
$ 2^{d - 1n} + n^2 $ bit operations, which is
polynomial in $n$ and amazingly low when $d$ is small.
Cube attacks can be applied to any block cipher, stream
cipher, or MAC which is provided as a black box (even
when nothing is known about its internal structure) as
long as at least one output bit can be represented by
(an unknown) polynomial of relatively low degree in the
secret and public variables. In particular, they can be
easily and automatically combined with any type of side
channel attack that leaks some partial information
about the early stages of the encryption process (which
can typically be represented by a very low degree
polynomial), such as the Hamming weight of a byte
written into a register.",
acknowledgement = ack-nhfb,
keywords = "algebraic attacks; cryptanalysis; cube attacks; side
channel attacks; stream ciphers; Trivium; tweakable
black box polynomials",
}
@Article{Dodis:2008:OFE,
author = "Y. Dodis and P. J. Lee and D. H. Yum",
title = "Optimistic Fair Exchange in a Multi-user Setting",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "318--346",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/optimistic_fair_exchange_in",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@InProceedings{Drutarovsky:2008:CSC,
author = "M. Drutarovsky and M. Varchola",
booktitle = "{2008. DDECS 2008. 11th IEEE Workshop on Design and
Diagnostics of Electronic Circuits and Systems}",
title = "Cryptographic System on a Chip based on {Actel ARM7}
Soft-Core with Embedded True Random Number Generator",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--6",
year = "2008",
DOI = "https://doi.org/10.1109/DDECS.2008.4538778",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4538778",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4534845",
}
@Article{Dujella:2008:VWA,
author = "Andrej Dujella",
title = "A variant of {Wiener}'s attack on {RSA} with small
secret exponent",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "50--51",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394065",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
keywords = "cryptography",
}
@Article{Dunkelman:2008:TIV,
author = "Orr Dunkelman and Nathan Keller",
title = "Treatment of the initial value in {Time-Memory-Data
Tradeoff} attacks on stream ciphers",
journal = j-INFO-PROC-LETT,
volume = "107",
number = "5",
pages = "133--137",
day = "16",
month = aug,
year = "2008",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:08 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Dziembowski:2008:LRC,
author = "S. Dziembowski and K. Pietrzak",
title = "Leakage-Resilient Cryptography",
crossref = "IEEE:2008:PAI",
pages = "293--302",
year = "2008",
DOI = "https://doi.org/10.1109/FOCS.2008.56",
bibdate = "Thu Apr 12 09:33:24 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923",
}
@Article{Elbirt:2008:AAI,
author = "A. J. Elbirt",
title = "Accelerated {AES} implementations via generalized
instruction set extensions",
journal = j-J-COMP-SECUR,
volume = "16",
number = "3",
pages = "265--288",
month = "????",
year = "2008",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2008-16302",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:56 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Elmallah:2008:LK,
author = "Ehab S. Elmallah and Mohamed G. Gouda and Sandeep S.
Kulkarni",
title = "Logarithmic keying",
journal = j-TAAS,
volume = "3",
number = "4",
pages = "18:1--18:??",
month = nov,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1452001.1452008",
ISSN = "1556-4665 (print), 1556-4703 (electronic)",
bibdate = "Fri Apr 24 17:35:25 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Consider a communication network where each process
needs to securely exchange messages with its
neighboring processes. In this network, each sent
message is encrypted using one or more symmetric keys
that are shared only between two processes: the process
that sends the message and the neighboring process that
receives the message. A straightforward scheme for
assigning symmetric keys to the different processes in
such a network is to assign each process {\em O\/}
({\em d\/}) keys, where {\em d\/} is the maximum number
of neighbors of any process in the network. In this
article, we present a more efficient scheme for
assigning symmetric keys to the different processes in
a communication network. This scheme, which is referred
to as logarithmic keying, assigns {\em O\/} (log {\em
d\/}) symmetric keys to each process in the network. We
show that logarithmic keying can be used in rich
classes of communication networks that include star
networks, acyclic networks, limited-cycle networks,
planar networks, and dense bipartite networks. In
addition, we present a construction that utilizes
efficient keying schemes for general bipartite networks
to construct efficient keying schemes for general
networks.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Autonomous and Adaptive Systems
(TAAS)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010",
keywords = "keying scheme; secure communications; symmetric keys",
}
@Book{Erickson:2008:HAE,
author = "Jon Erickson",
title = "Hacking: the art of exploitation",
publisher = pub-NO-STARCH,
address = pub-NO-STARCH:adr,
edition = "Second",
pages = "x + 472",
year = "2008",
ISBN = "1-59327-144-1",
ISBN-13 = "978-1-59327-144-2",
LCCN = "QA76.9.A25 E75 2008",
bibdate = "Wed Apr 30 17:57:44 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "http://proquest.safaribooksonline.com/9781593271442",
abstract = "Hacking is the art of creative problem solving,
whether that means finding an unconventional solution
to a difficult problem or exploiting holes in sloppy
programming. Rather than merely showing how to run
existing exploits, Hacking: The Art of Exploitation,
2nd Edition author Jon Erickson explains how arcane
hacking techniques actually work. Using the included
Ubuntu LiveCD, get your hands dirty debugging code,
overflowing buffers, hijacking network communications,
bypassing protections, exploiting cryptographic
weaknesses, and perhaps even inventing new exploits.",
acknowledgement = ack-nhfb,
subject = "computer security; computer hackers; computer
networks; security measures",
tableofcontents = "1. Introduction \\
2. Programming \\
3. Exploitation \\
4. Networking \\
5. Shellcode \\
6. Countermeasures \\
7. Cryptology \\
8. Conclusion",
}
@Article{Fan:2008:RSB,
author = "Ming-Quan Fan and Hong-Xia Wang and Sheng-Kun Li",
title = "Restudy on {SVD}-based watermarking scheme",
journal = j-APPL-MATH-COMP,
volume = "203",
number = "2",
pages = "926--930",
day = "15",
month = sep,
year = "2008",
CODEN = "AMHCBQ",
ISSN = "0096-3003 (print), 1873-5649 (electronic)",
ISSN-L = "0096-3003",
bibdate = "Fri Sep 3 10:53:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00963003",
acknowledgement = ack-nhfb,
fjournal = "Applied Mathematics and Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/00963003",
}
@InProceedings{Fortnow:2008:IIC,
author = "Lance Fortnow and Rahul Santhanam",
title = "Infeasibility of instance compression and succinct
{PCPs} for {NP}",
crossref = "ACM:2008:SPA",
pages = "133--142",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374398",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The OR-SAT problem asks, given Boolean formulae $
\Phi_1, \ldots {}, \Phi_m $ each of size at most $n$,
whether at least one of the $ \Phi_i$'s is satisfiable.
We show that there is no reduction from OR-SAT to any
set A where the length of the output is bounded by a
polynomial in $n$, unless NP $ \subseteq $ coNP/poly,
and the Polynomial-Time Hierarchy collapses. This
result settles an open problem proposed by Bodlaender
et. al. [4] and Harnik and Naor [15] and has a number
of implications. A number of parametric NP problems,
including Satisfiability, Clique, Dominating Set and
Integer Programming, are not instance compressible or
polynomially kernelizable unless NP $ \subseteq $
coNP/poly. Satisfiability does not have PCPs of size
polynomial in the number of variables unless NP $
\subseteq $ coNP/poly. An approach of Harnik and Naor
to constructing collision-resistant hash functions from
one-way functions is unlikely to be viable in its
present form. (Buhrman-Hitchcock) There are no
subexponential-size hard sets for NP unless NP is in
co-NP/poly. We also study probabilistic variants of
compression, and show various results about and
connections between these variants. To this end, we
introduce a new strong derandomization hypothesis, the
Oracle Derandomization Hypothesis, and discuss how it
relates to traditional derandomization assumptions.",
acknowledgement = ack-nhfb,
keywords = "cryptography; instance compression; parameterized
complexity; polynomial hierarchy; succinct PCPs",
}
@Article{Fournet:2008:CSI,
author = "C{\'e}dric Fournet and Tamara Rezk",
title = "Cryptographically sound implementations for typed
information-flow security",
journal = j-SIGPLAN,
volume = "43",
number = "1",
pages = "323--335",
month = jan,
year = "2008",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1328897.1328478",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 11:02:13 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In language-based security, confidentiality and
integrity policies conveniently specify the permitted
flows of information between different parts of a
program with diverse levels of trust. These policies
enable a simple treatment of security, and they can
often be verified by typing. However, their enforcement
in concrete systems involves delicate compilation
issues.\par
We consider cryptographic enforcement mechanisms for
imperative programs with untrusted components. Such
programs may represent, for instance, distributed
systems connected by some untrusted network. In source
programs, security depends on an abstract
access-control policy for reading and writing the
shared memory. In their implementations, shared memory
is unprotected and security depends instead on
encryption and signing.\par
We build a translation from well-typed source programs
and policies to cryptographic implementations. To
establish its correctness, we develop a type system for
the target language. Our typing rules enforce a correct
usage of cryptographic primitives against active
adversaries; from an information-flow viewpoint, they
capture controlled forms of robust declassification and
endorsement. We show type soundness for a variant of
the non-interference property, then show that our
translation preserves typeability.\par
We rely on concrete primitives and hypotheses for
cryptography, stated in terms of probabilistic
polynomial-time algorithms and games. We model these
primitives as commands in our target language. Thus, we
develop a uniform language-based model of security,
ranging from computational non-interference for
probabilistic programs down to standard cryptographic
hypotheses.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "compilers; computational model; confidentiality;
cryptography; integrity; non-interference;
probabilistic programs; secure information flow; type
systems",
}
@Article{Galindo:2008:ICB,
author = "David Galindo and Paz Morillo and Carla R{\`a}fols",
title = "Improved certificate-based encryption in the standard
model",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "7",
pages = "1218--1226",
month = jul,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Galindo:2008:SPK,
author = "David Galindo and Javier Herranz",
title = "On the security of public key cryptosystems with a
double decryption mechanism",
journal = j-INFO-PROC-LETT,
volume = "108",
number = "5",
pages = "279--283",
day = "15",
month = nov,
year = "2008",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:16 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Gambino:2008:ITW,
author = "Nicola Gambino and Richard Garner",
title = "The identity type weak factorisation system",
journal = j-THEOR-COMP-SCI,
volume = "409",
number = "1",
pages = "94--109",
day = "6",
month = dec,
year = "2008",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:44 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Ganeriwal:2008:STS,
author = "Saurabh Ganeriwal and Christina P{\"o}pper and Srdjan
{\v{C}}apkun and Mani B. Srivastava",
title = "Secure Time Synchronization in Sensor Networks",
journal = j-TISSEC,
volume = "11",
number = "4",
pages = "23:1--23:??",
month = jul,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1380564.1380571",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Aug 5 19:37:22 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Time synchronization is critical in sensor networks at
many layers of their design. It enables better
duty-cycling of the radio, accurate and secure
localization, beamforming, and other collaborative
signal processing tasks. These benefits make
time-synchronization protocols a prime target of
malicious adversaries who want to disrupt the normal
operation of a sensor network. In this article, we
analyze attacks on existing time synchronization
protocols for wireless sensor networks and we propose a
secure time synchronization toolbox to counter these
attacks. This toolbox includes protocols for secure
pairwise and group synchronization of nodes that either
lie in the neighborhood of each other or are separated
by multiple hops. We provide an in-depth analysis of
the security and the energy overhead of the proposed
protocols. The efficiency of these protocols has been
tested through an experimental study on Mica2 motes.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "delay; message authentication code; sensor networks;
time synchronization",
}
@Article{Ganti:2008:PAL,
author = "Ashwin Ganti",
title = "{Plan 9} authentication in {Linux}",
journal = j-OPER-SYS-REV,
volume = "42",
number = "5",
pages = "27--33",
month = jul,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1400097.1400101",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Wed Aug 6 16:54:12 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/linux.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
https://www.math.utah.edu/pub/tex/bib/plan9.bib;
https://www.math.utah.edu/pub/tex/bib/unix.bib",
abstract = "In Linux, applications like su and login currently run
as root in order to access authentication information
and set or alter the identity of the process. In such
cases, if the application is compromised while running
as a privileged user, the entire system can become
vulnerable. An alternative approach is taken by the
Plan 9 operating system from Bell Labs, which runs such
applications as a non-privileged user and relies on a
kernel-based capability device working in coordination
with an authentication server to provide the same
services. This avoids the risk of an application
vulnerability becoming a system vulnerability.\par
This paper discusses the extension of Linux
authentication mechanisms to allow the use of the Plan
9 approach with existing Linux applications in order to
reduce the security risks mentioned earlier. It
describes the port of the Plan 9 capability device as a
character device driver for the Linux kernel. It also
describes the port of the Plan 9 authentication server
and the implementation of a PAM module which allows the
use of these new facilities. {\em It is now possible to
restrain processes like login and su from the
uncontrolled setuid bit and make them run on behalf of
an unprivileged user in Linux}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J597",
keywords = "authentication",
}
@Article{Gassend:2008:CPR,
author = "Blaise Gassend and Marten {Van Dijk} and Dwaine Clarke
and Emina Torlak and Srinivas Devadas and Pim Tuyls",
title = "Controlled physical random functions and
applications",
journal = j-TISSEC,
volume = "10",
number = "4",
pages = "3:1--3:??",
month = jan,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1284680.1284683",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:24 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "The cryptographic protocols that we use in everyday
life rely on the secure storage of keys in consumer
devices. Protecting these keys from invasive attackers,
who open a device to steal its key, is a challenging
problem. We propose controlled physical random
functions (CPUFs) as an alternative to storing keys and
describe the core protocols that are needed to use
CPUFs. A physical random functions (PUF) is a physical
system with an input and output. The functional
relationship between input and output looks like that
of a random function. The particular relationship is
unique to a specific instance of a PUF, hence, one
needs access to a particular PUF instance to evaluate
the function it embodies. The cryptographic
applications of a PUF are quite limited unless the PUF
is combined with an algorithm that limits the ways in
which the PUF can be evaluated; this is a CPUF. A major
difficulty in using CPUFs is that you can only know a
small set of outputs of the PUF---the unknown outputs
being unrelated to the known ones. We present protocols
that get around this difficulty and allow a chain of
trust to be established between the CPUF manufacturer
and a party that wishes to interact securely with the
PUF device. We also present some elementary
applications, such as certified execution.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "certified execution; physical random function;
physical security; physical unclonable function;
trusted computing",
}
@Article{Gaubatz:2008:SCD,
author = "G. Gaubatz and E. Savas and B. Sunar",
title = "Sequential Circuit Design for Embedded Cryptographic
Applications Resilient to Adversarial Faults",
journal = j-IEEE-TRANS-COMPUT,
volume = "57",
number = "1",
pages = "126--138",
month = jan,
year = "2008",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2007.70784",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 12:17:39 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4358236",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@InProceedings{Gavinsky:2008:CIC,
author = "Dmitry Gavinsky",
title = "Classical interaction cannot replace a quantum
message",
crossref = "ACM:2008:SPA",
pages = "95--102",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374393",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We demonstrate a two-player communication problem that
can be solved in the one-way quantum model by a 0-error
protocol of cost $ O(\log n) $ but requires
exponentially more communication in the classical
interactive (bounded error) model.",
acknowledgement = ack-nhfb,
keywords = "communication complexity; quantum",
}
@Article{Gebotys:2008:EAW,
author = "Catherine H. Gebotys and Brian A. White",
title = "{EM} analysis of a wireless {Java}-based {PDA}",
journal = j-TECS,
volume = "7",
number = "4",
pages = "44:1--44:??",
month = jul,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1376804.1376812",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Aug 5 19:32:59 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "The susceptibility of wireless portable devices to
electromagnetic (EM) attacks is largely unknown. If
analysis of electromagnetic (EM) waves emanating from
the wireless device during a cryptographic computation
do leak sufficient information, it may be possible for
an attacker to reconstruct the secret key. Possession
of the secret cryptographic key would render all future
wireless communications insecure and cause further
potential problems, such as identity theft. Despite the
complexities of a PDA wireless device, such as
operating system events, interrupts, cache misses, and
other interfering events, this article demonstrates
that, for the first time, repeatable EM differential
attacks are possible. The proposed differential
analysis methodology involves precharacterization of
the PDA device (thresholding and pattern recognition),
and a new frequency-based differential analysis. Unlike
previous research, the new methodology does not require
perfect alignment of EM frames and is repeatable in the
presence of a complex embedded system (including cache
misses, operating system events, etc), thus supporting
attacks on real embedded systems. This research is
important for future wireless embedded systems, which
will increasingly demand higher levels of security.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "countermeasures; EM analysis; power attacks;
Side-channel analysis",
}
@Article{Geng:2008:DSA,
author = "Xiutang Geng and Linqiang Pan and Jin Xu",
title = "A {DNA} sticker algorithm for bit-substitution in a
block cipher",
journal = j-J-PAR-DIST-COMP,
volume = "68",
number = "9",
pages = "1201--1206",
month = sep,
year = "2008",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Wed Sep 1 16:27:22 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/07437315",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@InProceedings{Gentry:2008:THL,
author = "Craig Gentry and Chris Peikert and Vinod
Vaikuntanathan",
title = "Trapdoors for hard lattices and new cryptographic
constructions",
crossref = "ACM:2008:SPA",
pages = "197--206",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374407",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We show how to construct a variety of `trapdoor'
cryptographic tools assuming the worst-case hardness of
standard lattice problems (such as approximating the
length of the shortest nonzero vector to within certain
polynomial factors). Our contributions include a new
notion of trapdoor function with preimage sampling,
simple and efficient `hash-and-sign' digital signature
schemes, and identity-based encryption. A core
technical component of our constructions is an
efficient algorithm that, given a basis of an arbitrary
lattice, samples lattice points from a discrete
Gaussian probability distribution whose standard
deviation is essentially the length of the longest
Gram--Schmidt vector of the basis. A crucial security
property is that the output distribution of the
algorithm is oblivious to the particular geometry of
the given basis.",
acknowledgement = ack-nhfb,
keywords = "lattice-based cryptography; trapdoor functions",
}
@Article{Goldberg:2008:PQM,
author = "Sharon Goldberg and David Xiao and Eran Tromer and
Boaz Barak and Jennifer Rexford",
title = "Path-quality monitoring in the presence of
adversaries",
journal = j-SIGMETRICS,
volume = "36",
number = "1",
pages = "193--204",
month = jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1384529.1375480",
ISSN = "0163-5999 (print), 1557-9484 (electronic)",
ISSN-L = "0163-5999",
bibdate = "Fri Jun 27 09:43:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Edge networks connected to the Internet need effective
monitoring techniques to drive routing decisions and
detect violations of Service Level Agreements (SLAs).
However, existing measurement tools, like ping,
traceroute, and trajectory sampling, are vulnerable to
attacks that can make a path look better than it really
is. In this paper, we design and analyze path-quality
monitoring protocols that reliably raise an alarm when
the packet-loss rate and delay exceed a threshold, even
when an adversary tries to bias monitoring results by
selectively delaying, dropping, modifying, injecting,
or preferentially treating packets.\par
Despite the strong threat model we consider in this
paper, our protocols are efficient enough to run at
line rate on high-speed routers. We present a secure
sketching protocol for identifying when packet loss and
delay degrade beyond a threshold. This protocol is
extremely lightweight, requiring only 250-600 bytes of
storage and periodic transmission of a comparably sized
IP packet to monitor billions of packets. We also
present secure sampling protocols that provide faster
feedback and accurate round-trip delay estimates, at
the expense of somewhat higher storage and
communication costs. We prove that all our protocols
satisfy a precise definition of secure path-quality
monitoring and derive analytic expressions for the
trade-off between statistical accuracy and system
overhead. We also compare how our protocols perform in
the client-server setting, when paths are asymmetric,
and when packet marking is not permitted.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMETRICS Performance Evaluation Review",
journal-URL = "http://portal.acm.org/toc.cfm?id=J618",
keywords = "cryptography; path-quality monitoring; sampling;
sketching",
}
@Book{Goldstein:2008:BHO,
author = "Emmanuel Goldstein",
title = "The best of 2600: a hacker odyssey",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xvi + 871",
year = "2008",
ISBN = "0-470-29419-1 (cloth)",
ISBN-13 = "978-0-470-29419-2 (cloth)",
LCCN = "QA76.9.A25 G643 2008",
bibdate = "Wed Feb 17 16:56:18 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "http://www.loc.gov/catdir/enhancements/fy0833/2008018567-d.html;
http://www.loc.gov/catdir/enhancements/fy0833/2008018567-t.html",
acknowledgement = ack-nhfb,
subject = "computer security; history; computer crimes; computer
hackers; telecommunication; security measures;
wiretapping",
}
@InProceedings{Goldwasser:2008:CAP,
author = "Shafi Goldwasser and Dan Gutfreund and Alexander Healy
and Tali Kaufman and Guy N. Rothblum",
title = "A (de)constructive approach to program checking",
crossref = "ACM:2008:SPA",
pages = "143--152",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374399",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Program checking, program self-correcting and program
self-testing were pioneered by [Blum and Kannan] and
[Blum, Luby and Rubinfeld] in the mid eighties as a new
way to gain confidence in software, by considering
program correctness on an input by input basis rather
than full program verification. Work in the field of
program checking focused on designing, for specific
functions, checkers, testers and correctors which are
more efficient than the best program known for the
function. These were designed utilizing specific
algebraic, combinatorial or completeness properties of
the function at hand. In this work we introduce a novel
composition methodology for improving the efficiency of
program checkers. We use this approach to design a
variety of program checkers that are provably more
efficient, in terms of circuit depth, than the optimal
program for computing the function being checked.
Extensions of this methodology for the cases of program
testers and correctors are also presented. In
particular, we show: For all $ i \geq 1 $, every
language in RNC$^i$ (that is NCO-hard under
NCZ-reductions) has a program checker in RNC$^{i - 1}$.
In addition, for all $ i \geq 1 $, every language in
RNC$^i$ (that is NCO-hard under ACZ-reductions) has a
program corrector, tester and checker in RAC$^{i - 1}$.
This is the first time checkers are designed for a wide
class of functions characterized only by its
complexity, rather than by algebraic or combinatorial
properties. This characterization immediately yields
new and efficient checkers for languages such as graph
connectivity, perfect matching and bounded-degree graph
isomorphism. Constant-depth checkers, testers and
correctors for matrix multiplication, inversion,
determinant and rank. All previous program checkers,
testers and correctors for these problems run in nearly
logarithmic depth. Moreover, except for matrix
multiplication, they all require the use of the library
notion of [Blum-Luby-Rubinfeld], in which checkers have
access to a library of programs for various matrix
functions, rather than only having access to a program
for the function being checked. Furthermore, we provide
conditions under which program libraries can be
eliminated. Important ingredients in these results are
new and very efficient checkers for complete languages
in low complexity classes (e.g. NCO). These
constructions are based on techniques that were
developed in the field of cryptography.",
acknowledgement = ack-nhfb,
keywords = "program checking; program correcting; program
testing",
}
@Article{Golle:2008:DCS,
author = "Philippe Golle and Frank McSherry and Ilya Mironov",
title = "Data Collection with Self-Enforcing Privacy",
journal = j-TISSEC,
volume = "12",
number = "2",
pages = "9:1--9:??",
month = dec,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1455518.1455521.",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Dec 23 11:58:14 MST 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Consider a pollster who wishes to collect private,
sensitive data from a number of distrustful
individuals. How might the pollster convince the
respondents that it is trustworthy? Alternately, what
mechanism could the respondents insist upon to ensure
that mismanagement of their data is detectable and
publicly demonstrable?\par
We detail this problem, and provide simple data
submission protocols with the properties that a)
leakage of private data by the pollster results in
evidence of the transgression and b) the evidence
cannot be fabricated without breaking cryptographic
assumptions. With such guarantees, a responsible
pollster could post a ``privacy-bond,'' forfeited to
anyone who can provide evidence of leakage. The
respondents are assured that appropriate penalties are
applied to a leaky pollster, while the protection from
spurious indictment ensures that any honest pollster
has no disincentive to participate in such a scheme.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "data collection; privacy",
}
@Article{Goodrich:2008:NFI,
author = "Michael T. Goodrich and Roberto Tamassia and Danfeng
(Daphne) Yao",
title = "Notarized federated {ID} management and
authentication",
journal = j-J-COMP-SECUR,
volume = "16",
number = "4",
pages = "399--418",
month = "????",
year = "2008",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2008-0324",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:59 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Gordon:2008:CFS,
author = "Dov S. Gordon and Hazay Carmit and Jonathan Katz and
Yehuda Lindell",
title = "Complete fairness in secure two-party computation",
crossref = "ACM:2008:SPA",
pages = "413--422",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374436",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.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 that if either party
receives its output, then the other party does too.
Cleve (STOC 1986) showed that complete fairness cannot
be achieved in general in the two-party setting;
specifically, he showed (essentially) that it is
impossible to compute Boolean XOR with complete
fairness. Since his work, the accepted folklore has
been that nothing non-trivial can be computed with
complete fairness, and the question of complete
fairness in secure two-party computation has been
treated as closed since the late '80s.\par
In this paper, we demonstrate that this widely held
folklore belief is false by showing completely-fair
secure protocols for various non-trivial two-party
functions including Boolean AND/OR as well as Yao's
`millionaires' problem'. Surprisingly, we show that it
is even possible to construct completely-fair protocols
for certain functions containing an `embedded XOR',
although in this case we also prove a lower bound
showing that a super-logarithmic number of rounds are
necessary. Our results demonstrate that the question of
completely-fair secure computation without an honest
majority is far from closed.",
acknowledgement = ack-nhfb,
keywords = "cryptography; fairness; secure computation",
}
@Article{Guneysu:2008:CC,
author = "T. Guneysu and T. Kasper and M. Novotny and C. Paar
and A. Rupp",
title = "Cryptanalysis with {COPACOBANA}",
journal = j-IEEE-TRANS-COMPUT,
volume = "57",
number = "11",
pages = "1498--1513",
month = nov,
year = "2008",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.80",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 12:17:44 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4515858",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Guneysu:2008:SPH,
author = "Tim G{\"u}neysu and Christof Paar and Jan Pelzl",
title = "Special-Purpose Hardware for Solving the Elliptic
Curve Discrete Logarithm Problem",
journal = j-TRETS,
volume = "1",
number = "2",
pages = "8:1--8:??",
month = jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1371579.1371580",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Tue Nov 4 17:12:42 MST 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The resistance against powerful index-calculus attacks
makes Elliptic Curve Cryptosystems (ECC) an interesting
alternative to conventional asymmetric cryptosystems,
like RSA. Operands in ECC require significantly less
bits at the same level of security, resulting in a
higher computational efficiency compared to RSA. With
growing computational capabilities and continuous
technological improvements over the years, however, the
question of the security of ECC against attacks based
on special-purpose hardware arises. In this context,
recently emerged low-cost FPGAs demand for attention in
the domain of hardware-based cryptanalysis: the
extraordinary efficiency of modern programmable
hardware devices allow for a low-budget implementation
of hardware-based ECC attacks---without the requirement
of the expensive development of ASICs.\par
With focus on the aspect of cost-efficiency, this
contribution presents and analyzes an FPGA-based
architecture of an attack against ECC over prime
fields. A multi-processing hardware architecture for
Pollard's Rho method is described. We provide results
on actually used key lengths of ECC (128 bits and
above) and estimate the expected runtime for a
successful attack.\par
As a first result, currently used elliptic curve
cryptosystems with a security of 160 bit and above turn
out to be infeasible to break with available
computational and financial resources. However, some of
the security standards proposed by the Standards for
Efficient Cryptography Group (SECG) become subject to
attacks based on low-cost FPGAs.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "cryptanalysis; discrete logarithm; elliptic curve
cryptosystem; Pollard's rho",
}
@InProceedings{Gupta:2008:FAT,
author = "Manish Gupta and Amit Pathak and Soumen Chakrabarti",
editor = "{ACM}",
booktitle = "International World Wide Web Conference Proceeding of
the 17th international conference on World Wide Web",
title = "Fast algorithms for top-$k$ personalized {PageRank}
queries",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "1225--1226",
year = "2008",
DOI = "https://doi.org/10.1145/775152.775191",
ISBN = "1-60558-085-6",
ISBN-13 = "978-1-60558-085-2",
LCCN = "????",
bibdate = "Sat May 8 18:33:09 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/pagerank.bib",
abstract = "In entity-relation (ER) graphs $ (V, E) $, nodes $V$
represent typed entities and edges $E$ represent typed
relations. For dynamic personalized PageRank queries,
nodes are ranked by their steady-state probabilities
obtained using the standard random surfer model. In
this work, we propose a framework to answer top-$k$
graph conductance queries. Our top-$k$ ranking
technique leads to a 4$ \times $ speedup, and overall,
our system executes queries 200-1600$ \times $ faster
than whole-graph PageRank. Some queries might contain
hard predicates i.e. predicates that must be satisfied
by the answer nodes. E.g. we may seek authoritative
papers on public key cryptography, but only those
written during 1997. We extend our system to handle
hard predicates. Our system achieves these substantial
query speedups while consuming only 10--20\% of the
space taken by a regular text index.",
acknowledgement = ack-nhfb,
keywords = "HubRank; node-deletion; pagerank; personalized;
top-$k$",
}
@TechReport{Halderman:2008:LWRa,
author = "J. Alex Halderman and Seth D. Schoen and Nadia
Heninger and William Clarkson and William Paul and
Joseph A. Calandrino and Ariel J. Feldman and Jacob
Appelbaum and Edward W. Felten",
title = "Lest We Remember: Cold Boot Attacks on Encryption
Keys",
type = "Technical report",
institution = "Princeton University",
address = "Princeton, NJ, USA",
pages = "22",
day = "21",
month = feb,
year = "2008",
bibdate = "Fri Feb 22 17:51:32 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://citp.princeton.edu.nyud.net/pub/coldboot.pdf",
abstract = "Contrary to popular assumption, DRAMs used in most
modern computers retain their contents for seconds to
minutes after power is lost, even at room temperature
and even if removed from a motherboard. Although DRAMs
become less reliable when they are not refreshed, they
are not immediately erased, and their contents persist
sufficiently for malicious (or forensic) acquisition of
usable full-system memory images. We show that this
phenomenon limits the ability of an operating system to
protect cryptographic key material from an attacker
with physical access. We use cold reboots to mount
successful attacks on popular disk encryption systems
using no special devices or materials. We
experimentally characterize the extent and
predictability of memory remanence and report that
remanence times can be increased dramatically with
simple techniques. We offer new algorithms for finding
cryptographic keys in memory images and for correcting
errors caused by bit decay. Though we discuss several
strategies for partially mitigating these risks, we
know of no simple remedy that would eliminate them.",
acknowledgement = ack-nhfb,
}
@InProceedings{Halderman:2008:LWRb,
author = "J. Alex Halderman and Seth D. Schoen and Nadia
Heninger and William Clarkson and William Paul and
Joseph A. Calandrino and Ariel J. Feldman and Jacob
Appelbaum and Edward W. Felten",
editor = "????",
booktitle = "Usenix Security",
title = "Lest we remember: cold-boot attacks on encryption
keys",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "??--??",
year = "2008",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 12:06:03 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 40]{Schneier:2015:SWC}.",
}
@Article{Han:2008:PBPa,
author = "Song Han and Elizabeth Chang and Tharam Dillon",
title = "Pairing-based public-key encryption schemes with
backward-and-forward security",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "23",
number = "1",
pages = "??--??",
month = jan,
year = "2008",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:39:15 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Han:2008:PBPb,
author = "Song Han and Elizabeth Chang and Tharam Dillon",
title = "Pairing-based public-key encryption schemes with
backward-and-forward security",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "23",
number = "4",
pages = "??--??",
month = jul,
year = "2008",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:42:19 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Hemaspaandra:2008:EDA,
author = "Lane A. Hemaspaandra and J{\"o}rg Rothe and Amitabh
Saxena",
title = "Enforcing and defying associativity, commutativity,
totality, and strong noninvertibility for worst-case
one-way functions",
journal = j-THEOR-COMP-SCI,
volume = "401",
number = "1--3",
pages = "27--35",
day = "23",
month = jul,
year = "2008",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:38 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Book{Higgins:2008:NSC,
author = "Peter M. Higgins",
title = "Number story: from counting to cryptography",
publisher = "Copernicus",
address = "New York, NY, USA",
pages = "323",
year = "2008",
ISBN = "1-84800-000-6 (hardcover), 1-84800-001-4 (ebook)",
ISBN-13 = "978-1-84800-000-1 (hardcover), 978-1-84800-001-8
(ebook)",
LCCN = "QA241 .H48 2008",
bibdate = "Wed Nov 26 22:46:29 MST 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/fy0804/2007936363.html",
acknowledgement = ack-nhfb,
subject = "number theory",
}
@Book{Hoffstein:2008:IMC,
author = "Jeffrey Hoffstein and Jill Catherine Pipher and Joseph
H. Silverman",
title = "An Introduction to Mathematical Cryptography",
volume = "666",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xv + 523",
year = "2008",
ISBN = "0-387-77993-0 (hardcover)",
ISBN-13 = "978-0-387-77993-5 (hardcover)",
LCCN = "QA268 .H64 2008",
bibdate = "Thu Mar 22 12:29:21 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Undergraduate texts in mathematics",
acknowledgement = ack-nhfb,
subject = "Coding theory; Cryptography; Mathematics",
tableofcontents = "An introduction to cryptography \\
Discrete logarithms and Diffie-Hellman \\
Integer factorization and RSA \\
Combinatorics, probability, and information theory \\
Elliptic curves and cryptography \\
Lattices and cryptography \\
Digital signatures \\
Additional topics in cryptography",
}
@Article{Hongfeng:2008:ECP,
author = "Zhu Hongfeng and Liu Tianhua and Liu Jie",
title = "{EV-C2C-PAKE}: An improved client-to-client
password-authenticated key exchange protocol",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "23",
number = "3",
pages = "??--??",
month = may,
year = "2008",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:41:11 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Hu:2008:NNP,
author = "Yupu Hu and Baocang Wang and Wencai He",
title = "{NTRUSign} With a New Perturbation",
journal = j-IEEE-TRANS-INF-THEORY,
volume = "54",
number = "7",
pages = "3216--3221",
month = jul,
year = "2008",
CODEN = "IETTAW",
DOI = "https://doi.org/10.1109/TIT.2008.924662",
ISSN = "0018-9448 (print), 1557-9654 (electronic)",
ISSN-L = "0018-9448",
bibdate = "Thu Apr 21 10:57:48 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "NTRUSign, a digital signature scheme, is suffering an
effective attack. In this correspondence, we insert a
new perturbation into NTRUSign primitive. With the new
perturbation, each signature value is a linear
combination of the private keys, and the combination
coefficients have a hidden distribution. By a large
number of signatures, the attacker obtains the value of
some complicated function of the private keys. It
appears as hard problem computing the private keys from
this value. Our scheme is smaller in size, presents a
higher efficiency, and provides a clearer security
proof than NTRUSign with the old perturbation.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Information Theory",
keywords = "ANSI X9.98-2010; NTRUSign",
}
@Article{Huang:2008:NCK,
author = "Hui-Feng Huang and Chin-Chen Chang",
title = "A Novel Cryptographic Key Assignment Scheme with
{ID}-Based Access Control in a Hierachy",
journal = j-FUND-INFO,
volume = "84",
number = "3--4",
pages = "353--361",
month = sep,
year = "2008",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:07:00 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Huffmire:2008:DSS,
author = "Ted Huffmire and Brett Brotherton and Nick Callegari
and Jonathan Valamehr and Jeff White and Ryan Kastner
and Tim Sherwood",
title = "Designing secure systems on reconfigurable hardware",
journal = j-TODAES,
volume = "13",
number = "3",
pages = "44:1--44:??",
month = jul,
year = "2008",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1367045.1367053",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Tue Aug 5 18:41:27 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The extremely high cost of custom ASIC fabrication
makes FPGAs an attractive alternative for deployment of
custom hardware. Embedded systems based on
reconfigurable hardware integrate many functions onto a
single device. Since embedded designers often have no
choice but to use soft IP cores obtained from third
parties, the cores operate at different trust levels,
resulting in mixed-trust designs. The goal of this
project is to evaluate recently proposed security
primitives for reconfigurable hardware by building a
real embedded system with several cores on a single
FPGA and implementing these primitives on the system.
Overcoming the practical problems of integrating
multiple cores together with security mechanisms will
help us to develop realistic security-policy
specifications that drive enforcement mechanisms on
embedded systems.",
acknowledgement = ack-nhfb,
articleno = "44",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
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:2008:CPK,
author = "Y. H. Hwang and J. K. Liu and S. S. Chow",
title = "Certificateless Public Key Encryption Secure against
Malicious {KGC} Attacks in the Standard Model",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "463--480",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/certificateless_public_key_encryption",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Article{Inoue:2008:FAC,
author = "Hiroaki Inoue and Junji Sakai and Sunao Torii and
Masato Edahiro",
title = "{FIDES}: an advanced chip multiprocessor platform for
secure next generation mobile terminals",
journal = j-TECS,
volume = "8",
number = "1",
pages = "1:1--1:??",
month = dec,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1457246.1457247",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Tue Jan 6 14:36:01 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We propose a secure platform on a chip multiprocessor,
FIDES, in order to enable next generation mobile
terminals to execute downloaded native applications for
Linux. Its most important feature is the higher
security based on multigrained separation mechanisms.
Four new technologies support the FIDES platform: bus
filter logic, XIP kernels, policy separation, and
dynamic access control. With these technologies, the
FIDES platform can tolerate both application-level and
kernel-level bugs on an actual download subsystem.
Thus, the best-suited platform to secure next
generation mobile terminals is FIDES.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "chip multiprocessor; Secure mobile terminal; SELinux",
}
@Article{Iqbal:2008:CDV,
author = "Razib Iqbal and Shervin Shirmohammadi and Abdulmotaleb
El Saddik and Jiying Zhao",
title = "Compressed-Domain Video Processing for Adaptation,
Encryption, and Authentication",
journal = j-IEEE-MULTIMEDIA,
volume = "15",
number = "2",
pages = "38--50",
month = apr # "\slash " # jun,
year = "2008",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2008.23",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu Jul 2 18:03:20 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@InProceedings{Ishai:2008:CCC,
author = "Yuval Ishai and Eyal Kushilevitz and Rafail Ostrovsky
and Amit Sahai",
title = "Cryptography with constant computational overhead",
crossref = "ACM:2008:SPA",
pages = "433--442",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374438",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Current constructions of cryptographic primitives
typically involve a large multiplicative computational
overhead that grows with the desired level of security.
We explore the possibility of implementing basic
cryptographic primitives, such as encryption,
authentication, signatures, and secure two-party
computation, while incurring only a constant
computational overhead compared to insecure
implementations of the same tasks. Here we make the
usual security requirement that the advantage of any
polynomial-time attacker must be negligible in the
input length.\par
We obtain affirmative answers to this question for most
central cryptographic primitives under plausible,
albeit sometimes nonstandard, intractability
assumptions. We start by showing that
pairwise-independent hash functions can be computed by
linear-size circuits, disproving a conjecture of
Mansour, Nisan, and Tiwari (STOC 1990). This
construction does not rely on any unproven assumptions
and is of independent interest. Our hash functions can
be used to construct message authentication schemes
with constant overhead from any one-way function. Under
an intractability assumption that generalizes a
previous assumption of Alekhnovich (FOCS 2003), we get
(public and private key) encryption schemes with
constant overhead. Using an exponentially strong
version of the previous assumption, we get signature
schemes of similar complexity. Assuming the existence
of pseudorandom generators in NC $z$ with polynomial
stretch together with the existence of an (arbitrary)
oblivious transfer protocol, we get similar results for
the seemingly very complex task of secure two-party
computation. More concretely, we get general protocols
for secure two-party computation in the semi-honest
model in which the two parties can be implemented by
circuits whose size is a constant multiple of the size
$s$ of the circuit to be evaluated. In the malicious
model, we get protocols whose communication complexity
is a constant multiple of $s$ and whose computational
complexity is slightly super-linear in $s$. For natural
relaxations of security in the malicious model that are
still meaningful in practice, we can also keep the
computational complexity linear in $s$. These results
extend to the case of a constant number of parties,
where an arbitrary subset of the parties can be
corrupted.\par
Our protocols rely on non-black-box techniques, and
suggest the intriguing possibility that the ultimate
efficiency in this area of cryptography can be obtained
via such techniques.",
acknowledgement = ack-nhfb,
keywords = "constant computational overhead; cryptography;
universal hashing",
}
@Article{Iwami:2008:AIA,
author = "Maki Iwami",
title = "An attack on improved algebraic surface public-key
cryptosystem (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "71--74",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394083",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Public key cryptography is widely used because it
enables secure communication with a party accessing the
site for the first time. But it is widely known that
the quantum computers become available then the public
key cryptosystems based on the discrete logarithm
problem such as RSA cryptosystem and Elliptic Curve
cryptosystem will no longer be secure. To address these
issues, Akiyama-Goto algebraic Surface Public-key
Cryptosystem (ASC) was developed [1], and opened to
general public at website as a research news of Toshiba
corporation in 2005. Its security is based on a
decision randomizing polynomial problem which is
related to a problem of finding sections on fibered
algebraic surfaces. This problem can be reduced to
solving a multivariate equation system and it is known
to be NP-complete. In 2007, in the case that public-key
is in a certain form, Uchiyama and Tokunaga successed
to attack in the sense of getting plain text from
cipher text using reductions efficiently without
solving section finding problem [2].And the abstract is
introduced in CRYPTREC report 2006 [3] in the Appendix
Chapter, which is known to be the important report
related to e-Government recommended ciphers in Japan.
Note that, at this point, the cryptosystem can be used
safely if only we avoid to adopt using public key with
vulnerability in the key generation step. However, the
author suggested two algorithms applicable to all cases
[5] i.e. the cryptosystem is completely broken. One is
the generalization of Uchiyama-Tokunagas attack from
polynomial ring over IFp to polynomial ring over
rational function field. And the other takes advantages
of Gr{\"o}bner base techniques so as to deal with in
the polynomial ring over IFp. And in [6], the author
also suggested methods for calculating zero point of
the algebraic surface and a new attack utilizing it,
and the approach resulted in the difficulty of making a
suggestion of the invulnerable algebraic surface
public-key cryptosystem without changing ideas
progressively. On the other hand, Inanov-Volochs attack
using trace map [9] was developed. In these background,
Akiyama-Goto developed improved version of their
Algebraic surface public-key cryptosystem (improved
ASC) [8] on January 2008 [8] which has tolerance to
Uchiyama-Gotos attack using reduction and Volochs
attack using the trace map. Ivanov and Voloch suggested
the substitution attack briefly on improved ASC in
section 3 in [9], but the details are unspecified. In
section 2, the improved ASC is described, and then, in
section 3, a new reduction attack on the improved ASC
is presented.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
keywords = "cryptography",
}
@Article{Jankowski:2008:BRBb,
author = "Richard Jankowski",
title = "Book Review: {{\booktitle{Privacy on the Line: The
Politics of Wiretapping and Encryption}}, by Whitfield
Diffie and Susan Landau}",
journal = j-SIGACT,
volume = "39",
number = "4",
pages = "30--32",
month = dec,
year = "2008",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1466390.1466397",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:30 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Diffie:1998:PLP,Diffie:2007:PLP}.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Jankvist:2008:TMH,
author = "Uffe Thomas Jankvist",
title = "A teaching module on the history of public-key
cryptography and {RSA}",
journal = j-BSHM-BULL,
volume = "23",
number = "3",
pages = "157--168",
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1080/17498430802304032",
ISSN = "1749-8430 (print), 1749-8341 (electronic)",
ISSN-L = "1749-8341",
bibdate = "Tue Jun 20 11:40:31 MDT 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/bshm.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.tandfonline.com/doi/full/10.1080/17498430802304032",
acknowledgement = ack-nhfb,
ajournal = "BSHM Bull.",
fjournal = "BSHM Bulletin: Journal of the British Society for the
History of Mathematics",
journal-URL = "http://www.tandfonline.com/loi/tbsh20",
onlinedate = "06 Nov 2008",
}
@Article{Jeong:2008:PKE,
author = "I. R. Jeong and D. H. Lee",
title = "Parallel Key Exchange",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "377--396",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/parallel_key_exchange",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Article{Jones:2008:RAA,
author = "Josh Jones",
title = "The {RSA} algorithm (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "74--74",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394084",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "My project is a brief introduction for the RSA
Algorithm. This project will include a very brief
history of where RSA originated, as well as how the RSA
algorithm works. Following this, the mathematical proof
of RSA is presented along with the two necessary
theorems needed to prove RSA. The final portion of my
presentation includes some of the potential threats to
RSA and how to prevent these attacks, including a chart
of the strength of RSA based on time required to crack
RSA in MIPS-Years where the only factor is the size of
the key.",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
keywords = "cryptography",
}
@Article{Kato:2008:QSC,
author = "Kentaro Kato and Osamu Hirota",
editor = "Ronald E. Meyers and Yanhua Shih and Keith S. Deacon",
title = "A quantum stream cipher by {Yuen 2000} protocol with
nonlinear random number generator",
journal = j-PROC-SPIE,
volume = "7092",
number = "1",
pages = "70920H",
year = "2008",
CODEN = "PSISDG",
DOI = "https://doi.org/10.1117/12.794584",
ISSN = "0277-786X (print), 1996-756X (electronic)",
ISSN-L = "0277-786X",
bibdate = "Mon Jan 16 15:57:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "Quantum Communications and Quantum Imaging VI.",
URL = "http://link.aip.org/link/?PSI/7092/70920H/1",
acknowledgement = ack-nhfb,
eid = "70920H",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
location = "San Diego, CA, USA",
numpages = "8",
}
@Book{Katz:2008:IMC,
author = "Jonathan Katz and Yehuda Lindell",
title = "Introduction to modern cryptography: Principles and
Protocols",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xviii + 534",
year = "2008",
ISBN = "1-58488-551-3",
ISBN-13 = "978-1-58488-551-1",
LCCN = "QA76.9.A25 K36 2008",
bibdate = "Thu Mar 22 12:29:41 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Chapman and Hall/CRC cryptography and network
security",
URL = "http://www.loc.gov/catdir/enhancements/fy0807/2007017861-d.html;
http://www.loc.gov/catdir/toc/ecip0716/2007017861.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
tableofcontents = "I. Introduction and Classical Cryptography \\
1. Introduction \\
2. Perfectly-Secret Encryption \\
II. Private-Key (Symmetric) Cryptography \\
3. Private-Key Encryption and Pseudorandomness \\
4. Message Authentication Codes and Collision-Resistant
Hash Functions \\
5. Practical Constructions of Pseudorandom Permutations
(Block Ciphers) \\
6. Theoretical Constructions of Pseudorandom Objects
\\
III. Public-Key (Asymmetric) Cryptography \\
7. Number Theory and Cryptographic Hardness Assumptions
\\
8. Factoring and Computing Discrete Logarithms \\
9. Private-Key Management and the Public-Key Revolution
\\
10. Public-Key Encryption \\
11. Additional Public-Key Encryption Schemes \\
12. Digital Signature Schemes \\
13. Public-Key Cryptosystems in the Random Oracle Model
\\
A. Mathematical Background \\
B. Supplementary Algorithmic Number Theory",
}
@Article{Kausar:2008:SEK,
author = "Firdous Kausar and Sajid Hussain and Laurence T. Yang
and Ashraf Masood",
title = "Scalable and efficient key management for
heterogeneous sensor networks",
journal = j-J-SUPERCOMPUTING,
volume = "45",
number = "1",
pages = "44--65",
month = jul,
year = "2008",
CODEN = "JOSUED",
DOI = "https://doi.org/10.1007/s11227-008-0184-2",
ISSN = "0920-8542 (print), 1573-0484 (electronic)",
ISSN-L = "0920-8542",
bibdate = "Wed Jul 9 17:32:35 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=45&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jsuper.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=45&issue=1&spage=44",
acknowledgement = ack-nhfb,
fjournal = "The Journal of Supercomputing",
journal-URL = "http://link.springer.com/journal/11227",
keywords = "Authentication; Heterogeneous sensor networks; Key
management; Random key predistribution; Security",
}
@Article{Kayem:2008:RCK,
author = "Anne V. D. M. Kayem and Selim G. Akl and Patrick
Martin",
title = "On replacing cryptographic keys in hierarchical key
management systems",
journal = j-J-COMP-SECUR,
volume = "16",
number = "3",
pages = "289--309",
month = "????",
year = "2008",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2008-16303",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:23:56 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Kol:2008:GEI,
author = "Gillat Kol and Moni Naor",
title = "Games for exchanging information",
crossref = "ACM:2008:SPA",
pages = "423--432",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374437",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We consider the rational versions of two of the
classical problems in foundations of cryptography:
secret sharing and multiparty computation, suggested by
Halpern and Teague (STOC 2004). Our goal is to design
games and fair strategies that encourage rational
participants to exchange information about their inputs
for their mutual benefit, when the only mean of
communication is a broadcast channel.\par
We show that protocols for the above information
exchanging tasks, where players' values come from a
bounded domain, cannot satisfy some of the most
desirable properties. In contrast, we provide a
rational secret sharing scheme with simultaneous
broadcast channel in which shares are taken from an
unbounded domain, but have finite (and polynomial
sized) expectation.\par
Previous schemes (mostly cryptographic) have required
computational assumptions, making them inexact and
susceptible to backward induction, or used stronger
communication channels. Our scheme is
non-cryptographic, immune to backward induction, and
satisfies a stronger rationality concept (strict Nash
equilibrium). We show that our solution can also be
used to construct an $ \epsilon $-Nash equilibrium
secret sharing scheme for the case of a
non-simultaneous broadcast channel.",
acknowledgement = ack-nhfb,
keywords = "backward induction; cryptography; game theory;
multiparty computation; Nash equilibrium; secret
sharing",
}
@Article{Kuhn:2008:BSS,
author = "Ulrich K{\"u}hn",
title = "Breaking the {Shin--Shin--Rhee} remotely keyed
encryption schemes",
journal = j-INFO-PROC-LETT,
volume = "105",
number = "6",
pages = "236--240",
day = "16",
month = mar,
year = "2008",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:52:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Lai:2008:JIA,
author = "Charlie Lai",
title = "{Java} Insecurity: Accounting for Subtleties That Can
Compromise Code",
journal = j-IEEE-SOFTWARE,
volume = "25",
number = "1",
pages = "13--19",
month = jan # "\slash " # feb,
year = "2008",
CODEN = "IESOEG",
DOI = "https://doi.org/10.1109/MS.2008.9",
ISSN = "0740-7459 (print), 0740-7459 (electronic)",
ISSN-L = "0740-7459",
bibdate = "Thu Jul 3 12:17:31 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Software",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software",
}
@Article{Lakshminarayanan:2008:SUC,
author = "Karthik Lakshminarayanan and Daniel Adkins and Adrian
Perrig and Ion Stoica",
title = "Securing user-controlled routing infrastructures",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "549--561",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.903980",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "Designing infrastructures that give untrusted third
parties (such as end-hosts) control over routing is a
promising research direction for achieving flexible and
efficient communication. However, serious concerns
remain over the deployment of such infrastructures,
particularly the new security vulnerabilities they
introduce. The flexible control plane of these
infrastructures can be exploited to launch many types
of powerful attacks with little effort. In this paper,
we make several contributions towards studying security
issues in forwarding infrastructures (FIs). We present
a general model for an FI, analyze potential security
vulnerabilities, and present techniques to address
these vulnerabilities. The main technique that we
introduce in this paper is the use of simple
lightweight cryptographic constraints on forwarding
entries. We show that it is possible to prevent a large
class of attacks on end-hosts and bound the flooding
attacks that can be launched on the infrastructure
nodes to a small constant value. Our mechanisms are
general and apply to a variety of earlier proposals
such as $i$ 3, DataRouter, and Network Pointers.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "internet architecture; overlay networks; security",
}
@Article{Laud:2008:CSC,
author = "Peeter Laud",
title = "On the computational soundness of cryptographically
masked flows",
journal = j-SIGPLAN,
volume = "43",
number = "1",
pages = "337--348",
month = jan,
year = "2008",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1328897.1328479",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 11:02:13 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "To speak about the security of information flow in
programs employing cryptographic operations,
definitions based on computational indistinguishability
of distributions over program states have to be used.
These definitions, as well as the accompanying analysis
tools, are complex and error-prone to argue about.
Cryptographically masked flows, proposed by Askarov,
Hedin and Sabelfeld, are an abstract execution model
and security definition that attempt to abstract away
the details of computational security. This abstract
model is useful because analysis of programs can be
conducted using the usual techniques for enforcing
non-interference.\par
In this paper we investigate under which conditions
this abstract model is computationally sound, i.e. when
does the security of a program in their model imply the
computational security of this program. This paper
spells out a reasonable set of conditions and then
proposes a simpler abstract model that is nevertheless
no more restrictive than the cryptographically masked
flows together with these conditions for soundness.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "computational soundness; cryptographically masked
flows; encryption; secure information flow",
}
@Book{Laughlin:2008:CRC,
author = "Robert B. Laughlin",
title = "The crime of reason: and the closing of the scientific
mind",
publisher = pub-BASIC-BOOKS,
address = pub-BASIC-BOOKS:adr,
pages = "186 (est.)",
year = "2008",
ISBN = "0-465-00507-1",
ISBN-13 = "978-0-465-00507-9",
LCCN = "JC598 .L38 2008",
bibdate = "Sat Oct 25 14:43:32 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Freedom of information; Information policy; Academic
freedom; Communication of technical information;
Intellectual freedom; Knowledge management",
tableofcontents = "The end of reason \\
Dangerous knowledge \\
The master cryptographer \\
Games of chance \\
Patently absurd \\
The nuclear precedent \\
The facts of life \\
Clone wars \\
Spam spam spam spam \\
The troubled utopia",
}
@Article{Lavasani:2008:IFA,
author = "Ahmad Lavasani and Reza Mohammadi",
title = "Implementing a feasible attack against {ECC2K-130}
certicom challenge (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "61--62",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394072",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
keywords = "cryptography",
}
@Article{Lee:2008:SAF,
author = "Changhoon Lee and Jongsung Kim and Seokhie Hong and
Jaechul Sung and Sangjin Lee",
title = "Security analysis of the full-round {DDO-64} block
cipher",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "12",
pages = "2328--2335",
month = dec,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Levieil:2008:CTC,
author = "Eric Levieil and David Naccache",
title = "Cryptographic Test Correction",
journal = j-IEEE-SEC-PRIV,
volume = "6",
number = "2",
pages = "69--71",
month = mar # "\slash " # apr,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2008.30",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Jul 3 12:03:38 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Li:2008:CAM,
author = "Zhongwen Li and Qiong Chen and Yang Xiang",
title = "A cross-authentication model and implementation",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "23",
number = "3",
pages = "??--??",
month = may,
year = "2008",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:41:11 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Li:2008:CRR,
author = "Shujun Li and Chengqing Li and Guanrong Chen and
Kwok-Tung Lo",
title = "Cryptanalysis of the {RCES/RSES} image encryption
scheme",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "7",
pages = "1130--1143",
month = jul,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Li:2008:DEO,
author = "Lvzhou Li and Daowen Qiu",
title = "Determining the equivalence for one-way quantum finite
automata",
journal = j-THEOR-COMP-SCI,
volume = "403",
number = "1",
pages = "42--51",
day = "20",
month = aug,
year = "2008",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:40 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Li:2008:ISS,
author = "Chua-Ta Li and Min-Shiang Hwang and Yen-Ping Chu",
title = "Improving the security of a secure anonymous routing
protocol with authenticated key exchange for ad hoc
networks",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "23",
number = "3",
pages = "??--??",
month = may,
year = "2008",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:41:11 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Liu:2008:ARL,
author = "Donggang Liu and Peng Ning and An Liu and Cliff Wang
and Wenliang Kevin Du",
title = "Attack-Resistant Location Estimation in Wireless
Sensor Networks",
journal = j-TISSEC,
volume = "11",
number = "4",
pages = "22:1--22:??",
month = jul,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1380564.1380570",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Aug 5 19:37:22 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Many sensor network applications require sensors'
locations to function correctly. Despite the recent
advances, location discovery for sensor networks in
{\em hostile environments\/} has been mostly
overlooked. Most of the existing localization protocols
for sensor networks are vulnerable in hostile
environments. The security of location discovery can
certainly be enhanced by authentication. However, the
possible node compromises and the fact that location
determination uses certain physical features (e.g.,
received signal strength) of radio signals make
authentication not as effective as in traditional
security applications. This article presents two
methods to tolerate malicious attacks against
range-based location discovery in sensor networks. The
first method filters out malicious beacon signals on
the basis of the ``consistency'' among multiple beacon
signals, while the second method tolerates malicious
beacon signals by adopting an iteratively refined
voting scheme. Both methods can survive malicious
attacks even if the attacks bypass authentication,
provided that the benign beacon signals constitute the
majority of the beacon signals. This article also
presents the implementation and experimental evaluation
(through both field experiments and simulation) of all
the secure and resilient location estimation schemes
that can be used on the current generation of sensor
platforms (e.g., MICA series of motes), including the
techniques proposed in this article, in a network of
MICAz motes. The experimental results demonstrate the
effectiveness of the proposed methods, and also give
the secure and resilient location estimation scheme
most suitable for the current generation of sensor
networks.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "localization; security; sensor networks",
}
@Article{Liu:2008:DEA,
author = "Hongjun Liu and Ping Luo and Daoshun Wang",
title = "A distributed expansible authentication model based on
{Kerberos}",
journal = j-J-NETW-COMPUT-APPL,
volume = "31",
number = "4",
pages = "472--486",
month = nov,
year = "2008",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:22 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804508000027",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Liu:2008:GPV,
author = "Jen-Chang Liu and Ming-Hong Shih",
title = "Generalizations of Pixel-Value Differencing
Steganography for Data Hiding in Images",
journal = j-FUND-INFO,
volume = "83",
number = "3",
pages = "319--335",
month = aug,
year = "2008",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:06:46 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Liu:2008:SAM,
author = "Hongjun Liu and Ping Luo and Daoshun Wang",
title = "A scalable authentication model based on public keys",
journal = j-J-NETW-COMPUT-APPL,
volume = "31",
number = "4",
pages = "375--386",
month = nov,
year = "2008",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:22 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804508000106",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Lu:2008:PTZ,
author = "Li Lu and Jinsong Han and Yunhao Liu and Lei Hu and
Jin-Peng Huai and Lionel Ni and Jian Ma",
title = "Pseudo Trust: Zero-Knowledge Authentication in
Anonymous {P2Ps}",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "19",
number = "10",
pages = "1325--1337",
month = oct,
year = "2008",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2008.15",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu May 13 12:06:56 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Lysyanskaya:2008:CHK,
author = "Anna Lysyanskaya",
title = "Cryptography: How to Keep Secrets Safe",
journal = j-SCI-AMER,
volume = "299",
number = "3",
pages = "88--95",
month = sep,
year = "2008",
CODEN = "SCAMAC",
DOI = "https://doi.org/10.1038/scientificamerican0908-88",
ISSN = "0036-8733 (print), 1946-7087 (electronic)",
ISSN-L = "0036-8733",
bibdate = "Fri May 17 10:29:45 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sciam2000.bib",
URL = "http://www.nature.com/scientificamerican/journal/v299/n3/full/scientificamerican0908-88.html;
http://www.nature.com/scientificamerican/journal/v299/n3/pdf/scientificamerican0908-88.pdf",
acknowledgement = ack-nhfb,
fjournal = "Scientific American",
journal-URL = "http://www.nature.com/scientificamerican",
}
@Article{Malan:2008:IPK,
author = "David J. Malan and Matt Welsh and Michael D. Smith",
title = "Implementing public-key infrastructure for sensor
networks",
journal = j-TOSN,
volume = "4",
number = "4",
pages = "22:1--22:??",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1387663.1387668",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:22:19 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present a critical evaluation of the first known
implementation of elliptic curve cryptography over
F$_{2 {\em p \/ }}$ for sensor networks based on the
8-bit, 7.3828-MHz MICA2 mote. We offer, along the way,
a primer for those interested in the field of
cryptography for sensor networks. We discuss, in
particular, the decisions underlying our design and
alternatives thereto. And we elaborate on the
methodologies underlying our evaluation.\par
Through instrumentation of UC Berkeley's TinySec
module, we argue that, although symmetric cryptography
has been tractable in this domain for some time, there
has remained a need, unfulfilled until recently, for an
efficient, secure mechanism for distribution of secret
keys among nodes. Although public-key infrastructure
has been thought impractical, we show, through analysis
of our original implementation for TinyOS of point
multiplication on elliptic curves, that public-key
infrastructure is indeed viable for TinySec keys'
distribution, even on the MICA2. We demonstrate that
public keys can be generated within 34 seconds and that
shared secrets can be distributed among nodes in a
sensor network within the same time, using just over 1
kilobyte of SRAM and 34 kilobytes of ROM. We
demonstrate that communication costs are minimal, with
only 2 packets required for transmission of a public
key among nodes. We make available all of our source
code for other researchers to download and use. And we
discuss recent results based on our work that
corroborate and improve upon our conclusions.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "Diffie--Hellman; DLP; ECC; ECDLP; elliptic curve
cryptography; MICA2; motes; sensor networks; TinyOS;
TinySec",
}
@Article{Mandviwalla:2008:MBW,
author = "Munir Mandviwalla and Abhijit Jain and Julie
Fesenmaier and Jeff Smith and Paul Weinberg and Greg
Meyers",
title = "Municipal broadband wireless networks",
journal = j-CACM,
volume = "51",
number = "2",
pages = "72--80",
month = feb,
year = "2008",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1314215.1314228",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jun 16 18:35:40 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cacm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "'\ldots{} people lack many things: jobs, shelter,
food, health care and drinkable water. Today, being cut
off from basic telecommunications services is a
hardship almost as acute as these other deprivations,
and may indeed reduce the chances of finding remedies
to them.' ---UN Secretary General, Kofi Annan, in a
keynote address to the International Telecommunication
Union, Oct. 9, 1999.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Mann:2008:HHS,
author = "Ian Mann",
title = "Hacking the human: social engineering techniques and
security countermeasures",
publisher = "Gower",
address = "Aldershot, England",
pages = "vii + 254",
year = "2008",
ISBN = "0-566-08773-1",
ISBN-13 = "978-0-566-08773-8",
LCCN = "HM668 .M36 2008",
bibdate = "Mon Oct 26 09:54:16 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0817/2008019977.html",
acknowledgement = ack-nhfb,
subject = "social engineering; social systems; planning",
tableofcontents = "What is social engineering? \\
Understanding your risks \\
People, your weakest link \\
Limitations to current security thinking \\
Trust me \\
Reading a person \\
Subconscious mind \\
Parent, adult, child \\
Vulnerability mapping \\
Protection systems \\
Awareness and training \\
Testing",
}
@Article{Martin:2008:CCI,
author = "Luther Martin",
title = "Crypto Corner: Identity-Based Encryption and Beyond",
journal = j-IEEE-SEC-PRIV,
volume = "6",
number = "5",
pages = "62--64",
month = sep # "\slash " # oct,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2008.120",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Jul 2 10:02:21 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Martin:2008:IBE,
author = "Luther Martin",
title = "Identity-Based Encryption Comes of Age",
journal = j-COMPUTER,
volume = "41",
number = "8",
pages = "93--95",
month = aug,
year = "2008",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2008.299",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Tue Aug 12 18:24:27 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
keywords = "cryptography",
}
@Article{McAndrew:2008:TCO,
author = "Alasdair McAndrew",
title = "Teaching cryptography with open-source software",
journal = j-SIGCSE,
volume = "40",
number = "1",
pages = "325--329",
month = mar,
year = "2008",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1352322.1352247",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 15:44:10 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/gnu.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
note = "Proceedings of SIGCSE 08.",
abstract = "Cryptography has become an important topic in
undergraduate curricula in mathematics and computer
science, not just for its intrinsic interest---``about
the most fun you can have with mathematics''
\cite{ferg04}, but for its current standing as the
basis for almost all computer security. From wireless
networking to secure email to password protection,
cryptographic methods are used to secure information,
to protect users, and to protect data. At Victoria
University, cryptography has been taught as part of a
mathematics and computer science degree for several
years. The students all have had at least a year of
tertiary mathematics, and some exposure to a computer
algebra system (Maple). However, the cost of Maple, and
the current licensing agreement, means that students
are unable to experiment with the software away from
the computer laboratories at the University. For this
reason we have decided to investigate the use of
open-source computer algebra systems Maxima and Axiom.
Although not as full-featured and powerful as the
commercial systems Maple and Mathematica, we show they
are in fact admirably suited for a subject such as
cryptography. In some ways Maxima and Axiom even
surpass Maple and Mathematica. Student response to the
introduction of these systems has been very positive.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{McCamant:2008:QIF,
author = "Stephen McCamant and Michael D. Ernst",
title = "Quantitative information flow as network flow
capacity",
journal = j-SIGPLAN,
volume = "43",
number = "6",
pages = "193--205",
month = jun,
year = "2008",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1375581.1375606",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Wed Jun 18 11:04:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present a new technique for determining how much
information about a program's secret inputs is revealed
by its public outputs. In contrast to previous
techniques based on reachability from secret inputs
(tainting), it achieves a more precise quantitative
result by computing a maximum flow of information
between the inputs and outputs. The technique uses
static control-flow regions to soundly account for
implicit flows via branches and pointer operations, but
operates dynamically by observing one or more program
executions and giving numeric flow bounds specific to
them (e.g., '17 bits'). The maximum flow in a network
also gives a minimum cut (a set of edges that separate
the secret input from the output), which can be used to
efficiently check that the same policy is satisfied on
future executions. We performed case studies on 5 real
C, C++, and Objective C programs, 3 of which had more
than 250K lines of code. The tool checked multiple
security policies, including one that was violated by a
previously unknown bug.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "dynamic analysis; implicit flow; information-flow
analysis",
}
@Article{McDonald:2008:SID,
author = "J. Todd McDonald and Yong C. Kim and Alec Yasinsac",
title = "Software issues in digital forensics",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "29--40",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368512",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Whether we accept it or not, computer systems and the
operating systems that direct them are at the heart of
major forms of malicious activity. Criminals can use
computers as the actual target of their malicious
activity (stealing funds electronically from a bank) or
use them to support the conduct of criminal activity in
general (using a spreadsheet to track drug shipments).
In either case, law enforcement needs the ability (when
required) to collect evidence from such platforms in a
reliable manner that preserves the fingerprints of
criminal activity. Though such discussion touches on
privacy issues and rules of legal veracity, we focus
purely on technological support in this paper.
Specifically, we examine and set forth principles of
operating system (OS) design that may significantly
increase the success of (future) forensic collection
efforts. We lay out several OS design attributes that
synergistically enhance forensics activities.
Specifically, we pose the use of circuit encryption
techniques to provide an additional layer of protection
above hardware-enforced approaches. We conclude by
providing an overarching framework to incorporate these
enhancements within the context of OS design.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "circuit encryption; digital forensics; evidence
collection; forensic software; obfuscation; operating
system extensions; operating systems; security",
}
@Article{Micciancio:2008:OCC,
author = "Daniele Micciancio and Saurabh Panjwani",
title = "Optimal communication complexity of generic multicast
key distribution",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "4",
pages = "803--813",
month = aug,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1137/0213053",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:53:12 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We prove a tight lower bound on the communication
complexity of secure multicast key distribution
protocols in which rekey messages are built using
symmetric-key encryption, pseudo-random generators, and
secret sharing schemes. Our lower bound shows that the
amortized cost of updating the group key for each group
membership change (as a function of the current group
size) is at least $ \log_2 (n) - o(1) $ basic rekey
messages. This lower bound matches, up to a subconstant
additive term, the upper bound due to Canetti et al.
[Proc. INFOCOM 1999], who showed that $ \log_2 (n) $
basic rekey messages (each time a user joins and/or
leaves the group) are sufficient. Our lower bound is,
thus, optimal up to a small subconstant additive term.
The result of this paper considerably strengthens
previous lower bounds by Canetti et al. [Proc.
Eurocrypt 1999] and Snoeyink et al. [Computer Networks,
47(3):2005], which allowed for neither the use of
pseudorandom generators and secret sharing schemes nor
the iterated (nested) application of the encryption
function. Our model (which allows for arbitrarily
nested combinations of encryption, pseudorandom
generators and secret sharing schemes) is much more
general and, in particular, encompasses essentially all
known multicast key distribution protocols of practical
interest.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "key distribution; lower bounds; multicast; nested
encryption; secret sharing; security",
}
@Article{Miltchev:2008:DAC,
author = "Stefan Miltchev and Jonathan M. Smith and Vassilis
Prevelakis and Angelos Keromytis and Sotiris
Ioannidis",
title = "Decentralized access control in distributed file
systems",
journal = j-COMP-SURV,
volume = "40",
number = "3",
pages = "10:1--10:30",
month = aug,
year = "2008",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1380584.1380588",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Tue Aug 12 12:48:08 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The Internet enables global sharing of data across
organizational boundaries. Distributed file systems
facilitate data sharing in the form of remote file
access. However, traditional access control mechanisms
used in distributed file systems are intended for
machines under common administrative control, and rely
on maintaining a centralized database of user
identities. They fail to scale to a large user base
distributed across multiple organizations. We provide a
survey of decentralized access control mechanisms in
distributed file systems intended for large scale, in
both administrative domains and users. We identify
essential properties of such access control mechanisms.
We analyze both popular production and experimental
distributed file systems in the context of our
survey.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "authentication; authorization; certificates;
credentials; decentralized access control; networked
file systems; trust management",
}
@InProceedings{Mironov:2008:SAE,
author = "Ilya Mironov and Moni Naor and Gil Segev",
title = "Sketching in adversarial environments",
crossref = "ACM:2008:SPA",
pages = "651--660",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374471",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We formalize a realistic model for computations over
massive data sets. The model, referred to as the {\em
adversarial sketch model}, unifies the well-studied
sketch and data stream models together with a
cryptographic flavor that considers the execution of
protocols in `hostile environments', and provides a
framework for studying the complexity of many tasks
involving massive data sets.\par
The adversarial sketch model consists of several
participating parties: honest parties, whose goal is to
compute a pre-determined function of their inputs, and
an adversarial party. Computation in this model
proceeds in two phases. In the first phase, the
adversarial party chooses the inputs of the honest
parties. These inputs are sets of elements taken from a
large universe, and provided to the honest parties in
an on-line manner in the form of a sequence of insert
and delete operations. Once an operation from the
sequence has been processed it is discarded and cannot
be retrieved unless explicitly stored. During this
phase the honest parties are not allowed to
communicate. Moreover, they do not share any secret
information and any public information they share is
known to the adversary in advance. In the second phase,
the honest parties engage in a protocol in order to
compute a pre-determined function of their
inputs.\par
In this paper we settle the complexity (up to
logarithmic factors) of two fundamental problems in
this model: testing whether two massive data sets are
equal, and approximating the size of their symmetric
difference. We construct explicit and efficient
protocols with sublinear sketches of essentially
optimal size, poly-logarithmic update time during the
first phase, and poly-logarithmic communication and
computation during the second phase. Our main technical
contribution is an explicit and deterministic encoding
scheme that enjoys two seemingly conflicting
properties: incrementality and high distance, which may
be of independent interest.",
acknowledgement = ack-nhfb,
keywords = "data stream model; massive data sets; sketch model",
}
@Article{Misic:2008:TEC,
author = "Jelena Mi{\v{s}}i{\'c}",
title = "Traffic and energy consumption of an {IEEE 802.15.4}
network in the presence of authenticated, {ECC}
{Diffie--Hellman} ephemeral key exchange",
journal = j-COMP-NET-AMSTERDAM,
volume = "52",
number = "11",
pages = "2227--2236",
day = "8",
month = aug,
year = "2008",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:27 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Mohanty:2008:IWB,
author = "Saraju P. Mohanty and Bharat K. Bhargava",
title = "Invisible watermarking based on creation and robust
insertion-extraction of image adaptive watermarks",
journal = j-TOMCCAP,
volume = "5",
number = "2",
pages = "12:1--12:??",
month = nov,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1413862.1413865",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Mar 16 18:52:17 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This article presents a novel invisible robust
watermarking scheme for embedding and extracting a
digital watermark in an image. The novelty lies in
determining a perceptually important subimage in the
host image. Invisible insertion of the watermark is
performed in the most significant region of the host
image such that tampering of that portion with an
intention to remove or destroy will degrade the
esthetic quality and value of the image. One feature of
the algorithm is that this subimage is used as a region
of interest for the watermarking process and eliminates
the chance of watermark removal. Another feature of the
algorithm is the creation of a compound watermark using
the input user watermark (logo) and attributes of the
host image. This facilitates the homogeneous fusion of
a watermark with the cover image, preserves the quality
of the host image, and allows robust
insertion-extraction. Watermark creation consists of
two distinct phases. During the first phase, a
statistical image is synthesized from a perceptually
important subimage of the image. A compound watermark
is created by embedding a watermark (logo) into the
statistical synthetic image by using a visible
watermarking technique. This compound watermark is
invisibly embedded into the important block of the host
image. The authentication process involves extraction
of the perceptive logo as well statistical testing for
two-layer evidence. Results of the experimentation
using standard benchmarks demonstrates the robustness
and efficacy of the proposed watermarking approach.
Ownership proof could be established under various
hostile attacks.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "content protection; copyright protection; image;
invisible watermarking; Watermarking",
}
@Article{Monteiro:2008:AVM,
author = "Steena D. S. Monteiro and Robert F. Erbacher",
title = "An authentication and validation mechanism for
analyzing syslogs forensically",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "41--50",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368513",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This research proposes a novel technique for
authenticating and validating syslogs for forensic
analysis. This technique uses a modification of the
Needham Schroeder protocol, which uses nonces (numbers
used only once) and public keys. Syslogs, which were
developed from an event-logging perspective and not
from an evidence-sustaining one, are system treasure
maps that chart out and pinpoint attacks and attack
attempts. Over the past few years, research on securing
syslogs has yielded enhanced syslog protocols that
focus on tamper prevention and detection. However, many
of these protocols, though efficient from a security
perspective, are inadequate when forensics comes into
play. From a legal perspective, any kind of evidence
found at a crime scene needs to be validated. In
addition, any digital forensic evidence when presented
in court needs to be admissible, authentic, believable,
and reliable [4]. Currently, a patchy log on the server
side and client side cannot be considered as formal
authentication of a wrong doer [5]. This paper presents
a method that ties together, authenticates, and
validates all the entities involved in the crime
scene---the user using the application, the system that
is being used, and the application being used on the
system by a user. This means that instead of merely
transmitting the header and the message, which is the
standard syslog protocol format, the syslog entry along
with the user fingerprint, application fingerprint, and
system fingerprint are transmitted to the logging
server. The assignment of digital fingerprints and the
addition of a challenge response mechanism to the
underlying syslogging mechanism aim to validate
generated syslogs forensically.",
acknowledgement = ack-nhfb,
fjournal = "Operating Systems Review",
keywords = "authentication and validation; forensic validity;
model; system log files",
}
@Article{Munro:2008:DE,
author = "Ken Munro",
title = "Desktop encryption",
journal = j-NETWORK-SECURITY,
volume = "2008",
number = "12",
pages = "4--6",
month = dec,
year = "2008",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(08)70138-7",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:59 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485808701387",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Muresan:2008:PCA,
author = "R. Muresan and S. Gregori",
title = "Protection Circuit against Differential Power Analysis
Attacks for Smart Cards",
journal = j-IEEE-TRANS-COMPUT,
volume = "57",
number = "11",
pages = "1540--1549",
month = nov,
year = "2008",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.107",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 12:17:44 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4585359",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Ning:2008:MAA,
author = "Peng Ning and An Liu and Wenliang Du",
title = "Mitigating {DoS} attacks against broadcast
authentication in wireless sensor networks",
journal = j-TOSN,
volume = "4",
number = "1",
pages = "1:1--1:??",
month = jan,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1325651.1325652",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Mon Jun 16 17:50:44 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Broadcast authentication is a critical security
service in wireless sensor networks. There are two
general approaches for broadcast authentication in
wireless sensor networks: digital signatures and $ \mu
$TESLA-based techniques. However, both signature-based
and $ \mu $TESLA-based broadcast authentication are
vulnerable to Denial of Services (DoS) attacks: An
attacker can inject bogus broadcast packets to force
sensor nodes to perform expensive signature
verifications (in case of signature-based broadcast
authentication) or packet forwarding (in case of $ \mu
$TESLA-based broadcast authentication), thus exhausting
their limited battery power. This paper presents an
efficient mechanism called message-specific puzzle to
mitigate such DoS attacks. In addition to
signature-based or $ \mu $TESLA-based broadcast
authentication, this approach adds a weak authenticator
in each broadcast packet, which can be efficiently
verified by a regular sensor node, but takes a
computationally powerful attacker a substantial amount
of time to forge. Upon receiving a broadcast packet,
each sensor node first verifies the weak authenticator,
and performs the expensive signature verification (in
signature-based broadcast authentication) or packet
forwarding (in $ \mu $TESLA-based broadcast
authentication) only when the weak authenticator is
valid. A weak authenticator cannot be precomputed
without a non-reusable (or short-lived) key disclosed
only in a valid packet. Even if an attacker has
intensive computational resources to forge one or more
weak authenticators, it is difficult to reuse these
forged weak authenticators. Thus, this weak
authentication mechanism substantially increases the
difficulty of launching successful DoS attacks against
signature-based or $ \mu $TESLA-based broadcast
authentication. A limitation of this approach is that
it requires a powerful sender and introduces
sender-side delay. This article also reports an
implementation of the proposed techniques on TinyOS, as
well as initial experimental evaluation in a network of
MICAz motes.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "broadcast authentication; DoS attacks; security;
sensor networks",
}
@Article{Onieva:2008:MNS,
author = "Jose A. Onieva and Jianying Zhou and Javier Lopez",
title = "Multiparty nonrepudiation: a survey",
journal = j-COMP-SURV,
volume = "41",
number = "1",
pages = "5:1--5:43",
month = dec,
year = "2008",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1456650.1456655",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jan 12 16:47:51 MST 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Nonrepudiation is a security service that plays an
important role in many Internet applications.
Traditional two-party nonrepudiation has been studied
intensively in the literature. This survey focuses on
multiparty scenarios and provides a comprehensive
overview. It starts with a brief introduction of
fundamental issues on nonrepudiation, including the
types of nonrepudiation service and cryptographic
evidence, the roles of trusted third-party,
nonrepudiation phases and requirements, and the status
of standardization. Then it describes the general
multiparty nonrepudiation problem, and analyzes
state-of-the-art mechanisms. After this, it presents in
more detail the 1-N multiparty nonrepudiation solutions
for distribution of different messages to multiple
recipients. Finally, it discusses advanced solutions
for two typical multiparty nonrepudiation applications,
namely, multiparty certified email and multiparty
contract signing.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Multiparty applications; multiparty protocols;
nonrepudiation",
}
@Article{Oppliger:2008:STSa,
author = "Rolf Oppliger and Ralf Hauser and David Basin",
title = "{SSL\slash TLS} session-aware user authentication
revisited",
journal = j-COMPUT-SECUR,
volume = "27",
number = "3--4",
pages = "64--70",
month = may # "\slash " # jun,
year = "2008",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000102",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Oppliger:2008:STSb,
author = "Rolf Oppliger and Ralf Hauser and David Basin",
title = "{SSL\slash TLS} Session-Aware User Authentication",
journal = j-COMPUTER,
volume = "41",
number = "3",
pages = "59--65",
month = mar,
year = "2008",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2008.98",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Fri Jul 4 17:13:37 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Oury:2008:PP,
author = "Nicolas Oury and Wouter Swierstra",
title = "The power of {Pi}",
journal = j-SIGPLAN,
volume = "43",
number = "9",
pages = "39--50",
month = sep,
year = "2008",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1411203.1411213",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Sep 23 17:31:25 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This paper exhibits the power of programming with
dependent types by dint of embedding three
domain-specific languages: Cryptol, a language for
cryptographic protocols; a small data description
language; and relational algebra. Each example
demonstrates particular design patterns inherent to
dependently-typed programming. Documenting these
techniques paves the way for further research in
domain-specific embedded type systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "dependent types; domain-specific embedded languages",
}
@Article{Palanivel:2008:MPA,
author = "S. Palanivel and B. Yegnanarayana",
title = "Multimodal person authentication using speech, face
and visual speech",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "109",
number = "1",
pages = "44--55",
month = jan,
year = "2008",
CODEN = "CVIUF4",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Apr 2 10:55:54 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@Article{Pang:2008:AQR,
author = "HweeHwa Pang and Kyriakos Mouratidis",
title = "Authenticating the query results of text search
engines",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "1",
number = "1",
pages = "126--137",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1453856.1453875",
ISSN = "2150-8097",
bibdate = "Fri May 13 14:54:36 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Pang:2008:VCR,
author = "Hweehwa Pang and Kian-Lee Tan",
title = "Verifying {Completeness} of {Relational Query Answers}
from {Online Servers}",
journal = j-TISSEC,
volume = "11",
number = "2",
pages = "5:1--5:??",
month = mar,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1330332.1330337",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:41 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "The number of successful attacks on the Internet shows
that it is very difficult to guarantee the security of
online servers over extended periods of time. A
breached server that is not detected in time may return
incorrect query answers to users. In this article, we
introduce authentication schemes for users to verify
that their query answers from an online server are
complete (i. e. , no qualifying tuples are omitted) and
authentic (i. e. , all the result values are
legitimate). We introduce a scheme that supports range
selection, projection as well as primary key-foreign
key join queries on relational databases. We also
present authentication schemes for single- and
multi-attribute range aggregate queries. The schemes
complement access control mechanisms that rewrite
queries dynamically, and are computationally secure. We
have implemented the proposed schemes, and experiment
results showed that they are practical and feasible
schemes with low overheads.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "query answer verification; secure database systems",
}
@Article{Park:2008:SRB,
author = "Taejoon Park and Kang G. Shin",
title = "Secure routing based on distributed key sharing in
large-scale sensor networks",
journal = j-TECS,
volume = "7",
number = "2",
pages = "20:1--20:??",
month = feb,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1331331.1331344",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Jun 12 15:22:00 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Sensor networks, usually built with a large number of
small, low-cost sensor nodes, are characterized by
their large-scale and unattended deployment,
necessitating ``secure'' communications between nearby,
as well as remote, sensor nodes for their intended
applications and services. Key setup/sharing is crucial
to the protection of such applications/services from
attacks, but existing (public-key, cluster-based, or
pairwise) solutions become too expensive (hence,
inefficient) when the underlying applications/services
require communications between distant sensor nodes. To
remedy this inefficiency, we propose a novel
distributed key-sharing scheme, in which each
participating sensor node shares unique keys with a
small number of other sensor nodes---called distributed
key servers (DKSs)---chosen according to their
geographic distance and communication direction. Using
DKSs, we develop two secure routing protocols: (1)
secure geographic forwarding that delivers packets by
using a chain of DKS lookups, each secured with its own
key and forwarded geographically; and (2) key
establishment that creates a secure session between two
distant sensor nodes based solely on symmetric-ciphers.
These protocols enable low-cost, low-power sensors to
provide high-level security at a very low cost.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "attack tolerance; distributed key sharing and servers;
key establishment; large-scale sensor networks; secure
geographic forwarding",
}
@Article{Pass:2008:NIC,
author = "Rafael Pass and Alon Rosen",
title = "New and Improved Constructions of Nonmalleable
Cryptographic Protocols",
journal = j-SIAM-J-COMPUT,
volume = "38",
number = "2",
pages = "702--752",
month = "????",
year = "2008",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:57 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/38/2;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Pavlou:2008:FAD,
author = "Kyriacos E. Pavlou and Richard T. Snodgrass",
title = "Forensic analysis of database tampering",
journal = j-TODS,
volume = "33",
number = "4",
pages = "30:1--30:??",
month = nov,
year = "2008",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/1412331.1412342",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 23 11:45:08 MST 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Regulations and societal expectations have recently
expressed the need to mediate access to valuable
databases, even by insiders. One approach is tamper
detection via cryptographic hashing. This article shows
how to determine when the tampering occurred, what data
was tampered with, and perhaps, ultimately, who did the
tampering, via forensic analysis. We present four
successively more sophisticated forensic analysis
algorithms: the Monochromatic, RGBY, Tiled Bitmap, and
a3D algorithms, and characterize their ``forensic
cost'' under worst-case, best-case, and average-case
assumptions on the distribution of corruption sites. A
lower bound on forensic cost is derived, with RGBY and
a3D being shown optimal for a large number of
corruptions. We also provide validated cost formul{\ae}
for these algorithms and recommendations for the
circumstances in which each algorithm is indicated.",
acknowledgement = ack-nhfb,
articleno = "30",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
keywords = "a3D algorithm; compliant records; forensic analysis
algorithm; forensic cost; Monochromatic algorithm;
Polychromatic algorithm; RGBY algorithm; Tiled Bitmap
algorithm",
}
@InProceedings{Peikert:2008:LTF,
author = "Chris Peikert and Brent Waters",
title = "Lossy trapdoor functions and their applications",
crossref = "ACM:2008:SPA",
pages = "187--196",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374406",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We propose a new general primitive called lossy
trapdoor functions (lossy TDFs), and realize it under a
variety of different number theoretic assumptions,
including hardness of the decisional Diffie--Hellman
(DDH) problem and the worst-case hardness of lattice
problems.\par
Using lossy TDFs, we develop a new approach for
constructing several important cryptographic
primitives, including (injective) trapdoor functions,
collision-resistant hash functions, oblivious transfer,
and chosen ciphertext-secure cryptosystems. All of the
constructions are simple, efficient, and
black-box.\par
These results resolve some long-standing open problems
in cryptography. They give the first known injective
trapdoor functions based on problems not directly
related to integer factorization, and provide the first
known CCA-secure cryptosystem based solely on the
worst-case complexity of lattice problems.",
acknowledgement = ack-nhfb,
keywords = "public key encryption; trapdoor functions",
}
@InProceedings{Petit:2008:BCB,
author = "C. Petit and F. Standaert and O. Pereira and T. Malkin
and M. Yung",
editor = "????",
booktitle = "ASIAN ACM Symposium on Information, Computer and
Communications Security (ASIACCS)",
title = "A block cipher based pseudo random number generator
secure against side-channel key recovery",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "56--65",
year = "2008",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Tue Jan 31 15:51:35 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
}
@Book{Petzold:2008:ATG,
author = "Charles Petzold",
title = "The annotated {Turing}: a guided tour through {Alan
Turing}'s historic paper on computability and the
{Turing Machine}",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xii + 372",
year = "2008",
ISBN = "0-470-22905-5 (paperback)",
ISBN-13 = "978-0-470-22905-7 (paperback)",
LCCN = "QA267 .P48 2008",
bibdate = "Sat Nov 20 21:31:14 MST 2010",
bibsource = "catalog.princeton.edu:7090/voyager;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Publisher's note: ``Mathematician Alan Turing invented
an imaginary computer known as the Turing Machine; in
an age before computers, he explored the concept of
what it meant to be computable, creating the field of
computability theory in the process, a foundation of
present-day computer programming. The book expands
Turing's original 36-page paper with additional
background chapters and extensive annotations; the
author elaborates on and clarifies many of Turing's
statements, making the original difficult-to-read
document accessible to present day programmers,
computer science majors, math geeks, and others.
Interwoven into the narrative are the highlights of
Turing's own life: his years at Cambridge and
Princeton, his secret work in cryptanalysis during
World War II, his involvement in seminal computer
projects, his speculations about artificial
intelligence, his arrest and prosecution for the crime
of ``gross indecency,'' and his early death by apparent
suicide at the age of 41.''",
acknowledgement = ack-nhfb,
subject = "Turing, Alan Mathison; Turing machines; Computational
complexity",
subject-dates = "1912--1954",
tableofcontents = "This tomb holds Diophantus \\
The irrational and the transcendental \\
Centuries of progress \\
The education of Alan Turing \\
Machines at work \\
Addition and multiplication \\
Also known as subroutines \\
Everything is a number \\
The universal machine \\
Computers and computability \\
Of machines and men \\
Logic and computability \\
Computable functions \\
The major proof \\
The lambda calculus \\
Conceiving the continuum \\
Is everything a turing machine? \\
The long sleep of Diophantus",
}
@Article{Poulos:2008:TSE,
author = "Marios Poulos and George Bokos and Fotios Vaioulis",
title = "Towards the semantic extraction of digital signatures
for librarian image-identification purposes",
journal = j-J-AM-SOC-INF-SCI-TECHNOL,
volume = "59",
number = "5",
pages = "708--718",
month = mar,
year = "2008",
CODEN = "JASIEF",
DOI = "https://doi.org/10.1002/asi.20753",
ISSN = "1532-2882 (print), 1532-2890 (electronic)",
ISSN-L = "1532-2882",
bibdate = "Fri Sep 11 10:42:48 MDT 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jasist.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of the American Society for Information
Science and Technology: JASIST",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1532-2890",
onlinedate = "6 Feb 2008",
}
@Article{Rahaman:2008:CTB,
author = "H. Rahaman and J. Mathew and D. K. Pradhan and A. M.
Jabir",
title = "{C}-testable bit parallel multipliers over {$ {\rm
GF}(2^m) $}",
journal = j-TODAES,
volume = "13",
number = "1",
pages = "5:1--5:??",
month = jan,
year = "2008",
CODEN = "ATASFO",
DOI = "https://doi.org/10.1145/1297666.1297671",
ISSN = "1084-4309 (print), 1557-7309 (electronic)",
ISSN-L = "1084-4309",
bibdate = "Thu Jun 12 18:10:00 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/todaes/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We present a C-testable design of polynomial basis
(PB) bit-parallel (BP) multipliers over GF(2 m ) for
100\% coverage of stuck-at faults. Our design method
also includes the method for test vector generation,
which is simple and efficient. C-testability is
achieved with three control inputs and approximately
6\% additional hardware. Only 8 constant vectors are
required irrespective of the sizes of the fields and
primitive polynomial. We also present a Built-In
Self-Test (BIST) architecture for generating the test
vectors efficiently, which eliminates the need for the
extra control inputs. Since these circuits have
critical applications as parts of cryptography (e. g. ,
Elliptic Curve Crypto (ECC) systems) hardware, the BIST
architecture may provide with added level of security,
as the tests would be done internally and without the
requirement of probing by external testing equipment.
Finally we present experimental results comprising the
area, delay and power of the testable multipliers of
various sizes with the help of the Synopsys{\reg} tools
using UMC 0. 18 micron CMOS technology library.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Design Automation of Electronic
Systems (TODAES)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776",
keywords = "built-in self-test; C-testable; cryptography; digital
signal processing; error control code; fault; Galois
field; multiplier; polynomials; stuck-at fault;
testing; TPG; VLSI design",
}
@Article{Rechberger:2008:NRN,
author = "C. Rechberger and V. Rijmen",
title = "New Results on {NMAC\slash HMAC} when Instantiated
with Popular Hash Functions",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "347--376",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
jucs.bib",
URL = "http://www.jucs.org/jucs_14_3/new_results_on_nmac",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Article{Rijmen:2008:RSA,
author = "Vincent Rijmen and Paulo S. L. M. Barreto and
D{\'e}cio L. Gazzoni Filho",
title = "Rotation symmetry in algebraically generated
cryptographic substitution tables",
journal = j-INFO-PROC-LETT,
volume = "106",
number = "6",
pages = "246--250",
day = "15",
month = jun,
year = "2008",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:04 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Rubin:2008:CFF,
author = "K. Rubin and A. Silverberg",
title = "Compression in Finite Fields and Torus-Based
Cryptography",
journal = j-SIAM-J-COMPUT,
volume = "37",
number = "5",
pages = "1401--1428",
month = "????",
year = "2008",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:21:51 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/37/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Sarikaya:2008:SPT,
author = "Behcet Sarikaya and Xiao Zheng",
title = "{SIP} paging and tracking of wireless {LAN} hosts for
{VoIP}",
journal = j-IEEE-TRANS-NETWORKING,
volume = "16",
number = "3",
pages = "539--548",
month = jun,
year = "2008",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2007.900408",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Wed Oct 22 08:52:30 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "This paper introduces a new paging technique to track
and wake up a mobile node (MN) attached to an access
point (AP) in a wireless LAN network after a session
initiation protocol (SIP) INVITE message is initiated
by a caller. A tracking agent (TA) keeps track of the
mobiles' handoffs between the APs. A paging agent (PA)
triggers the TA to page the mobile when a SIP INVITE is
received for one of its users. The context transfer
feature of our paging protocol allows the paging
messages to deliver the station context in order to
enable faster session reestablishment. The AP then does
onlink paging in a wireless link. SIP extensions are
needed to trigger the PA to start paging MNs to notify
their dormant status using an extended SIP REGISTER
method. Tracking protocol is analyzed to compare soft-
and hard-state approaches for state inconsistency
ratio, message rate, and the overall cost. The
simulation model we developed enables us to evaluate
the traffic introduced by the tracking protocol and the
cache (state) size. Paging protocol is analyzed for CPU
processing times and the transmission delays in the SIP
session setup with paging. Simulation of the paging
with context transfer is used to show the gains in
reauthentication.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "context transfer; fluid flow and random walk mobility
model; onlink paging; paging agent (PA); session
initiation protocol (SIP); tracking agent (TA)",
}
@Book{Schneier:2008:SS,
author = "Bruce Schneier",
title = "Schneier on Security",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "viii + 328",
year = "2008",
ISBN = "0-470-39535-4",
ISBN-13 = "978-0-470-39535-6",
LCCN = "QA76.9.A25.S35145 2008",
bibdate = "Tue Sep 23 17:53:51 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.mit.edu:9909/mit01",
acknowledgement = ack-nhfb,
subject = "computer security; United States; computer networks;
security measures; privacy, right of; terrorism;
prevention",
tableofcontents = "1. Terrorism and Security \\
2. National Security Policy \\
3. Airline Travel \\
4. Privacy and Surveillance \\
5. ID Cards and Security \\
6. Election Security \\
7. Security and Disasters \\
8. Economics of Security \\
9. Psychology of Security \\
10. Business of Security \\
11. Cybercrime and Cyberwar \\
12. Computer and Information Security \\
A. References",
}
@Article{Seidl:2008:FOV,
author = "Helmut Seidl and Kumar Neeraj Verma",
title = "Flat and one-variable clauses: {Complexity} of
verifying cryptographic protocols with single blind
copying",
journal = j-TOCL,
volume = "9",
number = "4",
pages = "28:1--28:??",
month = aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1380572.1380577",
ISSN = "1529-3785 (print), 1557-945X (electronic)",
ISSN-L = "1529-3785",
bibdate = "Fri Aug 29 14:02:20 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tocl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tocl.bib",
abstract = "Cryptographic protocols with single blind copying were
defined and modeled by Comon and Cortier using the new
class C of first-order clauses. They showed its
satisfiability problem to be in 3-DEXPTIME. We improve
this result by showing that satisfiability for this
class is NEXPTIME-complete, using new resolution
techniques. We show satisfiability to be
DEXPTIME-complete if clauses are Horn, which is what is
required for modeling cryptographic protocols. While
translation to Horn clauses only gives a DEXPTIME upper
bound for the secrecy problem for these protocols, we
further show that this secrecy problem is actually
DEXPTIME-complete.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Transactions on Computational Logic",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J773",
keywords = "cryptographic protocols; first-order logic; Horn
clauses; instantiation-based theorem proving;
resolution",
}
@InProceedings{Shaltiel:2008:HAP,
author = "Ronen Shaltiel and Emanuele Viola",
title = "Hardness amplification proofs require majority",
crossref = "ACM:2008:SPA",
pages = "589--598",
year = "2008",
DOI = "https://doi.org/10.1145/1374376.1374461",
bibdate = "Fri Jun 20 18:31:53 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Hardness amplification is the fundamental task of
converting a $ \delta $-hard function $ f : (0, 1)^n
\rightarrow (0, 1) $ into a ($ 1 / 2 - \epsilon $
)-hard function $ \Amp (f) $, where $f$ is $ \gamma
$-hard if small circuits fail to compute $f$ on at
least a $ \gamma $ fraction of the inputs. Typically, $
\epsilon $, $ \delta $ are small (and $ \delta = 2^{-k}
$ captures the case where $f$ is worst-case hard).
Achieving $ \epsilon = 1 / n^{\Omega (1)} $ is a
prerequisite for cryptography and most
pseudorandom-generator constructions.\par
In this paper we study the complexity of black-box
proofs of hardness amplification. A class of circuits
cal $D$ {\em proves\/} a hardness amplification result
if for any function $h$ that agrees with $ \Amp (f) $
on a $ 1 / 2 + e $ fraction of the inputs there exists
an oracle circuit $ D \in D $ such that $ D^h $ agrees
with $f$ on a $ 1 - \delta $ fraction of the inputs. We
focus on the case where every $ D \in D $ makes {\em
non-adaptive\/} queries to $h$. This setting captures
most hardness amplification techniques. We prove two
main results:\par
(1) The circuits in $D$ `can be used' to compute the
majority function on $ 1 / \epsilon $ bits. In
particular, these circuits have large depth when $
\epsilon \leq 1 / \poly \log n $. \par
(2) The circuits in $D$ must make $ \Omega \log (1 /
\delta) / e^2 $ oracle queries.\par
Both our bounds on the depth and on the number of
queries are tight up to constant factors.\par
Our results explain why hardness amplification
techniques have failed to transform known lower bounds
against constant-depth circuit classes into strong
average-case lower bounds. When coupled with the
celebrated `Natural Proofs' result by Razborov and
Rudich (J. CSS '97) and the pseudorandom functions by
Naor and Reingold (J. ACM '04), our results show that
{\em standard techniques for hardness amplification can
only be applied to those circuit classes for which
standard techniques cannot prove circuit lower
bounds.}\par
Our results reveal a contrast between Yao's XOR Lemma
($ \Amp (f) := f(x_1) \oplus \ldots {} \oplus f(x_t)
\in z o $ and the Direct-Product Lemma $ (\Amp (f) :=
f(x_1) \circ \ldots {} \circ f(x_t) \in z o^t) $; here
$ \Amp (f) $ is non-Boolean). Our results (1) and (2)
apply to Yao's XOR lemma, whereas known proofs of the
direct-product lemma violate both (1) and (2).\par
One of our contributions is a new technique to handle
`non-uniform' reductions, i.e. the case when $D$
contains many circuits.",
acknowledgement = ack-nhfb,
keywords = "amplification; average-case complexity; black-box;
constant-depth circuits; hardness; majority; natural
proofs",
}
@Article{Shi:2008:UAU,
author = "Minghui Shi and Xuemin (Sherman) Shen and Jon W. Mark
and Dongmei Zhao and Yixin Jiang",
title = "User authentication and undeniable billing support for
agent-based roaming service in {WLAN\slash cellular}
integrated mobile networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "52",
number = "9",
pages = "1693--1702",
day = "26",
month = jun,
year = "2008",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:26 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Book{Shih:2008:DWS,
author = "Frank Y. Shih",
title = "Digital Watermarking and Steganography: Fundamentals
and Techniques",
publisher = pub-TAYLOR-FRANCIS,
address = pub-TAYLOR-FRANCIS:adr,
pages = "180",
year = "2008",
ISBN = "1-4200-4757-4",
ISBN-13 = "978-1-4200-4757-8",
LCCN = "QA76.9.A25 S467 2008",
bibdate = "Wed Jul 7 08:55:32 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0745/2007034224-d.html;
http://www.loc.gov/catdir/toc/ecip0725/2007034224.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Multimedia systems; Security
measures; Intellectual property",
tableofcontents = "Ch. 1. Introduction \\
Ch. 2. Classification in Digital Watermarking \\
Ch. 3. Mathematical Preliminaries \\
Ch. 4. Digital Watermarking Fundamentals \\
Ch. 3. Watermarking Attacks and Tools \\
Ch. 6. Combinational Digital Watermarking in the
Spatial and Frequency Domains \\
Ch. 7. Genetic Algorithm-Based Digital Watermarking \\
Ch. 8. Adjusted-Purpose Digital Watermarking \\
Ch. 9. Robust High-Capacity Digital Watermarking \\
Ch. 10. Introduction to Digital Steganography \\
Ch. 11. Steganalysis \\
Ch. 12. Genetic Algorithm-Based Steganography",
}
@Article{Smith-Miles:2008:CDP,
author = "Kate A. Smith-Miles",
title = "Cross-disciplinary perspectives on meta-learning for
algorithm selection",
journal = j-COMP-SURV,
volume = "41",
number = "1",
pages = "6:1--6:25",
month = dec,
year = "2008",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1456650.1456656",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Jan 12 16:47:51 MST 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The algorithm selection problem [Rice 1976] seeks to
answer the question: {\em Which algorithm is likely to
perform best for my problem?\/} Recognizing the problem
as a learning task in the early 1990's, the machine
learning community has developed the field of
meta-learning, focused on learning about learning
algorithm performance on classification problems. But
there has been only limited generalization of these
ideas beyond classification, and many related attempts
have been made in other disciplines (such as AI and
operations research) to tackle the algorithm selection
problem in different ways, introducing different
terminology, and overlooking the similarities of
approaches. In this sense, there is much to be gained
from a greater awareness of developments in
meta-learning, and how these ideas can be generalized
to learn about the behaviors of other (nonlearning)
algorithms. In this article we present a unified
framework for considering the algorithm selection
problem as a learning problem, and use this framework
to tie together the crossdisciplinary developments in
tackling the algorithm selection problem. We discuss
the generalization of meta-learning concepts to
algorithms focused on tasks including sorting,
forecasting, constraint satisfaction, and optimization,
and the extension of these ideas to bioinformatics,
cryptography, and other fields.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Algorithm selection; classification; combinatorial
optimization; constraint satisfaction; dataset
characterization; empirical hardness; forecasting;
landscape analysis; meta-learning; model selection;
sorting",
}
@Article{Smith:2008:CFI,
author = "Don Smith",
title = "The challenge of federated identity management",
journal = j-NETWORK-SECURITY,
volume = "2008",
number = "4",
pages = "7--9",
month = apr,
year = "2008",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(08)70051-5",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 16:59:50 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485808700515",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Book{Stein:2008:ENT,
author = "William Stein",
title = "Elementary number theory: primes, congruences, and
secrets",
volume = "666",
publisher = pub-SV,
address = pub-SV:adr,
pages = "175 (est.)",
year = "2008",
ISBN = "0-387-85524-6",
ISBN-13 = "978-0-387-85524-0",
LCCN = "????",
bibdate = "Wed Nov 26 15:02:38 MST 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Undergraduate texts in mathematics",
acknowledgement = ack-nhfb,
}
@Article{Steinwandt:2008:GEI,
author = "Rainer Steinwandt and Willi Geiselmann and {\c{C}}etin
Kaya Ko{\c{c}}",
title = "{Guest Editors}' Introduction to the Special Section
on Special-Purpose Hardware for Cryptography and
Cryptanalysis",
journal = j-IEEE-TRANS-COMPUT,
volume = "57",
number = "11",
pages = "1441--1442",
month = nov,
year = "2008",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.188",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 12:17:44 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4633726",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Sun:2008:BWN,
author = "Shusen Sun and Zhigeng Pan and Tae-Wan Kim",
title = "Blind Watermarking of Non-Uniform {B}-Spline
Surfaces",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "8",
number = "3",
pages = "439--454",
month = jul,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467808003179",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Sutherland:2008:AVO,
author = "Iain Sutherland and Jon Evans and Theodore Tryfonas
and Andrew Blyth",
title = "Acquiring volatile operating system data tools and
techniques",
journal = j-OPER-SYS-REV,
volume = "42",
number = "3",
pages = "65--73",
month = apr,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1368506.1368516",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:21:09 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The current approach to forensic examination during
search and seizure has predominantly been to pull the
plug on the suspect machine and subsequently perform a
post mortem examination on the storage medium. However,
with the advent of larger capacities of memory, drive
encryption and anti-forensics, this procedure may
result in the loss of valuable evidence. Volatile data
may be vital in determining criminal activity; it may
contain passwords used for encryption, indications of
anti-forensic techniques, memory resident malware which
would otherwise go unnoticed by the investigator. This
paper emphasizes the importance of understanding the
potential value of volatile data and how best to
collate forensic artifacts to the benefit of the
investigation, ensuring the preservation and integrity
of the evidence. The paper will review current methods
for volatile data collection, assessing the
capabilities, limitations and liabilities of current
tools and techniques available to the forensic
investigator.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "forensics; live acquisition; volatile data",
}
@Book{Swenson:2008:MCT,
author = "Christopher Swenson",
title = "Modern cryptanalysis: techniques for advanced code
breaking",
publisher = pub-WILEY,
address = pub-WILEY:adr,
pages = "xxviii + 236",
year = "2008",
ISBN = "0-470-13593-X (cloth)",
ISBN-13 = "978-0-470-13593-8 (cloth)",
LCCN = "QA76.9.A25 S932 2008",
bibdate = "Sat May 15 09:17:07 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy0806/2007051636-d.html;
http://www.loc.gov/catdir/enhancements/fy0808/2007051636-t.html;
http://www.loc.gov/catdir/enhancements/fy0810/2007051636-b.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Data encryption (Computer science);
Cryptography",
tableofcontents = "Simple ciphers \\
Number theoretical ciphers \\
Factoring and discrete logarithms \\
Block ciphers \\
General cryptanalytic methods \\
Linear cryptanalysis \\
Differential cryptanalysis",
}
@Article{Terai:2008:BRB,
author = "S. Terai",
title = "Book Review: {{\booktitle{Cryptography in C and C++}},
by Michael Welschenbach, Apress, 2005}",
journal = j-SIGACT,
volume = "39",
number = "1",
pages = "12--16",
month = mar,
year = "2008",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1360443.1360446",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:30 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Terai08;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See
\cite{Welschenbach:2001:CCC,Welschenbach:2005:CCC}.",
URL = "http://doi.acm.org/10.1145/1360443.1360446",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@InProceedings{Thamrin:2008:PBR,
author = "N. M. Thamrin and G. Witjaksono and A. Nuruddin and M.
S. Abdullah",
booktitle = "{Ninth ACIS International Conference on Software
Engineering, Artificial Intelligence, Networking, and
Parallel\slash Distributed Computing 2008. SNPD '08}",
title = "A Photonic-based Random Number Generator for
Cryptographic Application",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "356--361",
year = "2008",
DOI = "https://doi.org/10.1109/SNPD.2008.151",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4617397",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4617324",
}
@Article{Toll:2008:CSE,
author = "David C. Toll and Paul A. Karger and Elaine R. Palmer
and Suzanne K. McIntosh and Sam Weber",
title = "The {Caernarvon} secure embedded operating system",
journal = j-OPER-SYS-REV,
volume = "42",
number = "1",
pages = "32--39",
month = jan,
year = "2008",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1341312.1341320",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Fri Jun 20 17:19:29 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The Caernarvon operating system was developed to
demonstrate that a high assurance system for smart
cards was technically feasible and commercially viable.
The entire system has been designed to be evaluated
under the Common Criteria at EAL7, the highest defined
level of assurance.\par
Historically, smart card processors have not supported
the hardware protection features necessary to separate
the OS from the applications, and one application from
another. The Caernarvon OS has taken advantage of the
first smart card processors with such features to be
the first smart card OS to provide this kind of
protection. Even when compared with conventional
systems where the hardware protection is routine, the
Caernarvon OS is noteworthy, because of the EAL7
assurance.\par
This approach facilitated implementation of a formally
specified, mandatory security policy providing
multi-level security (MLS) suitable for both government
agencies and commercial users. The mandatory security
policy requires effective authentication of its users
that is independent of applications. For this reason,
the Caernarvon OS also contains a privacy-preserving,
two-way authentication protocol integrated with the
Mandatory Security Policy.\par
The Caernarvon OS includes a strong cryptographic
library that has been separately certified under the
Common Criteria at EAL5+ for use with other systems.
The Caernarvon OS implements a secure method for
downloading trusted and untrusted application software
and data in the field, with the assumption that all
applications are potentially hostile. While the initial
platform for the operating system was smart cards, the
design could also be used in other embedded devices,
such as USB tokens, PDAs, cell phones, etc.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "common criteria evaluation; embedded systems;
mandatory access controls; mobile phones; operating
systems; PDAs; smart cards",
}
@Article{Troutman:2008:VMM,
author = "Justin Troutman",
title = "The Virtues of Mature and Minimalist Cryptography",
journal = j-IEEE-SEC-PRIV,
volume = "6",
number = "4",
pages = "62--65",
month = jul # "\slash " # aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2008.99",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 6 14:53:07 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Tsai:2008:EMS,
author = "Jia-Lun Tsai",
title = "Efficient multi-server authentication scheme based on
one-way hash function without verification table",
journal = j-COMPUT-SECUR,
volume = "27",
number = "3--4",
pages = "115--121",
month = may # "\slash " # jun,
year = "2008",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:10 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000084",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Unay:2008:SQE,
author = "Ozan {\"U}nay and Taflan I. G{\"u}ndem",
title = "A survey on querying encrypted {XML} documents for
databases as a service",
journal = j-SIGMOD,
volume = "37",
number = "1",
pages = "12--20",
month = mar,
year = "2008",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/1374780.1374783",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Tue Jun 17 16:20:43 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "'Database as a service' paradigm has gained a lot of
interest in recent years. This has raised questions
about the security of data in the servers. Firms
outsourcing their XML databases to untrusted parties
started to look for new ways to securely store data and
efficiently query them. In this paper, encrypted XML
documents, their crypto index structures and query
processing using these structures are investigated. A
comparison of various algorithms in the literature is
given.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMOD Record",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
keywords = "database as a service; encryption; querying encrypted
XML document algorithms; XML",
}
@Article{vanOorschot:2008:PMU,
author = "P. C. van Oorschot and Julie Thorpe",
title = "On predictive models and user-drawn graphical
passwords",
journal = j-TISSEC,
volume = "10",
number = "4",
pages = "5:1--5:??",
month = jan,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1284680.1284685",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:24 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "In commonplace text-based password schemes, users
typically choose passwords that are easy to recall,
exhibit patterns, and are thus vulnerable to
brute-force dictionary attacks. This leads us to ask
whether other types of passwords (e. g. , graphical)
are also vulnerable to dictionary attack because of
users tending to choose memorable passwords. We suggest
a method to predict and model a number of such classes
for systems where passwords are created solely from a
user's memory. We hypothesize that these classes define
weak password subspaces suitable for an attack
dictionary. For user-drawn graphical passwords, we
apply this method with cognitive studies on visual
recall. These cognitive studies motivate us to define a
set of password complexity factors (e. g. , reflective
symmetry and stroke count), which define a set of
classes. To better understand the size of these classes
and, thus, how weak the password subspaces they define
might be, we use the ``Draw-A-Secret'' (DAS) graphical
password scheme of Jermyn et al. [1999] as an example.
We analyze the size of these classes for DAS under
convenient parameter choices and show that they can be
combined to define apparently popular subspaces that
have bit sizes ranging from 31 to 41---a surprisingly
small proportion of the full password space (58 bits).
Our results quantitatively support suggestions that
user-drawn graphical password systems employ measures,
such as graphical password rules or guidelines and
proactive password checking.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "dictionary attack; Draw-a-Secret; graphical
dictionary; Graphical passwords; memorable passwords;
modeling user choice; password complexity factors",
}
@Article{Vo:2008:SMA,
author = "Duc-Liem Vo and Kwangjo Kim",
title = "A secure mutual authentication scheme with key
agreement using smart card from bilinear pairings",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "23",
number = "3",
pages = "??--??",
month = may,
year = "2008",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:41:11 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Article{Voyiatzis:2008:SFS,
author = "Artemios G. Voyiatzis and Dimitrios N. Serpanos",
title = "The security of the {Fiat--Shamir} scheme in the
presence of transient hardware faults",
journal = j-TECS,
volume = "7",
number = "3",
pages = "31:1--31:??",
month = apr,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1347375.1347384",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Jun 12 15:22:21 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Implementation cryptanalysis has emerged as a
realistic threat for cryptographic systems. It consists
of two classes of attacks: fault-injection and
side-channel attacks. In this work, we examine the
resistance of the Fiat--Shamir scheme to
fault-injection attacks, since Fiat--Shamir is a
popular scheme for ``light'' consumer devices, such as
smartcards, in a wide range of consumer services. We
prove that an existing attack, known as the Bellcore
attack, is incomplete. We propose an extension to the
protocol that proactively secures Fiat--Shamir systems
from the Bellcore attack and we prove its strength.
Finally, we introduce a new attack model, which, under
stronger assumptions, can derive the secret keys from
both the original Fiat--Shamir scheme as well as its
proposed extension. Our approach demonstrates that
countermeasures for implementation cryptanalysis must
be carefully designed and that deployed systems must
include appropriate protection mechanisms for all known
attacks and be flexible enough to incorporate
countermeasures for new ones.",
acknowledgement = ack-nhfb,
articleno = "31",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "Bellcore attack; cryptography; Fiat--Shamir
identification scheme; side-channel attacks;
smartcards",
}
@Article{Wang:2008:DCP,
author = "Xing-Yuan Wang and Xiao-Juan Wang",
title = "Design of chaotic pseudo-random bit generator and its
applications in stream-cipher cryptography",
journal = j-INT-J-MOD-PHYS-C,
volume = "19",
number = "5",
pages = "813--820",
month = may,
year = "2008",
CODEN = "IJMPEO",
DOI = "https://doi.org/10.1142/S0129183108012479",
ISSN = "0129-1831 (print), 1793-6586 (electronic)",
bibdate = "Thu Feb 23 22:12:58 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.worldscinet.com/ijmpc/19/1905/S0129183108012479.html",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Modern Physics C [Physics and
Computers]",
journal-URL = "http://www.worldscientific.com/loi/ijmpc",
}
@Article{Wang:2008:HQS,
author = "Chung-Ming Wang and Nan-I Wu and Chwei-Shyong Tsai and
Min-Shiang Hwang",
title = "A high quality steganographic method with pixel-value
differencing and modulus function",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "1",
pages = "150--158",
month = jan,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:03 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wang:2008:NAD,
author = "Xiang-Yang Wang and Pan-Pan Niu and Wei Qi",
title = "A new adaptive digital audio watermarking based on
support vector machine",
journal = j-J-NETW-COMPUT-APPL,
volume = "31",
number = "4",
pages = "735--749",
month = nov,
year = "2008",
CODEN = "JNCAF3",
ISSN = "1084-8045 (print), 1095-8592 (electronic)",
ISSN-L = "1084-8045",
bibdate = "Wed Jan 28 15:43:22 MST 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1084804507000525",
acknowledgement = ack-nhfb,
ajournal = "J. Netw. Comput. Appl.",
fjournal = "Journal of Network and Computer Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/10848045",
}
@Article{Washington:2008:BRB,
author = "Lawrence C. Washington",
title = "Book Review: {{\booktitle{Handbook of Elliptic and
Hyperelliptic Curve Cryptography}}, by H. Cohen and G.
Frey, Chapman \& Hall\slash CRC, 2006, 1-58488-518-1}",
journal = j-SIGACT,
volume = "39",
number = "1",
pages = "19--22",
month = mar,
year = "2008",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1360443.1360448",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:30 MDT 2012",
bibsource = "DBLP;
http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Washington08;
http://portal.acm.org/;
https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2008.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
note = "See \cite{Cohen:2006:HEH}.",
URL = "http://doi.acm.org/10.1145/1360443.1360448",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Book{Washington:2008:ECN,
author = "Lawrence C. Washington",
title = "Elliptic curves: number theory and cryptography",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Second",
pages = "xviii + 513",
year = "2008",
ISBN = "1-4200-7146-7 (hardcover)",
ISBN-13 = "978-1-4200-7146-7 (hardcover)",
LCCN = "QA567.2.E44 W37 2008",
bibdate = "Sat Jun 13 08:32:16 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Discrete mathematics and its applications",
acknowledgement = ack-nhfb,
subject = "curves, elliptic; number theory; cryptography",
}
@Article{Watters:2008:VDL,
author = "Paul Watters and Frances Martin and H. Steffen
Stripf",
title = "Visual detection of {LSB}-encoded natural image
steganography",
journal = j-TAP,
volume = "5",
number = "1",
pages = "5:1--5:??",
month = jan,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1279640.1328775",
ISSN = "1544-3558 (print), 1544-3965 (electronic)",
ISSN-L = "1544-3558",
bibdate = "Mon Jun 16 14:17:20 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Many steganographic systems embed hidden messages
inside the least significant bit layers of colour
natural images. The presence of these messages can be
difficult to detect by using statistical steganalysis.
However, visual steganalysis by humans may be more
successful in natural image discrimination. This study
examined whether humans could detect least-significant
bit steganography in 15 color natural images from the
VisTex database using a controlled same/different task
($ N = 58 $ ) and a yes/no task ($ N = 61 $ ). While $
d \prime > 1 $ was observed for color layers 4--8,
layers 1--3 had $ d \prime < 1 $ in both experiments.
Thus, layers 1--3 appear to be highly resistant to
visual steganalysis.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Applied Perception (TAP)",
keywords = "counterterrorism; Steganography",
}
@Article{Webb:2008:IZN,
author = "Charles F. Webb",
title = "{IBM z10}: The Next-Generation Mainframe
Microprocessor",
journal = j-IEEE-MICRO,
volume = "28",
number = "2",
pages = "19--29",
month = mar # "\slash " # apr,
year = "2008",
CODEN = "IEMIDZ",
DOI = "https://doi.org/10.1109/MM.2008.26",
ISSN = "0272-1732 (print), 1937-4143 (electronic)",
ISSN-L = "0272-1732",
bibdate = "Wed Jul 2 21:58:04 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The IBM system z10 includes four microprocessor cores
--- each with a private 3-Mbyte cache --- and
integrated accelerators for decimal floating-point
computation, cryptography, and data compression. A
separate SMP hub chip provides a shared third-level
cache and interconnect fabric for multiprocessor
scaling. This article focuses on the high-frequency
design techniques used to achieve a 4.4-GHz system, and
on the pipeline design that optimizes z10's CPU
performance.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Micro",
journal-URL = "http://www.computer.org/csdl/mags/mi/index.html",
keywords = "decimal floating-point arithmetic",
}
@Article{Weigold:2008:RCA,
author = "Thomas Weigold and Thorsten Kramp and Michael
Baentsch",
title = "Remote Client Authentication",
journal = j-IEEE-SEC-PRIV,
volume = "6",
number = "4",
pages = "36--43",
month = jul # "\slash " # aug,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2008.93",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Aug 6 14:53:07 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Weitzner:2008:IA,
author = "Daniel J. Weitzner and Harold Abelson and Tim
Berners-Lee and Joan Feigenbaum and James Hendler and
Gerald Jay Sussman",
title = "Information accountability",
journal = j-CACM,
volume = "51",
number = "6",
pages = "82--87",
month = jun,
year = "2008",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1349026.1349043",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Mon Jun 16 18:37:21 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "With access control and encryption no longer capable
of protecting privacy, laws and systems are needed that
hold people accountable for the misuse of personal
information, whether public or secret.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Wu:2008:RPG,
author = "Tzong-Chen Wu and Thsia-Tzu Huang and Chien-Lung Hsu
and Kuo-Yu Tsai",
title = "Recursive protocol for group-oriented authentication
with key distribution",
journal = j-J-SYST-SOFTW,
volume = "81",
number = "7",
pages = "1227--1239",
month = jul,
year = "2008",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:04 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Wu:2008:RWM,
author = "Xiaomao Wu and Lizhuang Ma and Zhuoqun Dong and Lionel
Rev{\'e}ret",
title = "Robust watermarking motion data with {DL-STDM}",
journal = j-COMPUTERS-AND-GRAPHICS,
volume = "32",
number = "3",
pages = "320--329",
month = jun,
year = "2008",
CODEN = "COGRD2",
DOI = "https://doi.org/10.1016/j.cag.2008.04.002",
ISSN = "0097-8493 (print), 1873-7684 (electronic)",
ISSN-L = "0097-8493",
bibdate = "Mon Feb 13 16:41:57 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/compgraph.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00978493",
URL = "http://www.sciencedirect.com/science/article/pii/S0097849308000447",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Graphics",
journal-URL = "http://www.sciencedirect.com/science/journal/00978493",
}
@Article{Xiang:2008:CPA,
author = "Tao Xiang and Kwok-wo Wong and Xiaofeng Liao",
title = "Cryptanalysis of a password authentication scheme over
insecure networks",
journal = j-J-COMP-SYS-SCI,
volume = "74",
number = "5",
pages = "657--661",
month = aug,
year = "2008",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2007.05.001",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:08 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000007000657",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Yang:2008:FSD,
author = "G. Yang and D. S. Wong and X. Deng",
title = "Formal Security Definition and Efficient Construction
for Roaming with a Privacy-Preserving Extension",
journal = j-J-UCS,
volume = "14",
number = "3",
pages = "441--462",
month = "????",
year = "2008",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Thu Jul 10 06:41:41 MDT 2008",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_14_3/formal_security_definition_and",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
keywords = "cryptography",
}
@Article{Yang:2008:NFD,
author = "Guomin Yang and Jing Chen and Duncan S. Wong and
Xiaotie Deng and Dongsheng Wang",
title = "A new framework for the design and analysis of
identity-based identification schemes",
journal = j-THEOR-COMP-SCI,
volume = "407",
number = "1--3",
pages = "370--388",
day = "6",
month = nov,
year = "2008",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:42 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Yang:2008:TFM,
author = "Guomin Yang and Duncan S. Wong and Huaxiong Wang and
Xiaotie Deng",
title = "Two-factor mutual authentication based on smart cards
and passwords",
journal = j-J-COMP-SYS-SCI,
volume = "74",
number = "7",
pages = "1160--1172",
month = nov,
year = "2008",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2008.04.002",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:08 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000008000482",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Yang:2008:VCS,
author = "Ching-Nung Yang and Chung-Chun Wang and Tse-Shih
Chen",
title = "Visual Cryptography Schemes with Reversing",
journal = j-COMP-J,
volume = "51",
number = "6",
pages = "710--722",
month = nov,
year = "2008",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/bxm118",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Wed Apr 28 14:33:34 MDT 2010",
bibsource = "http://comjnl.oxfordjournals.org/content/vol51/issue6/index.dtl;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://comjnl.oxfordjournals.org/cgi/content/abstract/51/6/710;
http://comjnl.oxfordjournals.org/cgi/content/full/51/6/710;
http://comjnl.oxfordjournals.org/cgi/reprint/51/6/710",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}
@Article{Yardi:2008:HAC,
author = "Sarita Yardi and Pamela Krolikowski and Taneshia
Marshall and Amy Bruckman",
title = "An {HCI} Approach to Computing in the Real World",
journal = j-JERIC,
volume = "8",
number = "3",
pages = "9:1--9:??",
month = oct,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1404935.1404938",
ISSN = "1531-4278",
bibdate = "Fri Oct 10 12:52:01 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/jeric/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We describe the implementation of a six-week course to
teach Human-Computer Interaction (HCI) to high school
students. Our goal was to explore the potential of HCI
in motivating students to pursue future studies in
related computing fields. Participants in our course
learned to make connections between the types of
technology they use in their daily lives and the design
processes that went into creating these technologies.
We suggest that by portraying computing through the
lens of HCI, as an innovative, creative, and
challenging field with authentic, real-world
applications, we may be able to motivate students to
become more interested in computing.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Journal on Educational Resources in Computing
(JERIC)",
keywords = "broadening participation in computing; education;
human-computer interaction; K-12 curriculum;
motivation",
}
@Article{Yasuda:2008:DLP,
author = "Masaya Yasuda",
title = "The discrete logarithm problem on elliptic curves
defined over {$Q$} (abstract only)",
journal = j-ACM-COMM-COMP-ALGEBRA,
volume = "42",
number = "1--2",
pages = "64--66",
month = mar # "/" # jun,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1394042.1394074",
ISSN = "1932-2232 (print), 1932-2240 (electronic)",
ISSN-L = "1932-2232",
bibdate = "Tue Aug 12 17:30:40 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Communications in Computer Algebra",
keywords = "cryptography",
}
@Article{Yeh:2008:STB,
author = "Jyh-haw Yeh",
title = "A secure time-bound hierarchical key assignment scheme
based on {RSA} public key cryptosystem",
journal = j-INFO-PROC-LETT,
volume = "105",
number = "4",
pages = "117--120",
day = "15",
month = feb,
year = "2008",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:52:57 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Yiu:2008:ODC,
author = "Wai-Pun Ken Yiu and Shueng-Han Gary Chan",
title = "Offering data confidentiality for multimedia overlay
multicast: {Design} and analysis",
journal = j-TOMCCAP,
volume = "5",
number = "2",
pages = "13:1--13:??",
month = nov,
year = "2008",
CODEN = "????",
DOI = "https://doi.org/10.1145/1413862.1413866",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Mar 16 18:52:17 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Application layer multicast (ALM) has been proposed to
overcome current limitations in IP multicast for
large-group multimedia communication. We address
offering data confidentiality tailored for ALM. To
achieve confidentiality, a node may need to
continuously {\em re-encrypt\/} packets before
forwarding them downstream. Furthermore, keys have to
be changed whenever there is a membership change,
leading to {\em rekey\/} processing overhead at the
nodes. For a large and dynamic group, these
reencryption and rekeying operations incur high
processing overhead at the nodes. We propose and
analyze a scalable scheme called Secure Overlay
Multicast (SOM) which clusters ALM peers so as to
localize rekeying within a cluster and to limit
re-encryption at cluster boundaries, thereby minimizing
the total nodal processing overhead. We describe the
operations of SOM and compare its nodal processing
overhead with two other basic approaches, namely,
host-to-host encryption and whole group encryption. We
also present a simplified analytic model for SOM and
show that there exists an optimal cluster size to
minimize the total nodal processing overhead. By
comparing with a recently proposed ALM scheme (DT
protocol), SOM achieves a substantial reduction in
nodal processing overhead with similar network
performance in terms of network stress and delay.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "Key management; multicast security; overlay multicast;
performance analysis",
}
@Article{Youn:2008:WRB,
author = "Taek-Young Youn and Young-Ho Park and Changhan Kim and
Jongin Lim",
title = "Weakness in a {RSA}-based password authenticated key
exchange protocol",
journal = j-INFO-PROC-LETT,
volume = "108",
number = "6",
pages = "339--342",
day = "30",
month = nov,
year = "2008",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:17 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Zhang:2008:CLR,
author = "Yu Zhang",
title = "Cryptographic logical relations",
journal = j-THEOR-COMP-SCI,
volume = "394",
number = "1--2",
pages = "39--63",
day = "31",
month = mar,
year = "2008",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:49:13 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Zhang:2008:FIC,
author = "Qing Zhang and Ting Yu and Peng Ning",
title = "A Framework for Identifying Compromised Nodes in
Wireless Sensor Networks",
journal = j-TISSEC,
volume = "11",
number = "3",
pages = "12:1--12:??",
month = mar,
year = "2008",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1341731.1341733",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu Jun 12 17:52:50 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tissec.bib",
abstract = "Sensor networks are often subject to physical attacks.
Once a node's cryptographic key is compromised, an
attacker may completely impersonate it and introduce
arbitrary false information into the network. Basic
cryptographic mechanisms are often not effective in
this situation. Most techniques to address this problem
focus on detecting and tolerating false information
introduced by compromised nodes. They cannot pinpoint
exactly where the false information is introduced and
who is responsible for it. \par
In this article, we propose an application-independent
framework for accurately identifying compromised sensor
nodes. The framework provides an appropriate
abstraction of application-specific detection
mechanisms and models the unique properties of sensor
networks. Based on the framework, we develop alert
reasoning algorithms to identify compromised nodes. The
algorithm assumes that compromised nodes may collude at
will. We show that our algorithm is optimal in the
sense that it identifies the largest number of
compromised nodes without introducing false positives.
We evaluate the effectiveness of the designed algorithm
through comprehensive experiments.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "intrusion detection; sensor networks",
}
@Article{Zhong:2008:GPT,
author = "Sheng Zhong and Zhiqiang Yang",
title = "Guided perturbation: towards private and accurate
mining",
journal = j-VLDB-J,
volume = "17",
number = "5",
pages = "1165--1177",
month = aug,
year = "2008",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-007-0056-z",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Thu Jul 10 10:00:50 MDT 2008",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "There have been two methods for privacy- preserving
data mining: the perturbation approach and the
cryptographic approach. The perturbation approach is
typically very efficient, but it suffers from a
tradeoff between accuracy and privacy. In contrast, the
cryptographic approach usually maintains accuracy, but
it is more expensive in computation and communication
overhead. We propose a novel perturbation method,
called guided perturbation. Specifically, we focus on a
central problem of privacy-preserving data mining--the
secure scalar product problem of vertically partitioned
data, and give a solution based on guided perturbation,
with good, provable privacy guarantee. Our solution
achieves accuracy comparable to the cryptographic
solutions, while keeping the efficiency of perturbation
solutions. Our experimental results show that it can be
more than one hundred times faster than a typical
cryptographic solution.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
}
@Article{Ababneh:2009:CSE,
author = "Sufyan Ababneh and Rashid Ansari and Ashfaq Khokhar",
title = "Compensated Signature Embedding for Multimedia Content
Authentication",
journal = j-JDIQ,
volume = "1",
number = "3",
pages = "17:1--17:??",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1659225.1659230",
ISSN = "1936-1955",
bibdate = "Wed Mar 17 14:47:55 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/jdqi/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "One of the main goals of digital content
authentication and preservation techniques is to
guarantee the originality and quality of the
information. In this article, robust watermarking is
used to embed content-based fragile signatures in
multimedia signals to achieve efficient authentication
without requiring any third-party reference or side
information. To overcome the signature alteration
caused by the embedding perturbation and other possible
encoding operations, a closed-form compensation
technique is proposed for ensuring signature
consistency by employing a Lagrangian-based approach. A
minimum distortion criterion is used to ensure signal
quality. The effectiveness of the proposed approach is
investigated with simulations of examples of image
authentication in which signatures are designed to
reveal tamper localization. Results using quantitative
performance criteria show successful authentication
over a range of robustness in embedding watermarks
using both QIM-DM and spread-spectrum techniques. A
comparison with two iterative compensation schemes is
also presented.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "Journal of Data and Information Quality (JDIQ)",
keywords = "compensated signature embedding; Content
authentication; watermarking",
}
@Article{Acquisti:2009:PSS,
author = "Alessandro Acquisti and Ralph Gross",
title = "Predicting {Social Security} numbers from public
data",
journal = j-PROC-NATL-ACAD-SCI-USA,
volume = "106",
number = "27",
pages = "10975--10980",
day = "7",
month = jul,
year = "2009",
CODEN = "PNASA6",
DOI = "https://doi.org/10.1073/pnas.0904891106",
ISSN = "0027-8424 (print), 1091-6490 (electronic)",
ISSN-L = "0027-8424",
bibdate = "Wed Jul 08 14:24:20 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.pnas.org/content/early/2009/07/02/0904891106.full.pdf",
abstract = "Information about an individual's place and date of
birth can be exploited to predict his or her Social
Security number (SSN). Using only publicly available
information, we observed a correlation between
individuals' SSNs and their birth data and found that
for younger cohorts the correlation allows statistical
inference of private SSNs. The inferences are made
possible by the public availability of the Social
Security Administration's Death Master File and the
widespread accessibility of personal information from
multiple sources, such as data brokers or profiles on
social networking sites. Our results highlight the
unexpected privacy consequences of the complex
interactions among multiple data sources in modern
information economies and quantify privacy risks
associated with information revelation in public
forums.",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the National Academy of Sciences of the
United States of America",
journal-URL = "http://www.pnas.org/search",
keywords = "SSN insecurity",
}
@Article{Adao:2009:SCF,
author = "Pedro Ad{\~a}o and Gergei Bana and Jonathan Herzog and
Andre Scedrov",
title = "Soundness and completeness of formal encryption: The
cases of key cycles and partial information leakage",
journal = j-J-COMP-SECUR,
volume = "17",
number = "5",
pages = "737--797",
month = "????",
year = "2009",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0358",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:26 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Adee:2009:CDT,
author = "S. Adee",
title = "Chip design thwarts sneak attack on data",
journal = j-IEEE-SPECTRUM,
volume = "46",
number = "11",
pages = "16--16",
month = nov,
year = "2009",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2009.5292036",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Books; Chip scale packaging; Computer architecture;
Computer security; Cryptography; Data security;
Degradation; Electrical engineering; Information
retrieval; Power engineering computing",
}
@InProceedings{Adikari:2009:HBT,
author = "Jithra Adikari and Vassil Dimitrov and Laurent
Imbert",
title = "Hybrid Binary-Ternary Joint Form and Its Application
in Elliptic Curve Cryptography",
crossref = "Bruguera:2009:PIS",
pages = "76--83",
year = "2009",
bibdate = "Fri Jun 12 12:34:25 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Multi-exponentiation is a common and time consuming
operation in public-key cryptography. Its elliptic
curve counterpart, called multi-scalar multiplication
is extensively used for digital signature verification.
Several algorithms have been proposed to speed-up those
critical computations. They are based on simultaneously
recoding a set of integers in order to minimize the
number of general multiplications or point additions.
When signed-digit recoding techniques can be used, as
in the world of elliptic curves, Joint Sparse Form
(JSF) and interleaving w-NAF are the most efficient
algorithms. In this paper, a novel recoding algorithm
for a pair of integers is proposed, based on a
decomposition that mixes powers of 2 and powers of 3.
The so-called Hybrid Binary-Ternary Joint Form require
fewer digits and is sparser than the JSF and the
interleaving w-NAF. Its advantages are illustrated for
elliptic curve double-scalar multiplication; the
operation counts show a gain of up to 19\%.",
acknowledgement = ack-nhfb,
keywords = "ARITH-19",
}
@Article{Akinwande:2009:AHC,
author = "M. Akinwande",
title = "Advances in Homomorphic Cryptosystems",
journal = j-J-UCS,
volume = "15",
number = "3",
pages = "506--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 22:38:58 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_3/advances_in_homomorphic_cryptosystems",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Alomair:2009:ITS,
author = "B. Alomair and R. Poovendran",
title = "Information Theoretically Secure Encryption with
Almost Free Authentication",
journal = j-J-UCS,
volume = "15",
number = "15",
pages = "2937--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 21:52:59 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_15/information_theoretically_secure_encryption",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Ambainis:2009:NEQ,
author = "Andris Ambainis and Jan Bouda and Andreas Winter",
title = "Nonmalleable encryption of quantum information",
journal = j-J-MATH-PHYS,
volume = "50",
number = "4",
pages = "042106",
month = apr,
year = "2009",
CODEN = "JMAPAQ",
DOI = "https://doi.org/10.1063/1.3094756",
ISSN = "0022-2488 (print), 1089-7658 (electronic), 1527-2427",
ISSN-L = "0022-2488",
bibdate = "Wed Oct 26 09:06:48 MDT 2011",
bibsource = "http://www.aip.org/ojs/jmp.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jmathphys2005.bib",
URL = "http://jmp.aip.org/resource/1/jmapaq/v50/i4/p042106_s1",
acknowledgement = ack-nhfb,
fjournal = "Journal of Mathematical Physics",
journal-URL = "http://jmp.aip.org/",
onlinedate = "17 April 2009",
pagecount = "8",
}
@Article{Anonymous:2009:BG,
author = "Anonymous",
title = "Breaking GSM",
journal = j-IEEE-SPECTRUM,
volume = "46",
number = "12",
pages = "13--13",
month = dec,
year = "2009",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2009.5340238",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cameras; Charge coupled devices; Communication system
security; Cryptography; Dairy products; GSM; Magnetic
domains; Mobile handsets; Optical arrays; Silicon",
}
@TechReport{Anonymous:2009:DSS,
author = "Anonymous",
key = "FIPS-186-3",
title = "{Digital Signature Standard (DSS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 186-3",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "ix + 119",
month = jun,
year = "2009",
bibdate = "Thu Aug 21 06:15:29 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "Superceded by FIPS 186-4 \cite{Anonymous:2013:DSS}.",
URL = "http://csrc.nist.gov/publications/fips/fips186-3/fips_186-3.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Digital Signature
Standard (DSS); Federal Information Processing
Standards",
}
@Article{Anonymous:2009:PCA,
author = "Anonymous",
title = "Proof of concept attack further discredits {MD5}",
journal = j-NETWORK-SECURITY,
volume = "2009",
number = "1",
pages = "2--2",
month = jan,
year = "2009",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(09)70003-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:00 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485809700030",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
remark = "Discusses successful production of a rogue SSL
certificate with the same checksum as an existing valid
certificate.",
}
@Misc{Anonymous:2009:TCA,
author = "Anonymous",
title = "The Transitioning of Cryptographic Algorithms and Key
Sizes",
howpublished = "Web document",
pages = "10",
day = "2",
month = jul,
year = "2009",
bibdate = "Thu Apr 11 14:05:20 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://csrc.nist.gov/csrc/media/projects/key-management/documents/transitions/transitioning_cryptoalgos_070209.pdf",
abstract = "At the beginning of the century, NIST began the task
of providing cryptographic key management guidance.
This included lessons learned over many years of
dealing with key management issues, and attempts to
encourage the definition and implementation of
appropriate key management procedures, to use
algorithms that adequately protect sensitive
information, and to plan ahead for possible changes in
the use of cryptography because of algorithm breaks or
the availability of more powerful computing techniques.
This guidance is provided in NIST Special Publication
(SP) 800-57.",
acknowledgement = ack-nhfb,
remark = "Revised 7 May 2012.",
}
@Article{Anyanwu:2009:DCS,
author = "Matthew N. Anyanwu and Lih-Yuan Deng and Dipankar
Dasgupta",
title = "Design of Cryptographically Strong Generator By
Linearly Generated Sequences",
journal = j-IJCSS,
volume = "3",
number = "3",
pages = "186--200",
month = jun,
year = "2009",
CODEN = "????",
ISSN = "1985-1553",
ISSN-L = "1985-1553",
bibdate = "Fri Mar 09 15:20:22 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.cscjournals.org/csc/manuscript/Journals/IJCSS/volume3/Issue3/IJCSS-78.pdf",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Science and Security
(IJCSS)",
}
@Article{Ashraf:2009:SBE,
author = "Manzur Ashraf and Syed Mahfuzul Aziz and M. Lutful
Kabir and Biswajit K. Dey",
title = "A {SIM}-based electronic transaction authentication
system",
journal = j-INT-J-COMPUT-SYST-SCI-ENG,
volume = "24",
number = "4",
pages = "??--??",
month = jul,
year = "2009",
CODEN = "CSSEEI",
ISSN = "0267-6192",
bibdate = "Tue Dec 03 12:48:36 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Systems Science and
Engineering",
remark = "Special issue: Privacy Data Management",
}
@Book{Atallah:2009:ATC,
editor = "Mikhail J. Atallah and Marina Blanton",
title = "Algorithms and theory of computation handbook. General
concepts and techniques",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
edition = "Second",
pages = "????",
year = "2009",
ISBN = "1-58488-822-9 (print), 1-58488-823-7 (e-book)",
ISBN-13 = "978-1-58488-822-2 (print), 978-1-58488-823-9
(e-book)",
LCCN = "QA76.9.A43 A432 2009",
bibdate = "Sat May 14 09:19:32 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Chapman and Hall/CRC applied algorithms and data
structures series",
URL = "http://www.crcnetbase.com/isbn/9781584888239",
acknowledgement = ack-nhfb,
subject = "computer algorithms; computer science; computational
complexity",
tableofcontents = "I. Front Matter \\
Chapter 1. Algorithm Design and Analysis Techniques /
Edward M. Reingold \\
Chapter 2. Searching / Ricardo Baeza-Yates, Patricio V.
Poblete \\
Chapter 3. Sorting and Order Statistics / Vladimir
Estivill-Castro \\
Chapter 4. Basic Data Structures / Roberto Tamassia,
Bryan Cantrill \\
Chapter 5. Topics in Data Structures / Giuseppe F.
Italiano, Rajeev Raman \\
Chapter 6. Multidimensional Data Structures for Spatial
Applications / Hanan Samet \\
Chapter 7. Basic Graph Algorithms / Samir Khuller,
Balaji Raghavachari \\
Chapter 8. Advanced Combinatorial Algorithms / Samir
Khuller, Balaji Raghavachari \\
Chapter 9. Dynamic Graph Algorithms / Camil Demetrescu,
David Eppstein, Zvi Galil, Giuseppe F. Italiano \\
Chapter 10. External-Memory Algorithms and Data
Structures / Lars Arge, Norbert Zeh \\
Chapter 11. Average Case Analysis of Algorithms /
Wojciech Szpankowski \\
Chapter 12. Randomized Algorithms / Rajeev Motwani,
Prabhakar Raghavan \\
Chapter 13. Pattern Matching in Strings / Maxime
Crochemore, Christophe Hancart \\
Chapter 14. Text Data Compression Algorithms / Maxime
Crochemore, Thierry Lecroq \\
Chapter 15. General Pattern Matching / Alberto
Apostolico \\
Chapter 16. Computational Number Theory / Samuel S.
Wagstaff \\
Chapter 17. Algebraic and Numerical Algorithms /
Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas
\\
Chapter 18. Applications of FFT and Structured Matrices
/ Ioannis Z. Emiris, Victor Y. Pan \\
Chapter 19. Basic Notions in Computational Complexity /
Tao Jiang, Ming Li, Bala Ravikumar \\
Chapter 20. Formal Grammars and Languages / Tao Jiang,
Ming Li, Bala Ravikumar, Kenneth W. Regan \\
Chapter 21. Computability / Tao Jiang, Ming Li, Bala
Ravikumar, Kenneth W. Regan \\
Chapter 22. Complexity Classes / Eric Allender, Michael
C. Loui, Kenneth W. Regan \\
Chapter 23. Reducibility and Completeness / Eric
Allender, Michael C. Loui, Kenneth W. Regan \\
Chapter 24. Other Complexity Classes and Measures /
Eric Allender, Michael C. Loui, Kenneth W. Regan \\
Chapter 25. Parameterized Algorithms / Rodney G.
Downey, Catherine McCartin \\
Chapter 26. Computational Learning Theory / Sally A.
Goldman \\
Chapter 27. Algorithmic Coding Theory / Atri Rudra \\
Chapter 28. Parallel Computation / Raymond Greenlaw, H.
James Hoover \\
Chapter 29. Distributed Computing / Eli Gafni \\
Chapter 30. Linear Programming / Vijay Chandru, M. R.
Rao \\
Chapter 31. Integer Programming / Vijay Chandru, M. R.
Rao \\
Chapter 32. Convex Optimization / Florian Jarre,
Stephen A. Vavasis \\
Chapter 33. Simulated Annealing Techniques / Albert Y.
Zomaya, Rick Kazman \\
Chapter 34. Approximation Algorithms for NP-Hard
Optimization Problems / Philip N. Klein, Neal E.
Young",
}
@TechReport{Atighehchi:2009:EPA,
author = "K{\'e}vin Atighehchi and Adriana Enache and Traian
Muntean and Gabriel Risterucci",
title = "An Efficient Parallel Algorithm for {Skein} Hash
Functions",
type = "Report",
institution = "ERISCS Research Group, Universit{\'e} de la
M{\'e}diterran{\'e}e",
address = "Parc Scientifique de Luminy-Marseille, France",
pages = "11",
day = "30",
month = sep,
year = "2009",
bibdate = "Sat Dec 10 15:35:59 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bajard:2009:SRB,
author = "J. C. Bajard and M. Kaihara and T. Plantard",
title = "Selected {RNS} Bases for Modular Multiplication",
crossref = "Bruguera:2009:PIS",
pages = "25--31",
year = "2009",
bibdate = "Fri Jun 12 12:34:25 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
abstract = "The selection of the elements of the bases in an RNS
modular multiplication method is crucial and has a
great impact in the overall performance. This work
proposes specific sets of optimal RNS moduli with
elements of Hamming weight three whose inverses used in
the MRS reconstruction have very small Hamming weight.
This property is exploited in RNS bases conversions, to
completely remove and replace the products by few
additions/subtractions and shifts, reducing the time
complexity of modular multiplication. These bases are
specially crafted to computation with operands of sizes
256 or more and are suitable for cryptographic
applications such as the ECC protocols.",
acknowledgement = ack-nhfb,
keywords = "ARITH-19",
}
@Article{Baldwin:2009:PSS,
author = "Adrian Baldwin and Chris Dalton and Simon Shiu and
Krzysztof Kostienko and Qasim Rajpoot",
title = "Providing secure services for a virtual
infrastructure",
journal = j-OPER-SYS-REV,
volume = "43",
number = "1",
pages = "44--51",
month = jan,
year = "2009",
CODEN = "OSRED8",
DOI = "https://doi.org/10.1145/1496909.1496919",
ISSN = "0163-5980 (print), 1943-586X (electronic)",
ISSN-L = "0163-5980",
bibdate = "Thu Jan 22 17:21:31 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/opersysrev.bib",
abstract = "Virtualization brings flexibility to the data center
and enables separations allowing for better security
properties. For these security properties to be fully
utilized, virtual machines need to be able to connect
to secure services such as networking and storage. This
paper addresses the problems associated with managing
the cryptographic keys upon which such services rely by
ensuring that keys remain within the trusted computing
base. Here we describe a general architecture for
managing keys tied to the underlying virtualized
systems, with a specific example given for secure
storage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGOPS Operating Systems Review",
keywords = "key management; storage; TCG; virtualization",
}
@Book{Bard:2009:AC,
author = "Gregory V. Bard",
title = "Algebraic cryptanalysis",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxxiii + 356",
year = "2009",
ISBN = "0-387-88757-1 (ebook), 0-387-88756-3",
ISBN-13 = "978-0-387-88757-9 (ebook), 978-0-387-88756-2",
LCCN = "Z103 .B37 2009eb",
bibdate = "Sat May 15 10:23:47 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
sirsi.library.utoronto.ca:2200/UNICORN",
URL = "http://link.library.utoronto.ca/eir/EIRdetail.cfm?Resources\_\_ID=896123&T=F",
acknowledgement = ack-nhfb,
subject = "Cryptography; Data encryption (Computer science)",
}
@Article{Barthe:2009:FCC,
author = "Gilles Barthe and Benjamin Gr{\'e}goire and Santiago
Zanella B{\'e}guelin",
title = "Formal certification of code-based cryptographic
proofs",
journal = j-SIGPLAN,
volume = "44",
number = "1",
pages = "90--101",
month = jan,
year = "2009",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1480881.1480894",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Fri Oct 9 08:40:38 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "As cryptographic proofs have become essentially
unverifiable, cryptographers have argued in favor of
developing techniques that help tame the complexity of
their proofs. Game-based techniques provide a popular
approach in which proofs are structured as sequences of
games and in which proof steps establish the validity
of transitions between successive games. Code-based
techniques form an instance of this approach that takes
a code-centric view of games, and that relies on
programming language theory to justify proof steps.
While code-based techniques contribute to formalize the
security statements precisely and to carry out proofs
systematically, typical proofs are so long and involved
that formal verification is necessary to achieve a high
degree of confidence. We present Certicrypt, a
framework that enables the machine-checked construction
and verification of code-based proofs. Certicrypt is
built upon the general-purpose proof assistant Coq, and
draws on many areas, including probability, complexity,
algebra, and semantics of programming languages.
Certicrypt provides certified tools to reason about the
equivalence of probabilistic programs, including a
relational Hoare logic, a theory of observational
equivalence, verified program transformations, and
game-based techniques such as reasoning about failure
events. The usefulness of Certicrypt is demonstrated
through various examples, including a proof of semantic
security of OAEP (with a bound that improves upon
existing published results), and a proof of existential
unforgeability of FDH signatures. Our work provides a
first yet significant step towards Halevi's ambitious
programme of providing tool support for cryptographic
proofs.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "coq proof assistant; cryptographic proofs;
observational equivalence; program transformations;
relational Hoare logic",
}
@Article{Basso:2009:NBB,
author = "Alessandro Basso and Francesco Bergadano and Davide
Cavagnino and Victor Pomponiu and Annamaria Vernone",
title = "A Novel Block-based Watermarking Scheme Using the
{SVD} Transform",
journal = j-ALGORITHMS-BASEL,
volume = "2",
number = "1",
pages = "46--75",
month = mar,
year = "2009",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a2010046",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.mdpi.com/1999-4893/2/1/46",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 29 August 2008 / Revised: 11 December 2008 /
Accepted: 14 January 2009 / Published: 22 January
2009",
}
@InProceedings{Bellare:2009:HPK,
author = "Mihir Bellare and Zvika Brakerski and Moni Naor and
Thomas Ristenpart and Gil Segev and Hovav Shacham and
Scott Yilek",
editor = "????",
booktitle = "Advances in Cryptology -- {ASIACRYPT 2009}",
title = "Hedged public-key encryption: How to protect against
bad randomness",
publisher = pub-SV,
address = pub-SV:adr,
pages = "232--249",
year = "2009",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 11:22:26 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 5]{Schneier:2015:SWC}.",
}
@Article{Berbain:2009:QMS,
author = "C{\^o}me Berbain and Henri Gilbert and Jacques
Patarin",
title = "{QUAD}: a multivariate stream cipher with provable
security",
journal = j-J-SYMBOLIC-COMP,
volume = "44",
number = "12",
pages = "1703--1723",
month = dec,
year = "2009",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Wed Aug 25 20:13:20 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/07477171",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171",
}
@Article{Bergmann:2009:DKR,
author = "Seth D. Bergmann",
title = "Degenerate keys for {RSA} encryption",
journal = j-SIGCSE,
volume = "41",
number = "2",
pages = "95--98",
month = jun,
year = "2009",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1595453.1595483",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 15:44:23 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse.bib",
abstract = "Some keys for the RSA public key cryptosystem fail to
encrypt all possible plaintext messages. A necessary
and sufficient condition for these degenerate keys is
given. The probability of choosing such a key, when
choosing keys at random, is presented. The impact of
degenerate keys in an academic setting is discussed.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@InCollection{Bernstein:2009:IPQ,
author = "Daniel J. Bernstein",
title = "Introduction to post-quantum cryptography",
crossref = "Bernstein:2009:PQC",
pages = "1--14",
year = "2009",
bibdate = "Thu Apr 21 17:17:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Bertoni:2009:RPK,
author = "Guido Bertoni and Joan Daemen and Micha{\"e}l Peeters
and Gilles {Van Assche}",
editor = "Helena Handschuh and Stefan Lucks and Bart Preneel and
Phillip Rogaway",
booktitle = "Symmetric Cryptography",
title = "The Road from {Panama} to {Keccak} via
{RadioGat{\'u}n}",
number = "09031",
publisher = "Schloss Dagstuhl --- Leibniz-Zentrum f{\"u}r
Informatik, Germany",
address = "Dagstuhl, Germany",
pages = "??--??",
year = "2009",
ISSN = "1862-4405",
ISSN-L = "1862-4405",
bibdate = "Fri Dec 14 10:26:32 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
series = "Dagstuhl Seminar Proceedings",
URL = "http://drops.dagstuhl.de/opus/volltexte/2009/1958",
acknowledgement = ack-nhfb,
keywords = "cryptography; hash function",
pagecount = "9",
}
@Article{Bethencourt:2009:NTP,
author = "John Bethencourt and Dawn Song and Brent Waters",
title = "New Techniques for Private Stream Searching",
journal = j-TISSEC,
volume = "12",
number = "3",
pages = "16:1--16:??",
month = jan,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1455526.1455529",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 2 18:03:37 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "A system for private stream searching, introduced by
Ostrovsky and Skeith, allows a client to provide an
untrusted server with an encrypted search query. The
server uses the query on a stream of documents and
returns the matching documents to the client while
learning nothing about the nature of the query. We
present a new scheme for conducting private keyword
search on streaming data which requires $ O(m) $ server
to client communication complexity to return the
content of the matching documents, where $m$ is an
upper bound on the size of the documents. The required
storage on the server conducting the search is also $
O(m) $. The previous best scheme for private stream
searching was shown to have $ O(m \log m) $
communication and storage complexity. Our solution
employs a novel construction in which the user
reconstructs the matching files by solving a system of
linear equations. This allows the matching documents to
be stored in a compact buffer rather than relying on
redundancies to avoid collisions in the storage buffer
as in previous work. This technique requires a small
amount of metadata to be returned in addition to the
documents; for this the original scheme of Ostrovsky
and Skeith may be employed with $ O(m \log m) $
communication and storage complexity. We also present
an alternative method for returning the necessary
metadata based on a unique encrypted Bloom filter
construction. This method requires $ O(m \log (t / m))
$ communication and storage complexity, where $t$ is
the number of documents in the stream. In this article
we describe our scheme, prove it secure, analyze its
asymptotic performance, and describe a number of
extensions. We also provide an experimental analysis of
its scalability in practice. Specifically, we consider
its performance in the demanding scenario of providing
a privacy preserving version of the Google News Alerts
service.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "Bloom filter; private information retrieval; private
stream searching; public key program obfuscation",
}
@Article{Bhatnagar:2009:RRW,
author = "Gaurav Bhatnagar and Balasubramanian Raman",
title = "Robust Reference-Watermarking Scheme Using Wavelet
Packet Transform and Bidiagonal-Singular Value
Decomposition",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "9",
number = "3",
pages = "449--477",
month = jul,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467809003538",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Bhattacharyya:2009:VPA,
author = "D. Bhattacharyya and P. Das and T.-h. Kim and S. K.
Bandyopadhyay",
title = "Vascular Pattern Analysis towards Pervasive Palm Vein
Authentication",
journal = j-J-UCS,
volume = "15",
number = "5",
pages = "1081--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 22:38:58 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_5/vascular_pattern_analysis_towards",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Bi:2009:MCE,
author = "Chengpeng Bi",
title = "A {Monte Carlo} {EM} Algorithm for {De Novo Motif}
Discovery in Biomolecular Sequences",
journal = j-TCBB,
volume = "6",
number = "3",
pages = "370--386",
month = jul,
year = "2009",
CODEN = "ITCBCY",
DOI = "https://doi.org/10.1109/TCBB.2008.103",
ISSN = "1545-5963 (print), 1557-9964 (electronic)",
ISSN-L = "1545-5963",
bibdate = "Tue Aug 11 18:13:22 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Motif discovery methods play pivotal roles in
deciphering the genetic regulatory codes (i.e., motifs)
in genomes as well as in locating conserved domains in
protein sequences. The Expectation Maximization (EM)
algorithm is one of the most popular methods used in de
novo motif discovery. Based on the position weight
matrix (PWM) updating technique, this paper presents a
Monte Carlo version of the EM motif-finding algorithm
that carries out stochastic sampling in local alignment
space to overcome the conventional EM's main drawback
of being trapped in a local optimum. The newly
implemented algorithm is named as Monte Carlo EM Motif
Discovery Algorithm (MCEMDA). MCEMDA starts from an
initial model, and then it iteratively performs Monte
Carlo simulation and parameter update until
convergence. A log-likelihood profiling technique
together with the top-$k$ strategy is introduced to
cope with the phase shifts and multiple modal issues in
motif discovery problem. A novel grouping motif
alignment (GMA) algorithm is designed to select motifs
by clustering a population of candidate local
alignments and successfully applied to subtle motif
discovery. MCEMDA compares favorably to other popular
PWM-based and word enumerative motif algorithms tested
using simulated $ (l, d) $-motif cases, documented
prokaryotic, and eukaryotic DNA motif sequences.
Finally, MCEMDA is applied to detect large blocks of
conserved domains using protein benchmarks and exhibits
its excellent capacity while compared with other
multiple sequence alignment methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE/ACM Transactions on Computational Biology and
Bioinformatics",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J954",
keywords = "Expectation maximization (EM); Monte Carlo EM; motif
discovery; multiple sequence alignment; transcriptional
regulation.",
}
@TechReport{Biryukov:2009:KRA,
author = "Alex Biryukov and Orr Dunkelman and Nathan Keller and
Dmitry Khovratovich and Adi Shamir",
title = "Key Recovery Attacks of Practical Complexity on {AES}
Variants With Up To 10 Rounds",
type = "Report",
institution = "University of Luxembourg, Luxembourg; {\'E}cole
Normale Sup{\'e}rieure, 45 rue d'Ulm, 75230 Paris,
France. Einstein Institute of Mathematics, Hebrew
University, Jerusalem 91904, Israel; Computer Science
department, The Weizmann Institute, Rehovot 76100,
Israel",
day = "8",
month = nov,
year = "2009",
bibdate = "Mon Nov 09 15:21:59 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eprint.iacr.org/2009/374.pdf",
abstract = "AES is the best known and most widely used block
cipher. Its three versions (AES-128, AES-192, and
AES-256) differ in their key sizes (128 bits, 192 bits
and 256 bits) and in their number of rounds (10, 12,
and 14, respectively). In the case of AES-128, there is
no known attack which is faster than the $ 2^{128} $
complexity of exhaustive search. However, AES-192 and
AES-256 were recently shown to be breakable by attacks
which require $ 2^{176} $ and $ 2^{119} $ time,
respectively. While these complexities are much faster
than exhaustive search, they are completely
non-practical, and do not seem to pose any real threat
to the security of AES-based systems. In this paper we
describe several attacks which can break with practical
complexity variants of AES-256 whose number of rounds
are comparable to that of AES-128. One of our attacks
uses only two related keys and $ 2^{39} $ time to
recover the complete 256-bit key of a 9-round version
of AES-256 (the best previous attack on this variant
required 4 related keys and $ 2^{120} $ time). Another
attack can break a 10 round version of AES-256 in $
2^{45} $ time, but it uses a stronger type of related
subkey attack (the best previous attack on this variant
required 64 related keys and $ 2^{172} $ time). While
neither AES-128 nor AES-256 can be directly broken by
these attacks, the fact that their hybrid (which
combines the smaller number of rounds from AES-128
along with the larger key size from AES-256) can be
broken with such a low complexity raises serious
concern about the remaining safety margin offered by
the AES family of cryptosystems.",
acknowledgement = ack-nhfb,
}
@InProceedings{Blaszczyk:2009:EVT,
author = "Marta Blaszczyk and Richard A. Guinee",
booktitle = "{IET Irish Signals and Systems Conference (ISSC
2009)}",
title = "Experimental validation of a true random binary digit
generator fusion with a pseudo random number generator
for cryptographic module application",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--6",
year = "2009",
DOI = "https://doi.org/10.1049/cp.2009.1708",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5524689",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5510084",
keywords = "true random numbers from physical sources",
}
@Book{Blunden:2009:RAE,
author = "Bill Blunden",
title = "The rootkit arsenal: escape and evasion in the dark
corners of the system",
publisher = "Wordware Publishing",
address = "Plano, TX, USA",
pages = "xxvii + 908",
year = "2009",
ISBN = "1-59822-061-6 (paperback)",
ISBN-13 = "978-1-59822-061-2 (paperback)",
LCCN = "QA76.9.A25 B585 2009",
bibdate = "Wed Jan 12 11:17:37 MST 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "Computers; Access control; Computer viruses; Computer
hackers",
}
@Article{Boyer:2009:SBB,
author = "Michel Boyer and Ran Gelles and Tal Mor",
title = "Security of the {Bennett--Brassard} Quantum Key
Distribution Protocol against Collective Attacks",
journal = j-ALGORITHMS-BASEL,
volume = "2",
number = "2",
pages = "790--807",
month = jun,
year = "2009",
CODEN = "ALGOCH",
DOI = "https://doi.org/10.3390/a2020790",
ISSN = "1999-4893 (electronic)",
ISSN-L = "1999-4893",
bibdate = "Fri May 3 13:50:12 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.mdpi.com/1999-4893/2/2/790",
acknowledgement = ack-nhfb,
fjournal = "Algorithms (Basel)",
journal-URL = "https://www.mdpi.com/journal/algorithms",
pubdates = "Received: 16 October 2008 / Revised: 17 April 2009 /
Accepted: 7 May 2009 / Published: 3 June 2009",
}
@InCollection{Buchmann:2009:HBD,
author = "Johannes Buchmann and Erik Dahmen and Michael Szydlo",
title = "Hash-based Digital Signature Schemes",
crossref = "Bernstein:2009:PQC",
pages = "35--94",
year = "2009",
bibdate = "Thu Apr 21 17:17:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Buchmann:2009:PQC,
author = "Johannes Buchmann and Richard Lindner and Markus
R{\"u}ckert and Michael Schneider",
title = "Post-quantum cryptography: lattice signatures",
journal = j-COMPUTING,
volume = "85",
number = "1--2",
pages = "105--125",
month = jun,
year = "2009",
CODEN = "CMPTA2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Sun Oct 31 11:09:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=85&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=85&issue=1&spage=105",
acknowledgement = ack-nhfb,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journal-URL = "http://link.springer.com/journal/607",
}
@PhdThesis{Bulygin:2009:PSS,
author = "Stanislav Bulygin",
title = "Polynomial system solving for decoding linear codes
and algebraic cryptanalysis",
type = "{Ph.D.} thesis (??)",
school = "Technische Universit{\"a}t Kaiserslautern",
address = "Kaiserslautern, Germany",
year = "2009",
bibdate = "Fri May 13 07:35:16 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Burmester:2009:UCR,
author = "Mike Burmester and Tri Van Le and Breno {De Medeiros}
and Gene Tsudik",
title = "Universally Composable {RFID} Identification and
Authentication Protocols",
journal = j-TISSEC,
volume = "12",
number = "4",
pages = "21:1--21:??",
month = apr,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1513601.1513603",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Thu May 14 13:53:50 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "As the number of RFID applications grows, concerns
about their security and privacy become greatly
amplified. At the same time, the acutely restricted and
cost-sensitive nature of RFID tags rules out simple
reuse of traditional security/privacy solutions and
calls for a new generation of extremely lightweight
identification and authentication protocols.\par
This article describes a universally composable
security framework designed especially for RFID
applications. We adopt RFID-specific setup,
communication, and concurrency assumptions in a model
that guarantees strong security, privacy, and
availability properties. In particular, the framework
supports modular deployment, which is most appropriate
for ubiquitous applications. We also describe a set of
simple, efficient, secure, and anonymous (untraceable)
RFID identification and authentication protocols that
instantiate the proposed framework. These protocols
involve minimal interaction between tags and readers
and place only a small computational load on the tag,
and a light computational burden on the back-end
server. We show that our protocols are provably secure
within the proposed framework.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "authentication and key-exchange protocols; RFID
security; universal composability",
}
@Article{Butler:2009:LIB,
author = "Kevin R. B. Butler and Sunam Ryu and Patrick Traynor
and Patrick D. McDaniel",
title = "Leveraging Identity-Based Cryptography for Node {ID}
Assignment in Structured {P2P} Systems",
journal = j-IEEE-TRANS-PAR-DIST-SYS,
volume = "20",
number = "12",
pages = "1803--1815",
month = dec,
year = "2009",
CODEN = "ITDSEO",
DOI = "https://doi.org/10.1109/TPDS.2008.249",
ISSN = "1045-9219 (print), 1558-2183 (electronic)",
ISSN-L = "1045-9219",
bibdate = "Thu May 13 12:06:56 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Parallel and Distributed
Systems",
journal-URL = "http://www.computer.org/tpds/archives.htm",
}
@Article{Caballero-Gil:2009:GBA,
author = "P. Caballero-Gil and A. F{\'u}ster-Sabater and C.
Hern{\'a}ndez-Goya",
title = "Graph-Based Approach to the Edit Distance
Cryptanalysis of Irregularly Clocked Linear Feedback
Shift Registers",
journal = j-J-UCS,
volume = "15",
number = "15",
pages = "2981--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 21:52:59 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_15/graph_based_approach_to",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Cachin:2009:TC,
author = "Christian Cachin and Idit Keidar and Alexander
Shraer",
title = "Trusting the cloud",
journal = j-SIGACT,
volume = "40",
number = "2",
pages = "81--86",
month = jun,
year = "2009",
CODEN = "SIGNDM",
DOI = "https://doi.org/10.1145/1556154.1556173",
ISSN = "0163-5700 (print), 1943-5827 (electronic)",
ISSN-L = "0163-5700",
bibdate = "Wed Mar 21 18:30:31 MDT 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
abstract = "More and more users store data in ``clouds'' that are
accessed remotely over the Internet. We survey
well-known cryptographic tools for providing integrity
and consistency for data stored in clouds and discuss
recent research in cryptography and distributed
computing addressing these problems.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGACT News",
journal-URL = "http://dl.acm.org/citation.cfm?id=J697",
}
@Article{Caputo:2009:DIT,
author = "Deanna Caputo and Marcus Maloof and Gregory Stephens",
title = "Detecting Insider Theft of Trade Secrets",
journal = j-IEEE-SEC-PRIV,
volume = "7",
number = "6",
pages = "14--21",
month = nov # "\slash " # dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2009.110",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Castelluccia:2009:EPS,
author = "Claude Castelluccia and Aldar C-F. Chan and Einar
Mykletun and Gene Tsudik",
title = "Efficient and provably secure aggregation of encrypted
data in wireless sensor networks",
journal = j-TOSN,
volume = "5",
number = "3",
pages = "20:1--20:??",
month = may,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1525856.1525858",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:23:43 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Wireless sensor networks (WSNs) are composed of tiny
devices with limited computation and battery
capacities. For such resource-constrained devices, data
transmission is a very energy-consuming operation. To
maximize WSN lifetime, it is essential to minimize the
number of bits sent and received by each device. One
natural approach is to aggregate sensor data along the
path from sensors to the sink. Aggregation is
especially challenging if end-to-end privacy between
sensors and the sink (or aggregate integrity) is
required. In this article, we propose a simple and
provably secure encryption scheme that allows efficient
additive aggregation of encrypted data. Only one
modular addition is necessary for ciphertext
aggregation. The security of the scheme is based on the
indistinguishability property of a pseudorandom
function (PRF), a standard cryptographic primitive. We
show that aggregation based on this scheme can be used
to efficiently compute statistical values, such as
mean, variance, and standard deviation of sensed data,
while achieving significant bandwidth savings. To
protect the integrity of the aggregated data, we
construct an end-to-end aggregate authentication scheme
that is secure against outsider-only attacks, also
based on the indistinguishability property of PRFs.",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "Authentication; cryptography; privacy; pseudorandom
functions; secure data aggregation; stream ciphers;
wireless sensor networks",
}
@Article{Cetin:2009:NSA,
author = "Ozdemir Cetin and A. Turan Ozcerit",
title = "A new steganography algorithm based on color
histograms for data embedding into raw video streams",
journal = j-COMPUT-SECUR,
volume = "28",
number = "7",
pages = "670--682",
month = oct,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740480900042X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Chang:2009:FDI,
author = "Chin-Chen Chang and Yung-Chen Chou",
title = "A Fragile Digital Image Authentication Scheme Inspired
by Wet Paper Codes",
journal = j-FUND-INFO,
volume = "90",
number = "1--2",
pages = "17--26",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0002",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:04 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chang:2009:PCC,
author = "Chin-Chen Chang and Tzung-Her Chen and Li-Jen Liu",
title = "Preventing Cheating in Computational Visual
Cryptography",
journal = j-FUND-INFO,
volume = "92",
number = "1--2",
pages = "27--42",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0064",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:27 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chao:2009:HCS,
author = "Min-Wen Chao and Chao-hung Lin and Cheng-Wei Yu and
Tong-Yee Lee",
title = "A High Capacity {$3$D} Steganography Algorithm",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "15",
number = "2",
pages = "274--284",
month = mar # "\slash " # apr,
year = "2009",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2008.94",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Thu Jul 2 10:22:33 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@Article{Chen:2009:AKD,
author = "Bee-Chung Chen and Kristen Lefevre and Raghu
Ramakrishnan",
title = "Adversarial-knowledge dimensions in data privacy",
journal = j-VLDB-J,
volume = "18",
number = "2",
pages = "429--467",
month = apr,
year = "2009",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-008-0118-x",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Mon Apr 13 09:15:13 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Privacy is an important issue in data publishing. Many
organizations distribute non-aggregate personal data
for research, and they must take steps to ensure that
an adversary cannot predict sensitive information
pertaining to individuals with high confidence. This
problem is further complicated by the fact that, in
addition to the published data, the adversary may also
have access to other resources (e.g., public records
and social networks relating individuals), which we
call adversarial knowledge. A robust privacy framework
should allow publishing organizations to analyze data
privacy by means of not only data dimensions (data that
a publishing organization has), but also
adversarial-knowledge dimensions (information not in
the data). In this paper, we first describe a general
framework for reasoning about privacy in the presence
of adversarial knowledge. Within this framework, we
propose a novel multidimensional approach to
quantifying adversarial knowledge. This approach allows
the publishing organization to investigate privacy
threats and enforce privacy requirements in the
presence of various types and amounts of adversarial
knowledge. Our main technical contributions include a
multidimensional privacy criterion that is more
intuitive and flexible than previous approaches to
modeling background knowledge. In addition, we identify
an important congregation property of the
adversarial-knowledge dimensions. Based on this
property, we provide algorithms for measuring
disclosure and sanitizing data that improve
computational efficiency several orders of magnitude
over the best known techniques.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "Anonymization; Knowledge expression;
Privacy-preserving data publishing; Probabilistic
inference; Skyline; Worst-case privacy",
}
@Article{Chen:2009:FCV,
author = "Tzung-Her Chen and Kai-Hsiang Tsao and Yan-Ting Yang",
title = "Friendly Color Visual Secret Sharing by Random Grids",
journal = j-FUND-INFO,
volume = "96",
number = "1--2",
pages = "61--70",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-167",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:09:21 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Chen:2009:SRP,
author = "Yingying Chen and Konstantinos Kleisouris and Xiaoyan
Li and Wade Trappe and Richard P. Martin",
title = "A security and robustness performance analysis of
localization algorithms to signal strength attacks",
journal = j-TOSN,
volume = "5",
number = "1",
pages = "2:1--2:??",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1464420.1464422",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:22:49 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Recently, it has been noted that localization
algorithms that use signal strength are susceptible to
noncryptographic attacks, which consequently threatens
their viability for sensor applications. In this work,
we examine several localization algorithms and evaluate
their robustness to attacks where an adversary
attenuates or amplifies the signal strength at one or
more landmarks. We study both point-based and
area-based methods that employ received signal strength
for localization, and propose several performance
metrics that quantify the estimator's precision, bias,
and error, including H{\"o}lder metrics, which quantify
the variability in position space for a given
variability in signal strength space. We then conduct a
trace-driven evaluation of a set of representative
algorithms, where we measured their performance as we
applied attacks on real data from two different
buildings. We found the median error degraded
gracefully, with a linear response as a function of the
attack strength. We also found that area-based
algorithms experienced a decrease and a spatial-shift
in the returned area under attack, implying that
precision increases though bias is introduced for these
schemes. Additionally, we observed similar values for
the average H{\"o}lder metric across most of the
algorithms, thereby providing strong experimental
evidence that nearly all the algorithms have similar
average responses to signal strength attacks with the
exception of the Bayesian Networks algorithm.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "Localization; robustness; sensor networks; signal
strength attacks; susceptibility",
}
@Article{Cheng:2009:NAS,
author = "Yu-Ming Cheng and Chung-Ming Wang",
title = "A Novel Approach to Steganography in
High-Dynamic-Range Images",
journal = j-IEEE-MULTIMEDIA,
volume = "16",
number = "3",
pages = "70--80",
month = jul # "\slash " # sep,
year = "2009",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2009.43",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu May 13 11:33:52 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Chhabra:2009:MSP,
author = "Siddhartha Chhabra and Brian Rogers and Yan Solihin
and Milos Prvulovic",
title = "Making secure processors {OS}- and
performance-friendly",
journal = j-TACO,
volume = "5",
number = "4",
pages = "16:1--16:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1498690.1498691",
ISSN = "1544-3566 (print), 1544-3973 (electronic)",
ISSN-L = "1544-3566",
bibdate = "Wed Mar 18 21:35:33 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In today's digital world, computer security issues
have become increasingly important. In particular,
researchers have proposed designs for secure processors
that utilize hardware-based memory encryption and
integrity verification to protect the privacy and
integrity of computation even from sophisticated
physical attacks. However, currently proposed schemes
remain hampered by problems that make them impractical
for use in today's computer systems: lack of virtual
memory and Inter-Process Communication support as well
as excessive storage and performance overheads. In this
article, we propose (1) address independent seed
encryption (AISE), a counter-mode-based memory
encryption scheme using a novel seed composition, and
(2) bonsai Merkle trees (BMT), a novel Merkle
tree-based memory integrity verification technique, to
eliminate these system and performance issues
associated with prior counter-mode memory encryption
and Merkle tree integrity verification schemes. We
present both a qualitative discussion and a
quantitative analysis to illustrate the advantages of
our techniques over previously proposed approaches in
terms of complexity, feasibility, performance, and
storage. Our results show that AISE+BMT reduces the
overhead of prior memory encryption and integrity
verification schemes from 12\% to 2\% on average for
single-threaded benchmarks on uniprocessor systems, and
from 15\% to 4\% for coscheduled benchmarks on
multicore systems while eliminating critical
system-level problems.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Architecture and Code Optimization
(TACO)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924",
keywords = "memory encryption; memory integrity verification;
Secure processor architectures; virtualization",
}
@Article{Chien:2009:EBL,
author = "Hung-Yu Chien and Chi-Sung Laih",
title = "{ECC}-based lightweight authentication protocol with
untraceability for low-cost {RFID}",
journal = j-J-PAR-DIST-COMP,
volume = "69",
number = "10",
pages = "848--853",
month = oct,
year = "2009",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Wed Sep 1 16:27:26 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/07437315",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Choi:2009:KDK,
author = "Seung Geol Choi and Javier Herranz and Dennis Hofheinz
and Jung Yeon Hwang and Eike Kiltz and Dong Hoon Lee
and Moti Yung",
title = "The {Kurosawa--Desmedt} key encapsulation is not
chosen-ciphertext secure",
journal = j-INFO-PROC-LETT,
volume = "109",
number = "16",
pages = "897--901",
day = "31",
month = jul,
year = "2009",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:38 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Chou:2009:ATI,
author = "Chang-Min Chou and Din-Chang Tseng",
title = "Affine-Transformation-Invariant Public Fragile
Watermarking for {$3$D} Model Authentication",
journal = j-IEEE-CGA,
volume = "29",
number = "2",
pages = "72--79",
month = mar # "\slash " # apr,
year = "2009",
CODEN = "ICGADZ",
DOI = "https://doi.org/10.1109/MCG.2009.20",
ISSN = "0272-1716 (print), 1558-1756 (electronic)",
ISSN-L = "0272-1716",
bibdate = "Thu Jul 2 09:13:50 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Computer Graphics and Applications",
journal-URL = "http://www.computer.org/portal/web/csdl/magazines/cga",
}
@Article{Chow:2009:ADN,
author = "Stanley T. Chow and Christophe Gustave and Dmitri
Vinokurov",
title = "Authenticating displayed names in telephony",
journal = j-BELL-LABS-TECH-J,
volume = "14",
number = "1",
pages = "267--282",
month = "Spring",
year = "2009",
CODEN = "BLTJFD",
DOI = "https://doi.org/10.1002/bltj.20367",
ISSN = "1089-7089 (print), 1538-7305 (electronic)",
ISSN-L = "1089-7089",
bibdate = "Fri Nov 26 17:31:42 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Bell Labs Technical Journal",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
onlinedate = "18 May 2009",
}
@Book{Conti:2009:GSH,
author = "Greg Conti",
title = "Googling security: how much does {Google} know about
you?",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxi + 332",
year = "2009",
ISBN = "0-321-51866-7 (paperback)",
ISBN-13 = "978-0-321-51866-8 (paperback)",
LCCN = "QA76.9.A25 C6678 2009",
bibdate = "Wed Feb 17 16:44:31 MST 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0824/2008032687.html",
acknowledgement = ack-nhfb,
subject = "computer security; computer networks; security
measures; Google",
tableofcontents = "Googling \\
Information flows and leakage \\
Footprints, fingerprints, and connections \\
Search \\
Communications \\
Mapping, directions, and imagery \\
Advertising and embedded content \\
Googlebot \\
Countermeasures \\
Conclusions and a look to the future",
}
@Article{Crosby:2009:OLR,
author = "Scott A. Crosby and Dan S. Wallach and Rudolf H.
Riedi",
title = "Opportunities and Limits of Remote Timing Attacks",
journal = j-TISSEC,
volume = "12",
number = "3",
pages = "17:1--17:??",
month = jan,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1455526.1455530",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 2 18:03:37 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Many algorithms can take a variable amount of time to
complete depending on the data being processed. These
timing differences can sometimes disclose confidential
information. Indeed, researchers have been able to
reconstruct an RSA private key purely by querying an
SSL Web server and timing the results. Our work
analyzes the limits of attacks based on accurately
measuring network response times and jitter over a
local network and across the Internet. We present the
design of filters to significantly reduce the effects
of jitter, allowing an attacker to measure events with
15--100$ \mu $ s accuracy across the Internet, and as
good as 100ns over a local network. Notably,
security-related algorithms on Web servers and other
network servers need to be carefully engineered to
avoid timing channel leaks at the accuracy demonstrated
in this article.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "Information leakage; jitter; timing attacks",
}
@Book{Cusick:2009:CBF,
author = "Thomas W. Cusick and Pantelimon St{\u{a}}nic{\u{a}}",
title = "Cryptographic {Boolean} functions and applications",
publisher = pub-ELSEVIER-ACADEMIC,
address = pub-ELSEVIER-ACADEMIC:adr,
pages = "xii + 232",
year = "2009",
ISBN = "0-12-374890-9 (hardcover)",
ISBN-13 = "978-0-12-374890-4 (hardcover)",
LCCN = "QA10.3 .C87 2009",
bibdate = "Sat May 15 09:33:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
prodorbis.library.yale.edu:7090/voyager",
acknowledgement = ack-nhfb,
subject = "Algebra, Boolean; Cryptography; Data encryption
(Computer science); Computer algorithms",
tableofcontents = "A bit of history \\
Fourier analysis of Boolean functions \\
Avalanche and propogation criteria \\
Correlation immune and resilient Boolean functions \\
Bent Boolean functions \\
Stream cipher design \\
Block cyphers \\
Boolean Cayley graphs",
}
@Article{Czernik:2009:CRN,
author = "Pawel Czernik and Jakub Olszyna",
editor = "Ryszard S. Romaniuk and Krzysztof S. Kulpa",
title = "Cryptographic random number generators for low-power
distributed measurement system",
journal = j-PROC-SPIE,
volume = "7502",
number = "1",
pages = "75022A",
year = "2009",
CODEN = "PSISDG",
DOI = "https://doi.org/10.1117/12.837994",
ISSN = "0277-786X (print), 1996-756X (electronic)",
ISSN-L = "0277-786X",
bibdate = "Mon Jan 16 15:57:34 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
note = "Photonics Applications in Astronomy, Communications,
Industry, and High-Energy Physics Experiments 2009.",
URL = "http://link.aip.org/link/?PSI/7502/75022A/1",
acknowledgement = ack-nhfb,
eid = "75022A",
fjournal = "Proceedings of the SPIE --- The International Society
for Optical Engineering",
keywords = "true random numbers from physical sources",
location = "Wilga, Poland",
numpages = "8",
}
@Article{Daemen:2009:CAE,
author = "Joan Daemen and Mario Lamberger and Norbert
Pramstaller and Vincent Rijmen and Frederik
Vercauteren",
title = "Computational aspects of the expected differential
probability of 4-round {AES} and {AES}-like ciphers",
journal = j-COMPUTING,
volume = "85",
number = "1--2",
pages = "85--104",
month = jun,
year = "2009",
CODEN = "CMPTA2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Sun Oct 31 11:09:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=85&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=85&issue=1&spage=85",
acknowledgement = ack-nhfb,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Deepthi:2009:DIA,
author = "P. P. Deepthi and P. S. Sathidevi",
title = "Design, implementation and analysis of hardware
efficient stream ciphers using {LFSR} based hash
functions",
journal = j-COMPUT-SECUR,
volume = "28",
number = "3--4",
pages = "229--241",
month = may # "\slash " # jun,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808001193",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Denev:2009:SFQ,
author = "Dimitar Denev and Arturas Mazeika and Marc Spaniol and
Gerhard Weikum",
title = "{SHARC}: framework for quality-conscious {Web}
archiving",
journal = j-PROC-VLDB-ENDOWMENT,
volume = "2",
number = "1",
pages = "586--597",
month = aug,
year = "2009",
CODEN = "????",
ISSN = "2150-8097",
bibdate = "Fri May 13 14:54:50 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Proceedings of the VLDB Endowment",
}
@Article{Deng:2009:SCA,
author = "Robert H. Deng and Yanjiang Yang",
title = "A study of content authentication in proxy-enabled
multimedia delivery systems: {Model}, techniques, and
applications",
journal = j-TOMCCAP,
volume = "5",
number = "4",
pages = "28:1--28:??",
month = oct,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1596990.1596992",
ISSN = "1551-6857 (print), 1551-6865 (electronic)",
ISSN-L = "1551-6857",
bibdate = "Tue Mar 16 18:53:03 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tomccap/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Compared with the direct server-user approach, the
server-proxy-user architecture for multimedia delivery
promises significantly improved system scalability. The
introduction of the intermediary transcoding proxies
between content servers and end users in this
architecture, however, brings unprecedented challenges
to content security. In this article, we present a
systematic study on the end-to-end content
authentication problem in the server-proxy-user
context, where intermediary proxies transcode
multimedia content dynamically. We present a formal
model for the authentication problem, propose a
concrete construction for authenticating generic data
modality and formally prove its security. We then apply
the generic construction to authenticating specific
multimedia formats, for example, JPEG2000 code-streams
and MPEG-4 video streams. The prototype implementation
shows that our scheme is suitable for practical
applications.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Transactions on Multimedia Computing,
Communications, and Applications",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J961",
keywords = "end-to-end authentication; Multimedia content
delivery; security",
}
@InCollection{Ding:2009:MPK,
author = "Jintai Ding and Bo-Yin Yang",
title = "Multivariate Public Key Cryptography",
crossref = "Bernstein:2009:PQC",
pages = "198--242",
year = "2009",
bibdate = "Thu Apr 21 17:17:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Diqun:2009:QSP,
author = "Yan Diqun and Wang Rangding and Zhang Liguang",
title = "Quantization Step Parity-based Steganography for {MP3}
Audio",
journal = j-FUND-INFO,
volume = "97",
number = "1--2",
pages = "1--14",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-190",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:09:35 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Dodis:2009:CAI,
author = "Yevgeniy Dodis and Yael Tauman Kalai and Shachar
Lovett",
title = "On cryptography with auxiliary input",
crossref = "ACM:2009:SPA",
pages = "621--630",
year = "2009",
bibdate = "Wed Sep 1 10:42:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InProceedings{Dodis:2009:NME,
author = "Yevgeniy Dodis and Daniel Wichs",
title = "Non-malleable extractors and symmetric key
cryptography from weak secrets",
crossref = "ACM:2009:SPA",
pages = "601--610",
year = "2009",
bibdate = "Wed Sep 1 10:42:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Dorrendorf:2009:CRN,
author = "Leo Dorrendorf and Zvi Gutterman and Benny Pinkas",
title = "Cryptanalysis of the random number generator of the
{Windows} operating system",
journal = j-TISSEC,
volume = "13",
number = "1",
pages = "10:1--10:32",
month = oct,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1609956.1609966",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Mar 16 10:18:12 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The PseudoRandom Number Generator (PRNG) used by the
Windows operating system is the most commonly used
PRNG. The pseudorandomness of the output of this
generator is crucial for the security of almost any
application running in Windows. Nevertheless, its exact
algorithm was never published.\par
We examined the binary code of a distribution of
Windows 2000. This investigation was done without any
help from Microsoft.We reconstructed the algorithm used
by the pseudorandom number generator (namely, the
function CryptGenRandom). We analyzed the security of
the algorithm and found a nontrivial attack: Given the
internal state of the generator, the previous state can
be computed in 223 steps. This attack on forward
security demonstrates that the design of the generator
is flawed, since it is well known how to prevent such
attacks. After our analysis was published, Microsoft
acknowledged that Windows XP is vulnerable to the same
attack.\par
We also analyzed the way in which the generator is used
by the operating system and found that it amplifies the
effect of the attack: The generator is run in user mode
rather than in kernel mode; therefore, it is easy to
access its state even without administrator privileges.
The initial values of part of the state of the
generator are not set explicitly, but rather are
defined by whatever values are present on the stack
when the generator is called. Furthermore, each process
runs a different copy of the generator, and the state
of the generator is refreshed with system-generated
entropy only after generating 128KB of output for the
process running it. The result of combining this
observation with our attack is that learning a single
state may reveal 128KB of the past and future output of
the generator.\par
The implication of these findings is that a buffer
overflow attack or a similar attack can be used to
learn a single state of the generator, which can then
be used to predict all random values, such as SSL keys,
used by a process in all its past and future
operations. This attack is more severe and more
efficient than known attacks in which an attack",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Doyle:2009:LTD,
author = "Julie Doyle and Herna Viktor and Eric Paquet",
title = "Long-term digital preservation: preserving
authenticity and usability of {$3$-D} data",
journal = j-INT-J-DIGIT-LIBR,
volume = "10",
number = "1",
pages = "33--47",
month = may,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1007/s00799-009-0051-7",
ISSN = "1432-1300 (print), 1432-5012 (electronic)",
ISSN-L = "1432-1300",
bibdate = "Tue May 7 07:43:27 MDT 2024",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/intjdigitlibr.bib",
URL = "https://link.springer.com/article/10.1007/s00799-009-0051-7",
acknowledgement = ack-nhfb,
ajournal = "Int. J. Digit. Libr.",
fjournal = "International Journal on Digital Libraries",
journal-URL = "https://link.springer.com/journal/799",
}
@Article{Dujella:2009:VWA,
author = "Andrej Dujella",
title = "A variant of {Wiener}'s attack on {RSA}",
journal = j-COMPUTING,
volume = "85",
number = "1--2",
pages = "77--83",
month = jun,
year = "2009",
CODEN = "CMPTA2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Sun Oct 31 11:09:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=85&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=85&issue=1&spage=77",
acknowledgement = ack-nhfb,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Edman:2009:AES,
author = "Matthew Edman and B{\"u}lent Yener",
title = "On anonymity in an electronic society: a survey of
anonymous communication systems",
journal = j-COMP-SURV,
volume = "42",
number = "1",
pages = "5:1--5:35",
month = dec,
year = "2009",
CODEN = "CMSVAN",
DOI = "https://doi.org/10.1145/1592451.1592456",
ISSN = "0360-0300 (print), 1557-7341 (electronic)",
ISSN-L = "0360-0300",
bibdate = "Mon Mar 15 11:55:39 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/surveys/;
https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The past two decades have seen a growing interest in
methods for anonymous communication on the Internet,
both from the academic community and the general
public. Several system designs have been proposed in
the literature, of which a number have been implemented
and are used by diverse groups, such as journalists,
human rights workers, the military, and ordinary
citizens, to protect their identities on the
Internet.\par
In this work, we survey the previous research done to
design, develop, and deploy systems for enabling
private and anonymous communication on the Internet. We
identify and describe the major concepts and
technologies in the field, including mixes and mix
networks, onion routing, and Dining Cryptographers
networks. We will also review powerful traffic analysis
attacks that have motivated improvements and variations
on many of these anonymity protocols made since their
introduction. Finally, we will summarize some of the
major open problems in anonymous communication research
and discuss possible directions for future work in the
field.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Computing Surveys",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204",
keywords = "Anonymity; anonymous communication; DC-nets; mix
networks; mixes; onion routing; privacy; traffic
analysis",
}
@PhdThesis{Ekeraa:2009:DCM,
author = "Martin Eker{\aa}",
title = "Differential cryptanalysis of {MD5}",
volume = "8",
type = "{Ph.D.} thesis (??)",
school = "Skolan f{\"o}r datavetenskap och kommunikation,
Kungliga Tekniska h{\"o}gskolan",
address = "Stockholm, Sweden",
pages = "113",
year = "2009",
ISSN = "1653-5715",
bibdate = "Thu May 12 07:30:19 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "Trita-CSC-E",
acknowledgement = ack-nhfb,
}
@Book{Elbirt:2009:UAC,
author = "Adam J. Elbirt",
title = "Understanding and Applying Cryptography and Data
Security",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "xxvii + 637",
year = "2009",
ISBN = "1-4200-6160-7",
ISBN-13 = "978-1-4200-6160-4",
LCCN = "QA76.9.A25 E43 2009",
bibdate = "Thu Mar 22 13:10:01 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/toc/ecip0821/2008028154.html",
acknowledgement = ack-nhfb,
subject = "Computer security; Cryptography",
}
@Article{Evans:2009:BRS,
author = "James Evans",
title = "Book Review: The Saga of the {Antikythera} Mechanism,
{{\booktitle{Decoding the Heavens: a $ 2000$-Year-Old
Computer and the Century-Long Search to Discover its
Secrets}}}",
journal = j-J-HIST-ASTRON,
volume = "40",
number = "3",
pages = "362--364",
month = aug,
year = "2009",
CODEN = "JHSAA2",
DOI = "https://doi.org/10.1177/002182860904000316",
ISSN = "0021-8286 (print), 1753-8556 (electronic)",
ISSN-L = "0021-8286",
bibdate = "Mon Sep 29 17:18:42 MDT 2014",
bibsource = "http://jha.sagepub.com/content/40/3.toc;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jhistastron.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal for the History of Astronomy",
journal-URL = "https://journals.sagepub.com/home/JHA",
}
@Article{Faugere:2009:EAD,
author = "Jean-Charles Faug{\`e}re and Ludovic Perret",
title = "An efficient algorithm for decomposing multivariate
polynomials and its applications to cryptography",
journal = j-J-SYMBOLIC-COMP,
volume = "44",
number = "12",
pages = "1676--1689",
month = dec,
year = "2009",
CODEN = "JSYCEH",
ISSN = "0747-7171 (print), 1095-855X (electronic)",
ISSN-L = "0747-7171",
bibdate = "Wed Aug 25 20:13:20 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/07477171",
acknowledgement = ack-nhfb,
fjournal = "Journal of Symbolic Computation",
journal-URL = "http://www.sciencedirect.com/science/journal/07477171",
}
@InProceedings{Faugere:2009:IBC,
author = "Jean-Charles Faug{\`e}re",
title = "Interactions between computer algebra ({Gr{\"o}bner}
bases) and cryptology",
crossref = "May:2009:PIS",
pages = "383--384",
year = "2009",
bibdate = "Tue Aug 11 18:45:25 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@InCollection{Feldhofer:2009:HIS,
author = "Martin Feldhofer and Johannes Wolkerstorfer",
editor = "Paris Kitsos and Yan Zhang",
booktitle = "{RFID} Security: Techniques, Protocols and
System-on-Chip Design",
title = "Hardware Implementation of Symmetric Algorithms for
{RFID} Security",
publisher = pub-SV,
address = pub-SV:adr,
bookpages = "xii + 443",
pages = "373--415",
year = "2009",
DOI = "https://doi.org/10.1007/978-0-387-76481-8_15",
ISBN = "0-387-76481-X (e-book), 0-387-76480-1 (hardcover)",
ISBN-13 = "978-0-387-76481-8 (e-book), 978-0-387-76480-1
(hardcover)",
LCCN = "TK6553 .R45 2008eb",
bibdate = "Wed Feb 01 16:58:10 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
jenson.stanford.edu:2210/unicorn",
URL = "http://www.springerlink.com/content/q1160h1036371331/",
abstract = "This book chapter provides an overview about hardware
implementations of symmetric crypto algorithms for RFID
security. Hardware design for RFID tags is challenging
due to the fierce constraints concerning power
consumption and chip area. After a general overview
about RFID security, the requirements for passive RFID
tags will be worked out. Different design measures for
low-resource hardware implementations will be presented
and their efficiency will be analyzed. The
implementation part of this chapter presents a survey
of implemented algorithms that are optimized for
application in passive RFID tags. The evaluated
algorithms include the block ciphers AES, TEA, and XTEA
and the commonly used hash functions SHA-256, SHA-1,
and MD5. These algorithms are compared with the new
upcoming stream ciphers Grain and Trivium. The
comparison of the achieved results favors the use of
the AES algorithm for application of symmetric
cryptography in RFID security.",
acknowledgement = ack-nhfb,
tableofcontents = "Part I: Fundamentals \\
Fundamentals and Applications \\
An Anticounterfeiting Tool \\
Security and Privacy \\
Part II: Security Protocols and Techniques \\
Trade-Offs for Realistic Privacy \\
Security: Cryptography and Physics Perspectives \\
Anticounterfeiting: An Architectural Perspective \\
An Efficient and Secure RFID Security Method with
Ownership Transfer \\
Digital Signature Transponder \\
Scalability Issues in Privacy-Compliant RFID Protocols
\\
Dynamic Privacy Protection for Mobile RFID Service \\
Using RFID-based ``Touch'' for Intuitive User
Interaction with Smart Space Security \\
Readers Deployment for Scalable Identification of
Private Tags \\
Part III: Encryption and Hardware Implementations \\
Public-Key Cryptography for RFID Tags and Applications
\\
New Designs in Lightweight Symmetric Encryption \\
Hardware Implementation of Symmetric Algorithms for
RFID Security \\
Hardware Implementation of a TEA-Based Lightweight
Encryption for RFID Security \\
Index",
}
@InCollection{Field:2009:BCB,
author = "J. V. Field",
title = "British cryptanalysis : the breaking of `Fish'
traffic",
crossref = "Maas:2009:SRW",
pages = "??--??",
year = "2009",
bibdate = "Sat May 14 10:07:09 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Forte:2009:DM,
author = "Dario Forte",
title = "The death of {MD5}",
journal = j-NETWORK-SECURITY,
volume = "2009",
number = "2",
pages = "18--20",
month = feb,
year = "2009",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(09)70020-0",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:01 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485809700200",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
remark = "Discusses collision attacks against SHA-0, MD4, MD5,
HAVAL-128, and RIPEMD.",
}
@Article{Garera:2009:CTG,
author = "Sujata Garera and Jorge Vasconcelos",
title = "Challenges in teaching a graduate course in applied
cryptography",
journal = j-SIGCSE,
volume = "41",
number = "2",
pages = "103--107",
month = jun,
year = "2009",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1595453.1595485",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 15:44:23 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "We describe our experience in creating and teaching a
graduate course in cryptography at the Johns Hopkins
University. We emphasize on the importance of such a
course for a graduate student in an information
security program. We discuss the course implementation
and discuss the challenges in teaching this course to
students from varied backgrounds. Based on our
observations, we suggest specific improvements that
could be applied to this course in the future.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Gavinsky:2009:ESO,
author = "Dmitry Gavinsky and Julia Kempe and Iordanis Kerenidis
and Ran Raz and Ronald de Wolf",
title = "Exponential Separation for One-Way Quantum
Communication Complexity, with Applications to
Cryptography",
journal = j-SIAM-J-COMPUT,
volume = "38",
number = "5",
pages = "1695--1708",
month = "????",
year = "2009",
CODEN = "SMJCAT",
DOI = "",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:22:04 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/38/5;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Geetha:2009:BIS,
author = "S. Geetha and Siva S. Sivatha Sindhu and N. Kamaraj",
title = "Blind image steganalysis based on content independent
statistical measures maximizing the specificity and
sensitivity of the system",
journal = j-COMPUT-SECUR,
volume = "28",
number = "7",
pages = "683--697",
month = oct,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809000285",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@PhdThesis{Gentry:2009:FHEa,
author = "Craig Gentry",
title = "A fully homomorphic encryption scheme",
type = "Ph.D. thesis",
school = "Department of Computer Science, Stanford University",
address = "Stanford, CA, USA",
pages = "x + 199",
year = "2009",
bibdate = "Wed May 08 08:04:35 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
jenson.stanford.edu:2210/unicorn",
URL = "http://crypto.stanford.edu/craig/;
http://crypto.stanford.edu/craig/craig-thesis.pdf",
acknowledgement = ack-nhfb,
advisor = "Dan Boneh",
}
@InProceedings{Gentry:2009:FHEb,
author = "Craig Gentry",
title = "Fully homomorphic encryption using ideal lattices",
crossref = "ACM:2009:SPA",
pages = "169--178",
year = "2009",
bibdate = "Wed Sep 1 10:42:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Goulding:2009:ESA,
author = "Tom Goulding",
title = "An encryption system in assembly language: a game-like
project for novice programmers",
journal = j-SIGCSE,
volume = "41",
number = "4",
pages = "40--44",
month = dec,
year = "2009",
CODEN = "SIGSD3",
DOI = "https://doi.org/10.1145/1709424.1709442",
ISSN = "0097-8418 (print), 2331-3927 (electronic)",
ISSN-L = "0097-8418",
bibdate = "Sat Nov 17 15:44:27 MST 2012",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib",
abstract = "This case study discusses the incorporation of
encryption systems development into the educational
journey of undergraduate computer science or game
development majors. We discuss the experience of first
semester Daniel Webster College sophomores who
attempted to develop the German WWII ENIGMA encryption
system in assembly language. By incorporating a real
world encryption system project into a beginning
computer architecture class students become deeply
immersed in numbering systems, hardware logic design,
operating system services and, of course instruction
set architectures. Of necessity, they also must refine
and develop their programming skills to an
extraordinary degree. During the past seven years we
have found that most students can develop a complete
software version of the complex and amazing ENIGMA
encryption system. We outline in this paper the
strategy that seems to lead to a successful outcome for
most students.",
acknowledgement = ack-nhfb,
fjournal = "SIGCSE Bulletin (ACM Special Interest Group on
Computer Science Education)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688",
}
@Article{Grassl:2009:CAS,
author = "Markus Grassl and Rainer Steinwandt",
title = "Cryptanalysis of an authentication scheme using
truncated polynomials",
journal = j-INFO-PROC-LETT,
volume = "109",
number = "15",
pages = "861--863",
day = "16",
month = jul,
year = "2009",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:37 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Grothoff:2009:TBS,
author = "Christian Grothoff and Krista Grothoff and Ryan
Stutsman and Ludmila Alkhutova and Mikhail Atallah",
title = "Translation-based steganography",
journal = j-J-COMP-SECUR,
volume = "17",
number = "3",
pages = "269--303",
month = "????",
year = "2009",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0320",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:18 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@Article{Guette:2009:ATK,
author = "Gilles Guette",
title = "Automating trusted key rollover in {DNSSEC}",
journal = j-J-COMP-SECUR,
volume = "17",
number = "6",
pages = "839--854",
month = "????",
year = "2009",
CODEN = "JCSIET",
DOI = "https://doi.org/10.3233/JCS-2009-0343",
ISSN = "0926-227X (print), 1875-8924 (electronic)",
ISSN-L = "0926-227X",
bibdate = "Tue May 24 06:24:31 MDT 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer Security",
journal-URL = "http://content.iospress.com/journals/journal-of-computer-security",
}
@InProceedings{Guinee:2009:NTR,
author = "R. A. Guinee and M. Blaszczyk",
booktitle = "{ICITST 2009. International Conference for Internet
Technology and Secured Transactions, 2009}",
title = "A novel true random binary sequence generator based on
a chaotic double scroll oscillator combination with a
pseudo random generator for cryptographic
applications",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--6",
year = "2009",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5402536",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5393958",
}
@Article{Haitner:2009:SHC,
author = "Iftach Haitner and Minh-Huyen Nguyen and Shien Jin Ong
and Omer Reingold and Salil Vadhan",
title = "Statistically Hiding Commitments and Statistical
Zero-Knowledge Arguments from Any One-Way Function",
journal = j-SIAM-J-COMPUT,
volume = "39",
number = "3",
pages = "1153--1218",
month = "????",
year = "2009",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
ISSN-L = "0097-5397",
bibdate = "Tue May 18 08:22:12 MDT 2010",
bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/39/3;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "SIAM Journal on Computing",
journal-URL = "http://epubs.siam.org/sicomp",
}
@Article{Halderman:2009:LWR,
author = "J. Alex Halderman and Seth D. Schoen and Nadia
Heninger and William Clarkson and William Paul and
Joseph A. Calandrino and Ariel J. Feldman and Jacob
Appelbaum and Edward W. Felten",
title = "Lest we remember: cold-boot attacks on encryption
keys",
journal = j-CACM,
volume = "52",
number = "5",
pages = "91--98",
month = may,
year = "2009",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1506409.1506429",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Apr 23 12:42:30 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Contrary to widespread assumption, dynamic RAM (DRAM),
the main memory in most modern computers, retains its
contents for several seconds after power is lost, even
at room temperature and even if removed from a
motherboard. Although DRAM becomes less reliable when
it is not refreshed, it is not immediately erased, and
its contents persist sufficiently for malicious (or
forensic) acquisition of usable full-system memory
images. We show that this phenomenon limits the ability
of an operating system to protect cryptographic key
material from an attacker with physical access to a
machine. It poses a particular threat to laptop users
who rely on disk encryption: we demonstrate that it
could be used to compromise several popular disk
encryption products without the need for any special
devices or materials. We experimentally characterize
the extent and predictability of memory retention and
report that remanence times can be increased
dramatically with simple cooling techniques. We offer
new algorithms for finding cryptographic keys in memory
images and for correcting errors caused by bit decay.
Though we discuss several strategies for mitigating
these risks, we know of no simple remedy that would
eliminate them.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@InCollection{Hallgren:2009:QC,
author = "Sean Hallgren and Ulrich Vollmer",
title = "Quantum computing",
crossref = "Bernstein:2009:PQC",
pages = "15--34",
year = "2009",
bibdate = "Thu Apr 21 17:17:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Han:2009:ICS,
author = "Dong-Guk Han and Dooho Choi and Howon Kim",
title = "Improved Computation of Square Roots in Specific
Finite Fields",
journal = j-IEEE-TRANS-COMPUT,
volume = "58",
number = "2",
pages = "188--196",
month = feb,
year = "2009",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.201",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 11:37:39 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4663058",
abstract = "In this paper, we study exponentiation in the specific
finite fields $ F_q $ with very special exponents such
as those that occur in algorithms for computing square
roots. Here, $q$ is a prime power, $ q = p^k $, where $
k > 1 $, and $k$ is odd. Our algorithmic approach
improves the corresponding exponentiation resulted from
the better rewritten exponent. To the best of our
knowledge, it is the first major improvement to the
Tonelli--Shanks algorithm, for example, the number of
multiplications can be reduced to at least 60 percent
on the average when $ p \equiv 1 \pmod 16 $. Several
numerical examples are given that show the speedup of
the proposed methods.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "cryptography; efficient computation; finite fields;
square roots",
}
@Book{Hardy:2009:AAC,
author = "Darel W. Hardy and Carol L. Walker and Fred Richman",
title = "Applied algebra: codes, ciphers, and discrete
algorithms",
publisher = pub-CRC,
address = pub-CRC:adr,
edition = "Second",
pages = "410",
year = "2009",
ISBN = "1-4200-7142-4 (hardcover)",
ISBN-13 = "978-1-4200-7142-9 (hardcover)",
LCCN = "QA268 .H365 2009",
bibdate = "Sat Jun 13 08:24:16 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Discrete mathematics and its applications",
acknowledgement = ack-nhfb,
remark = "A Chapman and Hall book.",
subject = "Coding theory; Computer security; Mathematics",
}
@Article{Harn:2009:DDB,
author = "Lein Harn and Jian Ren and Changlu Lin",
title = "Design of {DL}-based certificateless digital
signatures",
journal = j-J-SYST-SOFTW,
volume = "82",
number = "5",
pages = "789--793",
month = may,
year = "2009",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Hasan:2009:PHF,
author = "Ragib Hasan and Radu Sion and Marianne Winslett",
title = "Preventing history forgery with secure provenance",
journal = j-TOS,
volume = "5",
number = "4",
pages = "12:1--12:??",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1629080.1629082",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Tue Mar 16 15:34:12 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "As increasing amounts of valuable information are
produced and persist digitally, the ability to
determine the origin of data becomes important. In
science, medicine, commerce, and government, data
provenance tracking is essential for rights protection,
regulatory compliance, management of intelligence and
medical data, and authentication of information as it
flows through workplace tasks. While significant
research has been conducted in this area, the
associated security and privacy issues have not been
explored, leaving provenance information vulnerable to
illicit alteration as it passes through untrusted
environments.\par
In this article, we show how to provide strong
integrity and confidentiality assurances for data
provenance information at the kernel, file system, or
application layer. We describe Sprov, our
provenance-aware system prototype that implements
provenance tracking of data writes at the application
layer, which makes Sprov extremely easy to deploy. We
present empirical results that show that, for real-life
workloads, the runtime overhead of Sprov for recording
provenance with confidentiality and integrity
guarantees ranges from 1\% to 13\%, when all file
modifications are recorded, and from 12\% to 16\%, when
all file read and modifications are tracked.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
keywords = "audit; confidentiality; integrity; lineage;
provenance; security",
}
@Article{Heger:2009:CTQ,
author = "M. Heger",
title = "Cryptographers take on quantum computers ---
[update]",
journal = j-IEEE-SPECTRUM,
volume = "46",
number = "1",
pages = "14--14",
month = jan,
year = "2009",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2009.4734299",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Quantum computing",
}
@Article{Heron:2009:AES,
author = "Simon Heron",
title = "{Advanced Encryption Standard (AES)}",
journal = j-NETWORK-SECURITY,
volume = "2009",
number = "12",
pages = "8--12",
month = dec,
year = "2009",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(10)70006-4",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:11 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485810700064",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Herzberg:2009:DBE,
author = "Amir Herzberg",
title = "{DNS}-based email sender authentication mechanisms: a
critical review",
journal = j-COMPUT-SECUR,
volume = "28",
number = "8",
pages = "731--742",
month = nov,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809000492",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InCollection{Hirose:2009:SAD,
author = "S. Hirose",
title = "Security analysis of {DRBG} using {HMAC} in {NIST SP
800-90}",
crossref = "Chung:2009:ISA",
pages = "278--291",
year = "2009",
bibdate = "Tue Mar 18 11:22:57 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Holcomb:2009:PSS,
author = "D. E. Holcomb and W. P. Burleson and K. Fu",
title = "Power-Up {SRAM} State as an Identifying Fingerprint
and Source of True Random Numbers",
journal = j-IEEE-TRANS-COMPUT,
volume = "58",
number = "9",
pages = "1198--1210",
month = sep,
year = "2009",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.212",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 11:37:43 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4674345",
abstract = "Intermittently powered applications create a need for
low-cost security and privacy in potentially hostile
environments, supported by primitives including
identification and random number generation. Our
measurements show that power-up of SRAM produces a
physical fingerprint. We propose a system of
fingerprint extraction and random numbers in SRAM
(FERNS) that harvests static identity and randomness
from existing volatile CMOS memory without requiring
any dedicated circuitry. The identity results from
manufacture-time physically random device threshold
voltage mismatch, and the random numbers result from
runtime physically random noise. We use experimental
data from high-performance SRAM chips and the embedded
SRAM of the WISP UHF RFID tag to validate the
principles behind FERNS. For the SRAM chip, we
demonstrate that 8-byte fingerprints can uniquely
identify circuits among a population of 5,120 instances
and extrapolate that 24-byte fingerprints would
uniquely identify all instances ever produced. Using a
smaller population, we demonstrate similar identifying
ability from the embedded SRAM. In addition to
identification, we show that SRAM fingerprints capture
noise, enabling true random number generation. We
demonstrate that a 512-byte SRAM fingerprint contains
sufficient entropy to generate 128-bit true random
numbers and that the generated numbers pass the NIST
tests for runs, approximate entropy, and block
frequency.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Article{Hopper:2009:PSS,
author = "N. Hopper and L. von Ahn and J. Langford",
title = "Provably Secure Steganography",
journal = j-IEEE-TRANS-COMPUT,
volume = "58",
number = "5",
pages = "662--676",
month = may,
year = "2009",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2008.199",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 11:37:41 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4663056",
abstract = "Steganography is the problem of hiding secret messages
in ``innocent-looking'' public communication so that
the presence of the secret messages cannot be detected.
This paper introduces a cryptographic formalization of
steganographic security in terms of computational
indistinguishability from a channel, an indexed family
of probability distributions on cover messages. We use
cryptographic and complexity-theoretic proof techniques
to show that the existence of one-way functions and the
ability to sample from the channel are necessary
conditions for secure steganography. We then construct
a steganographic protocol, based on rejection sampling
from the channel, that is provably secure and has
nearly optimal bandwidth under these conditions. This
is the first known example of a general provably secure
steganographic protocol. We also give the first
formalization of ``robust'' steganography, where an
adversary attempts to remove any hidden messages
without unduly disrupting the cover channel. We give a
necessary condition on the amount of disruption the
adversary is allowed in terms of a worst case measure
of mutual information. We give a construction that is
provably secure and computationally efficient and has
nearly optimal bandwidth, assuming repeatable access to
the channel distribution.",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
keywords = "cryptographic protocols; probability; steganography",
}
@Book{Hromkovic:2009:AAH,
author = "Juraj Hromkovic",
title = "Algorithmic adventures: from knowledge to magic",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 363",
year = "2009",
ISBN = "3-540-85986-1",
ISBN-13 = "978-3-540-85986-4",
LCCN = "QA76.9.A43 H76 2009",
bibdate = "Tue May 7 09:24:29 MDT 2013",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib",
URL = "http://site.ebrary.com/lib/upcatalunya/docDetail.action?docID=10313472",
acknowledgement = ack-nhfb,
tableofcontents = "Preface \\
Contents \\
A Short Story About the Development of Computer Science
or Why Computer Science Is Not a Computer Driving
Licence \\
Algorithmics, or What Have Programming and Baking in
Common? \\
Infinity Is Not Equal to Infinity, or Why Infinity Is
Infinitely Important in Computer Science \\
Limits of Computability or Why Do There Exist Tasks
That Cannot Be Solved Automatically by Computers \\
Complexity Theory or What to Do When the Energy of the
Universe Doesn't Suffice for Performing a Computation?
\\
Randomness in Nature and as a Source of Efficiency in
Algorithmics \\
Cryptography, or How to Transform Drawbacks into
Advantages \\
Computing with DNA Molecules, or Biological Computer
Technology on the Horizon \\
Quantum Computers, or Computing in the Wonderland of
Particles \\
How to Make Good Decisions for an Unknown Future or How
to Foil an Adversary \\
References \\
Index",
}
@Article{Hu:2009:TRN,
author = "Yue Hu and Xiaofeng Liao and Kwok wo Wong and Qing
Zhou",
title = "A true random number generator based on mouse movement
and chaotic cryptography",
journal = j-CHAOS-SOLITONS-FRACTALS,
volume = "40",
number = "5",
pages = "2286--2293",
year = "2009",
CODEN = "CSFOEH",
ISSN = "0960-0779 (print), 1873-2887 (electronic)",
ISSN-L = "0960-0779",
bibdate = "Wed Jan 18 21:52:48 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "Chaos, solitons \& fractals",
}
@Article{Huang:2009:OSW,
author = "Y. L. Huang and P. H. Lu and J. D. Tygar and A. D.
Joseph",
title = "{OSNP}: Secure wireless authentication protocol using
one-time key",
journal = j-COMPUT-SECUR,
volume = "28",
number = "8",
pages = "803--815",
month = nov,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:18 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404809000558",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Hung:2009:FBA,
author = "Kuo Lung Hung and Shin-Wei He",
title = "Feature Based Affine Invariant Watermarking Robust to
Geometric Distortions",
journal = j-FUND-INFO,
volume = "92",
number = "1--2",
pages = "131--143",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0069",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:27 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Hwang:2009:KDB,
author = "Seong-seob Hwang and Sungzoon Cho and Sunghoon Park",
title = "Keystroke dynamics-based authentication for mobile
devices",
journal = j-COMPUT-SECUR,
volume = "28",
number = "1--2",
pages = "85--93",
month = feb # "\slash " # mar,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:15 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000965",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Jain:2009:NBC,
author = "Rahul Jain and Shengyu Zhang",
title = "New bounds on classical and quantum one-way
communication complexity",
journal = j-THEOR-COMP-SCI,
volume = "410",
number = "26",
pages = "2463--2477",
day = "6",
month = jun,
year = "2009",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:51 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Jain:2009:PQR,
author = "Rahul Jain and Jaikumar Radhakrishnan and Pranab Sen",
title = "A property of quantum relative entropy with an
application to privacy in quantum communication",
journal = j-J-ACM,
volume = "56",
number = "6",
pages = "33:1--33:32",
month = sep,
year = "2009",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1568318.1568323",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Fri Sep 4 13:33:31 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We prove the following information-theoretic property
about quantum states.\par
{\em Substate theorem:\/} Let $ \rho $ and $ \sigma $
be quantum states in the same Hilbert space with
relative entropy $ S(\rho || \sigma) : T r \rho (l o g
\rho - l o g \sigma) = c $. Then for all $ \epsilon > 0
$, there is a state $ \rho \prime $ such that the trace
distance $ || \rho \prime - \rho ||_{tr} : T r \sqrt
(\rho \prime - \rho)^2 \leq \epsilon $, and $ \rho
\prime / 2^{O(c / \epsilon 2)} \leq \sigma $.\par
It states that if the relative entropy of $ \rho $ and
$ \sigma $ is small, then there is a state $ \rho
\prime $ close to $ \rho $, i.e. with small trace
distance $ || \rho \prime - \rho ||_{tr} $, that when
scaled down by a factor $ 2^{\em O \/ }(c) $ `sits
inside', or becomes a `substate' of, $ \sigma $. This
result has several applications in quantum
communication complexity and cryptography. Using the
substate theorem, we derive a privacy trade-off for the
{\em set membership problem\/} in the two-party quantum
communication model. Here Alice is given a subset $ A
\subseteq [n] $, Bob an input $ i \in [n] $, and they
need to determine if $ i \in A $.\par
{\em Privacy trade-off for set membership:\/} In any
two-party quantum communication protocol for the set
membership problem, if Bob reveals only $k$ bits of
information about his input, then Alice must reveal at
least $ n / 2^{O(k)} $ bits of information about her
input.\par
We also discuss relationships between various
information theoretic quantities that arise naturally
in the context of the substate theorem.",
acknowledgement = ack-nhfb,
articleno = "33",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "Privacy; quantum communication complexity; quantum
information theory",
}
@Article{Jao:2009:EGB,
author = "David Jao and Stephen D. Miller and Ramarathnam
Venkatesan",
title = "Expander graphs based on {GRH} with an application to
elliptic curve cryptography",
journal = j-J-NUMBER-THEORY,
volume = "129",
number = "6",
pages = "1491--1504",
month = jun,
year = "2009",
CODEN = "JNUTA9",
DOI = "https://doi.org/10.1016/j.jnt.2008.11.006",
ISSN = "0022-314X (print), 1096-1658 (electronic)",
ISSN-L = "0022-314X",
bibdate = "Wed Jul 15 08:48:36 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jnumbertheory2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022314X09000213",
acknowledgement = ack-nhfb,
ajournal = "J. Number Theory",
fjournal = "Journal of Number Theory",
journal-URL = "http://www.sciencedirect.com/science/journal/0022314X",
}
@Article{Jaworski:2009:RKP,
author = "J. Jaworski and M. Ren and K. Rybarczyk",
title = "Random key predistribution for wireless sensor
networks using deployment knowledge",
journal = j-COMPUTING,
volume = "85",
number = "1--2",
pages = "57--76",
month = jun,
year = "2009",
CODEN = "CMPTA2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Sun Oct 31 11:09:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=85&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=85&issue=1&spage=57",
acknowledgement = ack-nhfb,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Jennings:2009:SLL,
author = "Trevor J. Jennings",
title = "{SPARK}: the {Libre} language and toolset for
high-assurance software engineering",
journal = j-SIGADA-LETTERS,
volume = "29",
number = "3",
pages = "9--10",
month = dec,
year = "2009",
CODEN = "AALEE5",
DOI = "https://doi.org/10.1145/1653616.1647426",
ISSN = "1094-3641 (print), 1557-9476 (electronic)",
ISSN-L = "1094-3641",
bibdate = "Mon Jun 21 14:04:37 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigada.bib",
abstract = "Level -Intermediate\par
SPARK is an annotated sub-language of Ada which is
unambiguous and suitable for rigorous static analysis.
It has been extensively used in industrial applications
where safety and security are paramount, such as
military aerospace, rail signaling, and high-grade
cryptographic systems.\par
The design of SPARK aligns closely with rigorous
engineering approaches such as PSP/TSP, Six- Sigma, and
the principles of the Lean Engineering movement in
taking a 'zero tolerance' approach to defect
reduction.\par
In this light, SPARK is far more than 'just a
programming language' - it offers a distinct
engineering mindset and discipline for the development
of high-assurance systems.\par
The tutorial, which is extracted from the four-day
'Software Engineering with SPARK' course will cover:
The rationale and design goals of SPARK, the core SPARK
language, and SPARK analyses including information
flow, exception freedom, and formal verification, and
the impact of SPARK on software process. The tutorial
will also cover the 'Libre' release of the SPARK
technology and the research topics that this opens,
such as more advanced forms of analysis and proof,
model checking, and language extensions.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGAda Ada Letters",
keywords = "Ada; engineering; software",
}
@Book{Joux:2009:AC,
author = "Antoine Joux",
title = "Algorithmic Cryptanalysis",
publisher = pub-CRC,
address = pub-CRC:adr,
pages = "501",
year = "2009",
ISBN = "1-4200-7002-9 (hardcover)",
ISBN-13 = "978-1-4200-7002-6 (hardcover)",
LCCN = "QA76.9.A43; QA76.9.A43 J693 2009",
bibdate = "Sat May 15 09:31:38 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
library.mit.edu:9909/mit01",
series = "Chapman and Hall/CRC cryptography and network
security",
acknowledgement = ack-nhfb,
remark = "I. Background \\
1. A bird's-eye view of modern cryptography \\
2. Elementary number theory and algebra background \\
II. Algorithms \\
3. Linear algebra \\
4. Sieve algorithms \\
5. Brute force cryptanalysis \\
6. The birthday paradox: Sorting or not? \\
7. Birthday-based algorithms for functions \\
8. Birthday attacks through quadrisection \\
9. Fourier and Hadamard-Walsh transforms \\
10. Lattice reduction \\
11. Polynomial systems and Grabner base computations
\\
III. Applications \\
12. Attacks on stream ciphers \\
13. Lattice-based cryptanalysis \\
14. Elliptic curves and pairings \\
15. Index calculus algorithms..",
subject = "Computer algorithms; Cryptography",
}
@InProceedings{Kalai:2009:SEU,
author = "Y. T. Kalai and Xin Li and A. Rao",
title = "$2$-Source Extractors under Computational Assumptions
and Cryptography with Defective Randomness",
crossref = "IEEE:2009:PAI",
pages = "617--626",
year = "2009",
DOI = "https://doi.org/10.1109/FOCS.2009.61",
bibdate = "Thu Apr 12 09:33:33 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5438528",
}
@InProceedings{Kamal:2009:FIN,
author = "A. A. Kamal and A. M. Youssef",
title = "An {FPGA} implementation of the {NTRUEncrypt}
cryptosystem",
crossref = "IEEE:2009:ISI",
pages = "209--??",
year = "2009",
DOI = "https://doi.org/10.1109/ICM.2009.5418649",
bibdate = "Thu Apr 21 10:33:23 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "The NTRU encryption algorithm, also known as
NTRUEncrypt, is a parameterized family of lattice-based
public key cryptosystems. Both the encryption and
decryption operations in NTRU are based on simple
polynomial multiplication which makes it very fast
compared to other alternatives such as RSA, and
elliptic-curve-based systems. Recently, the NTRU system
has been accepted to the IEEE P1363 standards under the
specifications for lattice-based public-key
cryptography (IEEE P1363.1). In this paper, we
investigate several hardware implementation options for
the NTRU encryption algorithm. In particular, by
utilizing the statistical properties of the distance
between the non-zero elements in the polynomials
involved in the encryption and decryption operations,
we present an architecture that offers different
area-speed trade-off and analyze its performance. A
prototype for the proposed design is implemented using
the virtex-E xcv1600e-8-fg860 FPGA chip.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; elliptic curve cryptography; elliptic
curve-based systems; elliptic curves; field
programmable gate arrays; FPGA chip; hardware;
information systems; lattice-based public key
cryptography; lattice-based public key cryptosystems;
microelectronics; NTRU encryption algorithm;
NTRUEncrypt; NTRUEncrypt cryptosystem; Performance
analysis; polynomial multiplication; Polynomials;
Public key; Public key cryptography",
}
@Article{Kamat:2009:TPW,
author = "Pandurang Kamat and Wenyuan Xu and Wade Trappe and
Yanyong Zhang",
title = "Temporal privacy in wireless sensor networks: {Theory}
and practice",
journal = j-TOSN,
volume = "5",
number = "4",
pages = "28:1--28:??",
month = nov,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1614379.1614380",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:24:11 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Although the content of sensor messages describing
``events of interest'' may be encrypted to provide
confidentiality, the context surrounding these events
may also be sensitive and therefore should be protected
from eavesdroppers. An adversary armed with knowledge
of the network deployment, routing algorithms, and the
base-station (data sink) location can infer the
temporal patterns of interesting events by merely
monitoring the arrival of packets at the sink, thereby
allowing the adversary to remotely track the
spatio-temporal evolution of a sensed event. In this
paper we introduce the problem of temporal privacy for
delay-tolerant sensor networks, and propose adaptive
buffering at intermediate nodes on the source-sink
routing path to obfuscate temporal information from the
adversary. We first present the effect of buffering on
temporal privacy using an information-theoretic
formulation, and then examine the effect that delaying
packets has on buffer occupancy. We observe that
temporal privacy and efficient buffer utilization are
contrary objectives, and then present an adaptive
buffering strategy that effectively manages these
tradeoffs. Finally, we evaluate our privacy enhancement
strategies using simulations, where privacy is
quantified in terms of the adversary's mean square
error.",
acknowledgement = ack-nhfb,
articleno = "28",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "privacy; security; Sensor networks; temporal privacy",
}
@Article{Kamel:2009:RSW,
author = "Ibrahim Kamel and Qutaiba Albluwi",
title = "A robust software watermarking for copyright
protection",
journal = j-COMPUT-SECUR,
volume = "28",
number = "6",
pages = "395--409",
month = sep,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S016740480900008X",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@InProceedings{Kasper:2009:FTA,
author = "Emilia K{\"a}sper and Peter Schwabe",
editor = "????",
booktitle = "{Cryptographic Hardware and Embedded Systems--CHES
2009}",
title = "Faster and timing-attack resistant {AES--GCM}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "1--17",
year = "2009",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 12:19:13 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 45]{Schneier:2015:SWC}.",
}
@Article{Katz:2009:ESA,
author = "Jonathan Katz and Rafail Ostrovsky and Moti Yung",
title = "Efficient and secure authenticated key exchange using
weak passwords",
journal = j-J-ACM,
volume = "57",
number = "1",
pages = "3:1--3:39",
month = nov,
year = "2009",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1613676.1613679",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Mon Mar 15 11:20:08 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Mutual authentication and authenticated key exchange
are fundamental techniques for enabling secure
communication over public, insecure networks. It is
well known how to design secure protocols for achieving
these goals when parties share {\em high-entropy\/}
cryptographic keys in advance of the authentication
stage. Unfortunately, it is much more common for users
to share weak, {\em low-entropy\/} passwords which
furthermore may be chosen from a known space of
possibilities (say, a dictionary of English words). In
this case, the problem becomes much more difficult as
one must ensure that protocols are immune to {\em
off-line dictionary attacks\/} in which an adversary
exhaustively enumerates all possible passwords in an
attempt to determine the correct one.\par
We propose a 3-round protocol for password-only
authenticated key exchange, and provide a rigorous
proof of security for our protocol based on the
decisional Diffie--Hellman assumption. The protocol
assumes only public parameters --- specifically, a
``common reference string'' --- which can be
``hard-coded'' into an implementation of the protocol;
in particular, and in contrast to some previous work,
our protocol does {\em not\/} require either party to
pre-share a public key. The protocol is also remarkably
efficient, requiring computation only (roughly) 4 times
greater than ``classical'' Diffie--Hellman key exchange
that provides no authentication at all. Ours is the
first protocol for password-only authentication that is
both {\em practical\/} and {\em provably-secure using
standard cryptographic assumptions}.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "Journal of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "Authentication; cryptography; passwords",
}
@Article{Kejariwal:2009:ELL,
author = "Arun Kejariwal and Alexander V. Veidenbaum and
Alexandru Nicolau and Milind Girkar and Xinmin Tian and
Hideki Saito",
title = "On the exploitation of loop-level parallelism in
embedded applications",
journal = j-TECS,
volume = "8",
number = "2",
pages = "10:1--10:??",
month = jan,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1457255.1457257",
ISSN = "1539-9087 (print), 1558-3465 (electronic)",
ISSN-L = "1539-9087",
bibdate = "Thu Feb 5 19:15:05 MST 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tecs.bib",
abstract = "Advances in the silicon technology have enabled
increasing support for hardware parallelism in embedded
processors. Vector units, multiple processors/cores,
multithreading, special-purpose accelerators such as
DSPs or cryptographic engines, or a combination of the
above have appeared in a number of processors. They
serve to address the increasing performance
requirements of modern embedded applications. To what
extent the available hardware parallelism can be
exploited is directly dependent on the amount of
parallelism inherent in the given application and the
congruence between the granularity of hardware and
application parallelism. This paper discusses how
loop-level parallelism in embedded applications can be
exploited in hardware and software. Specifically, it
evaluates the efficacy of automatic loop
parallelization and the performance potential of
different types of parallelism, viz., true thread-level
parallelism (TLP), speculative thread-level parallelism
and vector parallelism, when executing loops.
Additionally, it discusses the interaction between
parallelization and vectorization. Applications from
both the industry-standard EEMBC{\reg},$^1$ 1.1, EEMBC
2.0 and the academic MiBench embedded benchmark suites
are analyzed using the Intel{\reg}$^2$ C compiler. The
results show the performance that can be achieved today
on real hardware and using a production compiler,
provide upper bounds on the performance potential of
the different types of thread-level parallelism, and
point out a number of issues that need to be addressed
to improve performance. The latter include
parallelization of libraries such as libc and design of
parallel algorithms to allow maximal exploitation of
parallelism. The results also point to the need for
developing new benchmark suites more suitable to
parallel compilation and execution.\par
$^1$ Other names and brands may be claimed as the
property of others.\par
$^2$ Intel is a trademark of Intel Corporation or its
subsidiaries in the United States and other
countries.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Embedded Computing Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840",
keywords = "libraries; Multi-cores; multithreading; parallel
loops; programming models; system-on-chip (Soc);
thread-level speculation; vectorization",
}
@Article{Keller:2009:ECC,
author = "Maurice Keller and Andrew Byrne and William P.
Marnane",
title = "Elliptic Curve Cryptography on {FPGA} for Low-Power
Applications",
journal = j-TRETS,
volume = "2",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1502781.1502783",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Mon Jun 1 18:15:27 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Elliptic curve cryptography has generated a lot of
research interest due to its ability to provide greater
security per bit compared to public key systems such as
RSA. The designer of an elliptic curve hardware
accelerator is faced with many choices at design time,
each of which can impact the performance of the
accelerator in different ways. There are many examples
in the literature of how these design choices can
effect the area and/or speed of an elliptic curve
hardware accelerator. The effect of design choices on
power and energy consumption in elliptic curve hardware
has been less well studied. This article studies the
effect of design choices on the power and energy
consumption of an FPGA-based reconfigurable elliptic
curve hardware accelerator. A reconfigurable processor
has been used for different system parameters and the
power and energy consumption measured. The power and
energy results are presented and compared.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "Cryptography; elliptic curves; FPGA; low-power",
}
@Article{Kieu:2009:HSI,
author = "The Duc Kieu and Chin-Chen Chang",
title = "A high stego-image quality steganographic scheme with
reversibility and high payload using multiple embedding
strategy",
journal = j-J-SYST-SOFTW,
volume = "82",
number = "10",
pages = "1743--1752",
month = oct,
year = "2009",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Kieu:2009:IAB,
author = "The Duc Kieu and Chin-Chen Chang",
title = "An Image Authentication Based on Discrete {Fourier}
Transform",
journal = j-FUND-INFO,
volume = "97",
number = "4",
pages = "369--379",
month = dec,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-207",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:09:48 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Kiltz:2009:DCC,
author = "Eike Kiltz and David Galindo",
title = "Direct chosen-ciphertext secure identity-based key
encapsulation without random oracles",
journal = j-THEOR-COMP-SCI,
volume = "410",
number = "47--49",
pages = "5093--5111",
day = "6",
month = nov,
year = "2009",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Mar 28 21:21:56 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/03043975",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975",
}
@Article{Kim:2009:DCA,
author = "Jongtack Kim and Saewoong Bahk",
title = "Design of certification authority using secret
redistribution and multicast routing in wireless mesh
networks",
journal = j-COMP-NET-AMSTERDAM,
volume = "53",
number = "1",
pages = "98--109",
day = "16",
month = jan,
year = "2009",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Apr 2 08:42:29 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/13891286",
acknowledgement = ack-nhfb,
fjournal = "Computer Networks",
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
@Article{Kim:2009:SVN,
author = "Soongohn Kim and Seoksoo Kim and Geuk Lee",
title = "Secure verifiable non-interactive oblivious transfer
protocol using {RSA} and bit commitment on distributed
environment",
journal = j-FUT-GEN-COMP-SYS,
volume = "25",
number = "3",
pages = "352--357",
month = mar,
year = "2009",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Sep 11 13:08:14 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Klivans:2009:CHL,
author = "Adam R. Klivans and Alexander A. Sherstov",
title = "Cryptographic hardness for learning intersections of
halfspaces",
journal = j-J-COMP-SYS-SCI,
volume = "75",
number = "1",
pages = "2--12",
month = jan,
year = "2009",
CODEN = "JCSSBM",
DOI = "https://doi.org/10.1016/j.jcss.2008.07.008",
ISSN = "0022-0000 (print), 1090-2724 (electronic)",
ISSN-L = "0022-0000",
bibdate = "Tue Jan 29 15:27:09 MST 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0022000008000706",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computer and System Sciences",
journal-URL = "http://www.sciencedirect.com/science/journal/00220000",
}
@Article{Klonowski:2009:SGS,
author = "Marek Klonowski and Lukasz Krzywiecki and Miroslaw
Kutylowski and Anna Lauks",
title = "Step-out group signatures",
journal = j-COMPUTING,
volume = "85",
number = "1--2",
pages = "137--151",
month = jun,
year = "2009",
CODEN = "CMPTA2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Sun Oct 31 11:09:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=85&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=85&issue=1&spage=137",
acknowledgement = ack-nhfb,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Koo:2009:SVN,
author = "Woo Kwon Koo and Jung Yeon Hwang and Dong Hoon Lee",
title = "Security vulnerability in a non-interactive {ID}-based
proxy re-encryption scheme",
journal = j-INFO-PROC-LETT,
volume = "109",
number = "23--24",
pages = "1260--1262",
day = "15",
month = nov,
year = "2009",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:45 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Kornblum:2009:IBD,
author = "Jesse D. Kornblum",
title = "Implementing {BitLocker} drive encryption for forensic
analysis",
journal = "Digital Investigation",
volume = "5",
number = "3",
pages = "75--84",
month = "????",
year = "2009",
DOI = "????",
bibdate = "Mon Mar 09 12:26:07 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 50]{Schneier:2015:SWC}.",
}
@Article{Kumar:2009:UAU,
author = "Ajay Kumar and David Zhang",
title = "User Authentication Using Fusion of Face and
Palmprint",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "9",
number = "2",
pages = "251--270",
month = apr,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467809003423",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Lao:2009:ORA,
author = "Yuanwei Lao and Yuan F. Zheng",
title = "Optimal Rate Allocation for Logo Watermarking",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "9",
number = "1",
pages = "1--25",
month = jan,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467809003319",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Lavoue:2009:LRM,
author = "Guillaume Lavou{\'e}",
title = "A local roughness measure for {$3$D} meshes and its
application to visual masking",
journal = j-TAP,
volume = "5",
number = "4",
pages = "21:1--21:??",
month = jan,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1462048.1462052",
ISSN = "1544-3558 (print), 1544-3965 (electronic)",
ISSN-L = "1544-3558",
bibdate = "Mon Feb 2 14:38:02 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "3D models are subject to a wide variety of processing
operations such as compression, simplification or
watermarking, which may introduce some geometric
artifacts on the shape. The main issue is to maximize
the compression/simplification ratio or the watermark
strength while minimizing these visual degradations.
However few algorithms exploit the human visual system
to {\em hide\/} these degradations, while perceptual
attributes could be quite relevant for this task.
Particularly, the {\em masking effect\/} defines the
fact that one visual pattern can hide the visibility of
another. In this context we introduce an algorithm for
estimating the {\em roughness\/} of a 3D mesh, as a
local measure of geometric noise on the surface.
Indeed, a textured (or {\em rough\/}) region is able to
hide geometric distortions much better than a smooth
one. Our measure is based on curvature analysis on
local windows of the mesh and is independent of the
resolution/connectivity of the object. The accuracy and
the robustness of our measure, together with its
relevance regarding visual masking have been
demonstrated through extensive comparisons with
state-of-the-art and subjective experiment. Two
applications are also presented, in which the roughness
is used to lead (and improve) respectively compression
and watermarking algorithms.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Applied Perception (TAP)",
keywords = "3D mesh; Curvature; Masking; Roughness; subjective
evaluation",
}
@Article{Law:2009:EEL,
author = "Yee Wei Law and Marimuthu Palaniswami and Lodewijk
{Van Hoesel} and Jeroen Doumen and Pieter Hartel and
Paul Havinga",
title = "Energy-efficient link-layer jamming attacks against
wireless sensor network {MAC} protocols",
journal = j-TOSN,
volume = "5",
number = "1",
pages = "6:1--6:??",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1464420.1464426",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:22:49 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "A typical wireless sensor node has little protection
against radio jamming. The situation becomes worse if
energy-efficient jamming can be achieved by exploiting
knowledge of the data link layer. Encrypting the
packets may help to prevent the jammer from taking
actions based on the content of the packets, but the
temporal arrangement of the packets induced by the
nature of the protocol might unravel patterns that the
jammer can take advantage of, even when the packets are
encrypted.\par
By looking at the packet interarrival times in three
representative MAC protocols, S-MAC, LMAC, and B-MAC,
we derive several jamming attacks that allow the jammer
to jam S-MAC, LMAC, and B-MAC energy efficiently. The
jamming attacks are based on realistic assumptions. The
algorithms are described in detail and simulated. The
effectiveness and efficiency of the attacks are
examined. In addition, we validate our simulation model
by comparing its results with measurements obtained
from actual implementation on our sensor node
prototypes. We show that it takes little effort to
implement such effective jammers, making them a
realistic threat.\par
Careful analysis of other protocols belonging to the
respective categories of S-MAC, LMAC, and B-MAC reveals
that those protocols are, to some extent, also
susceptible to our attacks. The result of this
investigation provides new insights into the security
considerations of MAC protocols.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "clustering; denial-of-service attacks; expectation
maximization; jamming; MAC protocols",
}
@Article{Lawson:2009:SCA,
author = "Nate Lawson",
title = "Side-Channel Attacks on Cryptographic Software",
journal = j-IEEE-SEC-PRIV,
volume = "7",
number = "6",
pages = "65--68",
month = nov # "\slash " # dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2009.165",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu May 13 09:49:48 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Misc{Lawson:2009:TAG,
author = "Nate Lawson",
title = "Timing attack in {Google Keyczar} library",
howpublished = "Web site.",
year = "2009",
bibdate = "Mon Mar 09 15:51:15 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://rdist.root.org/2009/05/28/timing-attack-in-google-keyczar-library",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 54]{Schneier:2015:SWC}.",
}
@Article{Lee:2009:CET,
author = "Tian-Fu Lee and Jenn-Long Liu and Mei-Jiun Sung and
Shiueng-Bien Yang and Chia-Mei Chen",
title = "Communication-efficient three-party protocols for
authentication and key agreement",
journal = j-COMPUT-MATH-APPL,
volume = "58",
number = "4",
pages = "641--648",
month = aug,
year = "2009",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:50:28 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122109003757",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
@Article{Lee:2009:NCA,
author = "Cheng-Chi Lee and Min-Shiang Hwang and Shiang-Feng
Tzeng",
title = "A New Convertible Authenticated Encryption Scheme
Based on the {ElGamal} Cryptosystem",
journal = j-INT-J-FOUND-COMP-SCI,
volume = "20",
number = "2",
pages = "351--359",
month = apr,
year = "2009",
CODEN = "IFCSEN",
DOI = "https://doi.org/10.1142/S0129054109006607",
ISSN = "0129-0541 (print), 1793-6373 (electronic)",
ISSN-L = "0129-0541",
bibdate = "Tue Aug 31 07:37:14 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijfcs/mkt/archive.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Foundations of Computer
Science",
journal-URL = "http://www.worldscientific.com/loi/ijfcs",
}
@Article{Lee:2009:SAF,
author = "C. Lee and J. Kim and S. Hong and Y.-S. Lee",
title = "Security Analysis of the Full-Round {CHESS}-64 Cipher
Suitable for Pervasive Computing Environments",
journal = j-J-UCS,
volume = "15",
number = "5",
pages = "1007--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 22:38:58 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_5/security_analysis_of_the",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Levi:2009:ULM,
author = "Albert Levi and Can Berk G{\"u}der",
title = "Understanding the limitations of {S/MIME} digital
signatures for e-mails: a {GUI} based approach",
journal = j-COMPUT-SECUR,
volume = "28",
number = "3--4",
pages = "105--120",
month = may # "\slash " # jun,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000783",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Li:2009:ATN,
author = "Jiangtao Li and Ninghui Li and William H.
Winsborough",
title = "Automated trust negotiation using cryptographic
credentials",
journal = j-TISSEC,
volume = "13",
number = "1",
pages = "2:1--2:??",
month = oct,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1609956.1609958",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Tue Mar 16 10:18:12 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
}
@Article{Liang:2009:AIE,
author = "Zhenkai Liang and Weiqing Sun and V. N.
Venkatakrishnan and R. Sekar",
title = "{Alcatraz}: An Isolated Environment for Experimenting
with Untrusted Software",
journal = j-TISSEC,
volume = "12",
number = "3",
pages = "14:1--14:37",
month = jan,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1455526.1455527",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 2 18:03:37 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In this article, we present an approach for realizing
a {\em safe execution environment (SEE)\/} that enables
users to ``try out'' new software (or configuration
changes to existing software) without the fear of
damaging the system in any manner. A key property of
our SEE is that it faithfully reproduces the behavior
of applications, as if they were running natively on
the underlying (host) operating system. This is
accomplished via {\em one-way isolation\/}: processes
running within the SEE are given read-access to the
environment provided by the host OS, but their write
operations are prevented from escaping outside the SEE.
As a result, SEE processes cannot impact the behavior
of host OS processes, or the integrity of data on the
host OS. SEEs support a wide range of tasks, including:
study of malicious code, controlled execution of
untrusted software, experimentation with software
configuration changes, testing of software patches, and
so on. It provides a convenient way for users to
inspect system changes made within the SEE. If these
changes are not accepted, they can be rolled back at
the click of a button. Otherwise, the changes can be
committed so as to become visible outside the SEE. We
provide consistency criteria that ensure semantic
consistency of the committed results. We develop two
different implementation approaches, one in {\em
user-land\/} and the other in the {\em OS kernel}, for
realizing a safe-execution environment. Our
implementation results show that most software,
including fairly complex server and client
applications, can run successfully within our SEEs. It
introduces low performance overheads, typically below
10 percent.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "Isolation; one-way isolation",
}
@Article{Lim:2009:OPG,
author = "Sun Sun Lim and Hichang Cho and Milagros Rivera
Sanchez",
title = "Online privacy, government surveillance and national
{ID} cards",
journal = j-CACM,
volume = "52",
number = "12",
pages = "116--120",
month = dec,
year = "2009",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1610252.1610283",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Feb 4 17:12:05 MST 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This study explores whether internet users' concerns
for personal information privacy, principally
manifested as online privacy, are related to their
attitudes to government surveillance and national ID
cards (often perceived as a surveillance tool). This is
a relationship which needs to be explored in-depth
because of three concurrent trends -- first, the push
towards e-government, where citizen-government
transactions are increasingly conducted online; second,
the growing use of smart cards, RFID tags and other
portable information collection and transmission
devices by governments and businesses; and third, calls
for greater government surveillance, both online and
offline, to counter terrorism in the post 9/11
environment.\par
While prior research has dealt with individual concerns
about online privacy and individual concerns about
government surveillance, studies exploring the
relationship between the two are limited. This study
seeks to fill that gap by surveying Internet users
across five cities which vary in their experience of
government surveillance and the use of national ID
cards -- Bangalore, New York, Seoul, Singapore and
Sydney.\par
Personal information privacy is the individual's
ability to personally control information about
him/herself. Such information could include anything
from one's birth registration details, to the
identities and coordinates of one's next-of-kin, income
and expenditure patterns and even health records. In
countries where day-to-day transactions with commercial
and government entities are increasingly being
conducted online, involving the electronic collection
of personal information, online privacy is the
principal manifestation of personal information
privacy.\par
As e-commerce and e-government services become more
pervasive, Internet users' concerns about online
privacy are likely to grow. Individual online privacy
concerns have been classified into improper
acquisition, improper use and privacy invasion.$^{12}$
Concerns about improper acquisition relate to
unauthorized access to personal information, improper
collection of one's private information and improper
monitoring of consumers' online activities. Concerns
about improper use cover unauthorized analysis of
consumers' online shopping behavior and the subsequent
business-to-business transfer of such analyses.
Concerns about privacy invasion refer to the
transmission of information to Internet users without
their prior consent, such as spam, as well as the
improper storage of personal information. To maintain
their online privacy, Internet users can engage in
self-protective behaviour such as opting out, using
privacy enhancing technologies, reading privacy
policies, or checking trust marks.\par
Studies have been conducted to test concern about
online privacy as a function of demographic variables.
Sheehan$^{10}$ found that gender was a significant
factor in that female consumers were generally more
concerned about their personal privacy than male
consumers. In general, older consumers$^2$ were also
more concerned about online privacy. The relationship
between consumers' experience with the Internet and
online privacy concerns has also been explored. Bellman
et al.$^2$ reported that consumers' online privacy
concerns diminished with Internet experience. As more
consumers use the Internet and the average level of
experience rises, online privacy concerns should
gradually diminish. In general, studies have
demonstrated that demographic variables and
Internet-related experiences significantly affect
Internet users' concern about online privacy.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Article{Lin:2009:DMG,
author = "Song Lin and Biao Wang and Zhoujun Li",
title = "Digital multisignature on the generalized conic curve
over {$ Z_n $}",
journal = j-COMPUT-SECUR,
volume = "28",
number = "1--2",
pages = "100--104",
month = feb # "\slash " # mar,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:15 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000801",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Book{Lunde:2009:BCU,
editor = "Paul Lunde",
title = "The book of codes: understanding the world of hidden
messages: an illustrated guide to signs, symbols,
ciphers, and secret languages",
publisher = "University of California Press",
address = "Berkeley, CA",
pages = "279",
year = "2009",
ISBN = "0-520-26013-9",
ISBN-13 = "978-0-520-26013-9",
LCCN = "Z103 .B56 2009",
bibdate = "Sat May 15 09:17:33 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.loc.gov/catdir/enhancements/fy1002/2009281679-b.html;
http://www.loc.gov/catdir/enhancements/fy1002/2009281679-d.html",
acknowledgement = ack-nhfb,
subject = "Ciphers; Cryptography",
tableofcontents = "THE FIRST CODES: Reading the landscape \\
Tracking animals \\
Bushcraft signs \\
Early petroglyphs \\
First writing systems \\
Reading cuneiform \\
Alphabets and scripts \\
The evolution of numerical systems \\
Linear A and Linear B \\
The Phaistos disc \\
The mystery of hieroglyphs \\
Hieroglyphs revealed \\
The riddle of the Maya \\
Indigenous traditions \\
SECTS, SYMBOLS, and SECRET SOCIETIES: Early Christians
\\
The pentangle \\
Divination \\
Heresies, sects and cults \\
Rosslyn Chapel \\
Alchemy \\
Kabbalism \\
Necromancy \\
Rosicrucians \\
Freemasons \\
CODES FOR SECRECY: The art of concealment \\
For your eyes only \\
Frequency analysis \\
Disguising ciphers \\
Medieval cipher systems \\
The Babington plot \\
The da Vinci code \\
Ciphertexts and keys \\
Grilles \\
Spies and black chambers \\
Mechanical devices \\
Hidden in plain sight \\
COMMUNICATING AT A DISTANCE: Long-distance alarms \\
Flag signals \\
Semaphore and the telegraph \\
Morse code \\
Person to person \\
CODES OF WAR: Classical codes of war \\
The 'indecipherable' code \\
The great cipher \\
19th-century innovations \\
Military map codes \\
Field signals \\
The Zimmermann telegram \\
Enigma: the 'unbreakable' system \\
WWII codes and code breakers \\
Cracking enigma \\
Navajo windtalkers \\
Cold war codes \\
CODES OF THE UNDERWORLD: Street slang \\
From Samurai to Yakuza \\
Cockney rhyming slang \\
The Mob \\
Ramblers' sign language \\
Cops and codes \\
The zodiac mystery \\
The zodiac legacy \\
Graffiti \\
Youth codes \\
Digital subversion \\
.. ENCODING THE WORLD: Describing time \\
Describing form \\
Force and motion \\
Mathematics: the indescribable \\
The periodic table \\
Defining the world \\
Encoding the landscape \\
Navigation \\
Taxonomy \\
The genetic code \\
Genetic ancestry \\
Using the genetic code \\
CODES OF CIVILIZATION: Codes of construction \\
Taoist mysticism \\
South Asian sacred imagery \\
The language of Buddhism \\
The patterns of Islam \\
Mysteries of the North \\
Medieval visual sermons \\
Stained glass windows \\
Renaissance iconography \\
The age of reason \\
Victoriana \\
Textiles, carpets, and embroidery \\
CODES OF COMMERCE: Commercial codes \\
Brands and trademarks \\
Makers' marks \\
Codes of work \\
Currency and counterfeits \\
The book in your hands \\
CODES OF HUMAN BEHAVIOR: Body language \\
Survival signals \\
Sporting codes \\
Etiquette \\
Dressing your message \\
Heraldry \\
Formal dress codes \\
Decoding the unconscious \\
The language of dreams \\
VISUAL CODES: Signs and signage \\
Highway codes \\
Challenged communication \\
Describing music \\
Musical scores \\
Animal talk \\
Extraterrestrials \\
IMAGINARY CODES: Modern magic and mayhem \\
The Bible code \\
The Beale Papers \\
Mystery and imagination \\
Fantasy codes \\
Doomsday codes \\
THE DIGITAL AGE. The first computers \\
Supercomputers \\
Talking to computers \\
Alice, Bob, and Eve \\
Future medicine \\
Where are codes taking us?",
}
@Article{Ma:2009:NAS,
author = "Di Ma and Gene Tsudik",
title = "A new approach to secure logging",
journal = j-TOS,
volume = "5",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1502777.1502779",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Tue Mar 16 15:33:38 MDT 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/tos/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tos.bib",
abstract = "The need for secure logging is well-understood by the
security professionals, including both researchers and
practitioners. The ability to efficiently verify all
(or some) log entries is important to any application
employing secure logging techniques. In this article,
we begin by examining the state of the art in secure
logging and identify some problems inherent to systems
based on trusted third-party servers. We then propose a
different approach to secure logging based upon
recently developed Forward-Secure Sequential Aggregate
(FssAgg) authentication techniques. Our approach offers
both space-efficiency and provable security. We
illustrate two concrete schemes --- one
private-verifiable and one public-verifiable --- that
offer practical secure logging without any reliance on
online trusted third parties or secure hardware. We
also investigate the concept of immutability in the
context of forward-secure sequential aggregate
authentication to provide finer grained verification.
Finally we evaluate proposed schemes and report on our
experience with implementing them within a secure
logging system.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
keywords = "forward secure sequential aggregate (FssAgg)
authentication; forward-secure stream integrity; MACs;
Secure logging; signatures; truncation attack",
}
@Article{Mahdian:2009:UNI,
author = "Babak Mahdian and Stanislav Saic",
title = "Using noise inconsistencies for blind image
forensics",
journal = j-IMAGE-VIS-COMPUT,
volume = "27",
number = "10",
pages = "1497--1503",
year = "2009",
CODEN = "IVCODK",
DOI = "https://doi.org/10.1016/j.imavis.2009.02.001",
ISSN = "0262-8856",
ISSN-L = "0262-8856",
bibdate = "Wed Jan 28 10:08:12 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Special Section: Computer Vision Methods for Ambient
Intelligence",
URL = "http://www.sciencedirect.com/science/article/pii/S0262885609000146",
abstract = "A commonly used tool to conceal the traces of
tampering is the addition of locally random noise to
the altered image regions. The noise degradation is the
main cause of failure of many active or passive image
forgery detection methods. Typically, the amount of
noise is uniform across the entire authentic image.
Adding locally random noise may cause inconsistencies
in the image's noise. Therefore, the detection of
various noise levels in an image may signify tampering.
In this paper, we propose a novel method capable of
dividing an investigated image into various partitions
with homogeneous noise levels. In other words, we
introduce a segmentation method detecting changes in
noise level. We assume the additive white Gaussian
noise. Several examples are shown to demonstrate the
proposed method's output. An extensive quantitative
measure of the efficiency of the noise estimation part
as a function of different noise standard deviations,
region sizes and various {JPEG} compression qualities
is proposed as well.",
acknowledgement = ack-nhfb,
fjournal = "Image and Vision Computing",
keywords = "Benford's Law; Digital forgery; Image forensics; Image
segmentation; Image tampering; Noise inconsistency",
}
@Article{Majzoobi:2009:TDI,
author = "Mehrdad Majzoobi and Farinaz Koushanfar and Miodrag
Potkonjak",
title = "Techniques for Design and Implementation of Secure
Reconfigurable {PUFs}",
journal = j-TRETS,
volume = "2",
number = "1",
pages = "5:1--5:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1502781.1502786",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Mon Jun 1 18:15:27 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Physically unclonable functions (PUFs) provide a basis
for many security and digital rights management
protocols. PUF-based security approaches have numerous
comparative strengths with respect to traditional
cryptography-based techniques, including resilience
against physical and side channel attacks and
suitability for lightweight protocols. However,
classical delay-based PUF structures have a number of
drawbacks including susceptibility to guessing, reverse
engineering, and emulation attacks, as well as
sensitivity to operational and environmental
variations.\par
To address these limitations, we have developed a new
set of techniques for FPGA-based PUF design and
implementation. We demonstrate how reconfigurability
can be exploited to eliminate the stated PUF
limitations. We also show how FPGA-based PUFs can be
used for privacy protection. Furthermore,
reconfigurability enables the introduction of new
techniques for PUF testing. The effectiveness of all
the proposed techniques is validated using extensive
implementations, simulations, and statistical
analysis.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "hardware security; physically unclonable functions;
process variation; Reconfigurable systems",
}
@Article{Manulis:2009:SMF,
author = "Mark Manulis and J{\"o}rg Schwenk",
title = "Security model and framework for information
aggregation in sensor networks",
journal = j-TOSN,
volume = "5",
number = "2",
pages = "13:1--13:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1498915.1498919",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:23:16 MDT 2010",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tosn.bib",
abstract = "Information aggregation is an important operation in
wireless sensor networks (WSNs) executed for the
purpose of monitoring and reporting environmental data.
Due to the performance constraints of sensor nodes the
in-network form of the aggregation is especially
attractive since it allows saving expensive resources
during frequent network queries. Easy accessibility of
networks and nodes and almost no physical protection
against corruptions raise high security challenges.
Protection against attacks aiming to falsify the
aggregated result is considered to be of prime
importance.\par
In this article we design the first general framework
for secure information aggregation in WSNs focusing on
scenarios where aggregation is performed by one of its
nodes. The framework achieves security against node
corruptions and is based solely on the symmetric
cryptographic primitives that are more suitable for
WSNs in terms of efficiency. We analyze performance of
the framework and unlike many previous approaches
increase confidence in it by a rigorous proof of
security within the specially designed {\em formal
security model.\/}",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "Aggregation; framework; in-network processing;
provable security; wireless sensor network",
}
@Article{Mashatan:2009:ITC,
author = "Atefeh Mashatan and Douglas R. Stinson",
title = "Interactive two-channel message authentication based
on {Interactive--Collision Resistant} hash functions",
journal = j-INT-J-INFO-SEC,
volume = "8",
number = "1",
pages = "49--60",
month = feb,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1007/s10207-008-0063-0",
ISSN = "1615-5262 (print), 1615-5270 (electronic)",
ISSN-L = "1615-5262",
bibdate = "Tue Jan 23 16:01:30 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib",
URL = "http://link.springer.com/article/10.1007/s10207-008-0063-0",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Information Security",
journal-URL = "https://link.springer.com/journal/10207",
keywords = "Interactive--Collision Resistant (ICR) hash function",
}
@Article{McEvoy:2009:IWH,
author = "Robert P. McEvoy and Colin C. Murphy and William P.
Marnane and Michael Tunstall",
title = "Isolated {WDDL}: a Hiding Countermeasure for
Differential Power Analysis on {FPGAs}",
journal = j-TRETS,
volume = "2",
number = "1",
pages = "3:1--3:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1502781.1502784",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Mon Jun 1 18:15:27 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Security protocols are frequently accelerated by
implementing the underlying cryptographic functions in
reconfigurable hardware. However, unprotected hardware
implementations are susceptible to side-channel
attacks, and Differential Power Analysis (DPA) has been
shown to be especially powerful. In this work, we
evaluate and compare the effectiveness of common hiding
countermeasures against DPA in FPGA-based designs,
using the Whirlpool hash function as a case study. In
particular, we develop a new design flow called
Isolated WDDL (IWDDL). In contrast with previous works,
IWDDL isolates the direct and complementary circuit
paths, and also provides DPA resistance in the Hamming
distance power model. The analysis is supported using
actual implementation results.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "DPA; FPGA; secure logic; Side-channel attacks;
Whirlpool",
}
@InCollection{Micciancio:2009:LBC,
author = "Daniele Micciancio and Oded Regev",
title = "Lattice-based Cryptography",
crossref = "Bernstein:2009:PQC",
pages = "147--192",
year = "2009",
bibdate = "Thu Apr 21 17:17:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Mihaljevic:2009:ASC,
author = "Miodrag J. Mihaljevi{\'c} and Hideki Imai",
title = "An approach for stream ciphers design based on joint
computing over random and secret data",
journal = j-COMPUTING,
volume = "85",
number = "1--2",
pages = "153--168",
month = jun,
year = "2009",
CODEN = "CMPTA2",
ISSN = "0010-485X (print), 1436-5057 (electronic)",
ISSN-L = "0010-485X",
bibdate = "Sun Oct 31 11:09:57 MDT 2010",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=85&issue=1;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=85&issue=1&spage=153",
acknowledgement = ack-nhfb,
fjournal = "Computing: Archiv f{\"u}r informatik und numerik",
journal-URL = "http://link.springer.com/journal/607",
}
@Article{Moralis:2009:KSA,
author = "Athanasios Moralis and Vassiliki Pouli and Symeon
Papavassiliou and Vasilis Maglaris",
title = "A {Kerberos} security architecture for {Web} services
based instrumentation grids",
journal = j-FUT-GEN-COMP-SYS,
volume = "25",
number = "7",
pages = "804--818",
month = jul,
year = "2009",
CODEN = "FGSEVI",
ISSN = "0167-739X (print), 1872-7115 (electronic)",
ISSN-L = "0167-739X",
bibdate = "Sat Sep 11 13:08:15 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/0167739X",
acknowledgement = ack-nhfb,
fjournal = "Future Generation Computer Systems",
journal-URL = "http://www.sciencedirect.com/science/journal/0167739X",
}
@Article{Mouratidis:2009:PMD,
author = "Kyriakos Mouratidis and Dimitris Sacharidis and
Hweehwa Pang",
title = "Partially materialized digest scheme: an efficient
verification method for outsourced databases",
journal = j-VLDB-J,
volume = "18",
number = "1",
pages = "363--381",
month = jan,
year = "2009",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-008-0108-z",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Tue Sep 15 15:49:59 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/vldbj.bib",
abstract = "In the outsourced database model, a data owner
publishes her database through a third-party server;
i.e., the server hosts the data and answers user
queries on behalf of the owner. Since the server may
not be trusted, or may be compromised, users need a
means to verify that answers received are both
authentic and complete, i.e., that the returned data
have not been tampered with, and that no qualifying
results have been omitted. We propose a result
verification approach for one-dimensional queries,
called Partially Materialized Digest scheme (PMD), that
applies to both static and dynamic databases. PMD uses
separate indexes for the data and for their associated
verification information, and only partially
materializes the latter. In contrast with previous
work, PMD avoids unnecessary costs when processing
queries that do not request verification, achieving the
performance of an ordinary index (e.g., a B$^+$ -tree).
On the other hand, when an authenticity and
completeness proof is required, PMD outperforms the
existing state-of-the-art technique by a wide margin,
as we demonstrate analytically and experimentally.
Furthermore, we design two verification methods for
spatial queries. The first, termed Merkle R-tree
(MR-tree), extends the conventional approach of
embedding authentication information into the data
index (i.e., an R-tree). The second, called Partially
Materialized KD-tree (PMKD), follows the PMD paradigm
using separate data and verification indexes. An
empirical evaluation with real data shows that the PMD
methodology is superior to the traditional approach for
spatial queries too.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "Authentication in outsourced databases; Query result
verification",
}
@Article{Muller:2009:BPE,
author = "Christoph M{\"u}ller and Steffen Frey and Magnus
Strengert and Carsten Dachsbacher and Thomas Ertl",
title = "Best Paper of {EGPGV --- Eurographics Symposium on
Parallel Graphics and Visualization}, {Guest Editor
Jean Favre}: a Compute Unified System Architecture for
Graphics Clusters Incorporating Data Locality",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "15",
number = "4",
pages = "605--617",
month = jul # "\slash " # aug,
year = "2009",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2008.188",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Thu Jul 2 10:22:33 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@InProceedings{Myers:2009:BEC,
author = "S. Myers and A. Shelat",
title = "Bit Encryption Is Complete",
crossref = "IEEE:2009:PAI",
pages = "607--616",
year = "2009",
DOI = "https://doi.org/10.1109/FOCS.2009.65",
bibdate = "Thu May 06 10:11:33 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Under CPA and CCA1 attacks, a secure bit encryption
scheme can be applied bit-by-bit to construct a secure
many-bit encryption scheme. The same construction
fails, however, under a CCA2 attack. In fact, since the
notion of CCA2 security was introduced by Rackoff and
Simon [21], it has been an open question to determine
whether single bit CCA2 secure encryption implies the
existence of many-bit CCA2 security. We positively
resolve this long-standing question and establish that
bit encryption is complete for CPA, CCA1, and CCA2
notions. Our construction is black-box, and thus
requires novel techniques to avoid known impossibility
results concerning trapdoor predicates [10]. To the
best of our knowledge, our work is also the first
example of a non-shielding reduction (introduced in
[9]) in the standard (i.e., not random-oracle) model.",
acknowledgement = ack-nhfb,
keywords = "bit encryption; CCA1 attack; CCA2 secure encryption;
Chosen-ciphertext secure public key encryption; CPA
attack; many-bit CCA2 security; many-bit encryption
scheme; public key cryptography; secure bit encryption
scheme",
}
@Article{Nghiem:2009:FBI,
author = "Thao P. Nghiem and Tae Ho Cho",
title = "A fuzzy-based interleaved multi-hop authentication
scheme in wireless sensor networks",
journal = j-J-PAR-DIST-COMP,
volume = "69",
number = "5",
pages = "441--450",
month = may,
year = "2009",
CODEN = "JPDCER",
ISSN = "0743-7315 (print), 1096-0848 (electronic)",
ISSN-L = "0743-7315",
bibdate = "Wed Sep 1 17:08:39 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/07437315",
acknowledgement = ack-nhfb,
fjournal = "Journal of Parallel and Distributed Computing",
journal-URL = "http://www.sciencedirect.com/science/journal/07437315",
}
@Article{Nigrini:2009:DDU,
author = "Mark J. Nigrini and Steven J. Miller",
title = "Data Diagnostics Using Second-Order Tests of
{Benford's Law}",
journal = j-AUDITING,
volume = "28",
number = "2",
pages = "305--324",
month = nov,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.2308/aud.2009.28.2.305",
ISSN = "0278-0380 (print), 1558-7991 (electronic)",
ISSN-L = "0278-0380",
bibdate = "Tue Nov 15 09:11:56 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/benfords-law.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://aaapubs.org/loi/ajpt;
http://link.aip.org/link/AJPTXX/v28/i2/p305/s1",
abstract = "Auditors are required to use analytical procedures to
identify the existence of unusual transactions, events,
and trends. Benford's Law gives the expected patterns
of the digits in numerical data, and has been advocated
as a test for the authenticity and reliability of
transaction level accounting data. This paper describes
a new second-order test that calculates the digit
frequencies of the differences between the ordered
(ranked) values in a data set. These digit frequencies
approximate the frequencies of Benford's Law for most
data sets. The second-order test is applied to four
sets of transactional data. The second-order test
detected errors in data downloads, rounded data, data
generated by statistical procedures, and the inaccurate
ordering of data. The test can be applied to any data
set and nonconformity usually signals an unusual issue
related to data integrity that might not have been
easily detectable using traditional analytical
procedures",
acknowledgement = ack-nhfb,
fjournal = "Auditing: A Journal of Practice \& Theory",
}
@Article{Nitaj:2009:CRCo,
author = "Abderrahmane Nitaj",
title = "Cryptanalysis of {RSA} with Constrained Keys",
journal = j-INT-J-NUMBER-THEORY,
volume = "5",
number = "2",
pages = "311--325",
month = mar,
year = "2009",
DOI = "https://doi.org/10.1142/S1793042109002122",
ISSN = "1793-0421 (print), 1793-7310 (electronic)",
ISSN-L = "1793-0421",
bibdate = "Tue Jul 21 10:01:19 MDT 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijnt.bib",
URL = "https://www.worldscientific.com/doi/10.1142/S1793042109002122",
abstract = "Let n = pq be an RSA modulus with unknown prime
factors of equal bit-size. Let e be the public exponent
and d be the secret exponent satisfying ed \equiv 1 mod
\varphi (n) where \varphi (n) is the Euler totient
function. To reduce the decryption time or the
signature generation time, one might be tempted to use
a small private exponent d. Unfortunately, in 1990,
Wiener showed that private exponents smaller than are
insecure and in 1999, Boneh and Durfee improved the
bound to n$^{0.292}$. In this paper, we show that
instances of RSA with even large private exponents can
be efficiently broken if there exist positive integers
X, Y such that |eY - XF(u)| and Y are suitably small
where F is a function of publicly known expression for
which there exists an integer u \neq 0 satisfying F(u)
\approx n and pu or qu is computable from F(u) and n.
We show that the number of such exponents is at least
O(n$^{3 / 4 - \varepsilon }$) when F(u) = p(q - u).",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Number Theory (IJNT)",
journal-URL = "https://www.worldscientific.com/worldscinet/ijnt",
}
@TechReport{Ohigashi:2009:PMF,
author = "Toshihiro Ohigashi and Masakatu Morii",
title = "A Practical Message Falsification Attack on {WPA}",
type = "Technical Report",
institution = "Hiroshima University",
address = "1-4-2 Kagamiyama, Higashi-Hiroshima, 739-8511 Japan",
day = "15",
month = jul,
year = "2009",
bibdate = "Thu Aug 27 15:20:34 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://jwis2009.nsysu.edu.tw/location/paper/A%20Practical%20Message%20Falsification%20Attack%20on%20WPA.pdf",
abstract = "In 2008, Beck and Tews have proposed a practical
attack on WPA. Their attack (called the Beck--Tews
attack) can recover plaintext from an encrypted short
packet, and can falsify it. The execution time of the
Beck--Tews attack is about 12--15 minutes. However, the
attack has the limitation, namely, the targets are only
WPA implementations that support IEEE802.11e QoS
features. In this paper, we propose a practical message
falsification attack on any WPA implementation. In
order to ease targets of limitation of wireless LAN
products, we apply the Beck--Tews attack to the
man-in-the-middle attack. In the man-in-the-middle
attack, the user's communication is intercepted by an
attacker until the attack ends. It means that the users
may detect our attack when the execution time of the
attack is large. Therefore, we give methods for
reducing the execution time of the attack. As a result,
the execution time of our attack becomes about one
minute in the best case.",
acknowledgement = ack-nhfb,
keywords = "falsification attack; man-in-the-middle attack; TKIP;
WPA",
}
@Article{Oiwa:2009:IMS,
author = "Yutaka Oiwa",
title = "Implementation of the memory-safe full {ANSI-C}
compiler",
journal = j-SIGPLAN,
volume = "44",
number = "6",
pages = "259--269",
month = jun,
year = "2009",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1542476.1542505",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Jun 16 14:41:16 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This paper describes a completely memory-safe compiler
for C language programs that is fully compatible with
the ANSI C specification.\par
Programs written in C often suffer from nasty errors
due to dangling pointers and buffer overflow. Such
errors in Internet server programs are often exploited
by malicious attackers to crack an entire system. The
origin of these errors is usually corruption of
in-memory data structures caused by out-of-bound array
accesses. Usual C compilers do not provide any
protection against such out-of-bound access, although
many other languages such as Java and ML do provide
such protection. There have been several proposals for
preventing such memory corruption from various aspects:
runtime buffer overrun detectors, designs for new
C-like languages, and compilers for (subsets of) the C
language. However, as far as we know, none of them have
achieved full memory protection and full compatibility
with the C language specification at the same
time.\par
We propose the most powerful solution to this problem
ever presented. We have developed {\em Fail-Safe C}, a
memory-safe implementation of the full ANSI C language.
It detects and disallows all unsafe operations, yet
conforms to the full ANSI C standard (including casts
and unions). This paper introduces several
techniques--both compile-time and runtime--to reduce
the overhead of runtime checks, while still maintaining
100\% memory safety. This compiler lets programmers
easily make their programs safe without heavy rewriting
or porting of their code. It also supports many of the
'dirty tricks' commonly used in many existing C
programs, which do not strictly conform to the standard
specification. In this paper, we demonstrate several
real-world server programs that can be processed by our
compiler and present technical details and benchmark
results for it.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "C language; memory safety",
}
@InCollection{Overbeck:2009:CBC,
author = "Raphael Overbeck and Nicolas Sendrier",
title = "Code-based cryptography",
crossref = "Bernstein:2009:PQC",
pages = "95--146",
year = "2009",
bibdate = "Thu Apr 21 17:17:18 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Paar:2009: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 = "2009",
DOI = "https://doi.org/10.1007/978-3-642-04101-3",
ISBN = "3-642-04100-0 (hardcover), 3-642-04101-9 (paperback)",
ISBN-13 = "978-3-642-04100-6 (hardcover), 978-3-642-04101-3
(paperback)",
LCCN = "A76.9.A25 P437 2009",
bibdate = "Wed Jul 7 18:54:40 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "cryptography; mathematics; data encryption (computer
science)",
}
@InProceedings{Pareschi:2009:PAC,
author = "F. Pareschi and G. Scotti and L. Giancane and R.
Rovatti and G. Setti and A. Trifiletti",
booktitle = "{2009. ISCAS 2009. IEEE International Symposium on
Circuits and Systems}",
title = "Power analysis of a chaos-based random number
generator for cryptographic security",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "2858--2861",
year = "2009",
DOI = "https://doi.org/10.1109/ISCAS.2009.5118398",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5118398",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5076158",
}
@Article{Paulson:2009:NBT,
author = "Linda Dailey Paulson",
title = "News Briefs: Technique Makes Strong Encryption Easier
to Use",
journal = j-COMPUTER,
volume = "42",
number = "4",
pages = "24--27",
month = apr,
year = "2009",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2009.132",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Thu Jul 2 08:29:13 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Magazine",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Pecho:2009:APW,
author = "P. Pecho and F. {Zboril, Jr.} and M. Drahansky and P.
Hanacek",
title = "Agent Platform for Wireless Sensor Network with
Support for Cryptographic Protocols",
journal = j-J-UCS,
volume = "15",
number = "5",
pages = "992--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 22:38:58 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_5/agent_platform_for_wireless",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@InProceedings{Peikert:2009:PKC,
author = "Chris Peikert",
title = "Public-key cryptosystems from the worst-case shortest
vector problem: extended abstract",
crossref = "ACM:2009:SPA",
pages = "333--342",
year = "2009",
bibdate = "Wed Sep 1 10:42:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Article{Peng:2009:DIE,
author = "Jun Peng and Du Zhang and Xiaofeng Liao",
title = "A Digital Image Encryption Algorithm Based on
Hyper-chaotic Cellular Neural Network",
journal = j-FUND-INFO,
volume = "90",
number = "3",
pages = "269--282",
month = mar,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0018",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:06 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@InProceedings{Perlner:2009:QRP,
author = "Ray A. Perlner and David A. Cooper",
title = "Quantum resistant public key cryptography: a survey",
crossref = "Seamons:2009:IPS",
pages = "85--93",
year = "2009",
DOI = "https://doi.org/10.1145/1527017.1527028",
bibdate = "Thu Apr 21 10:00:54 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Public key cryptography is widely used to secure
transactions over the Internet. However, advances in
quantum computers threaten to undermine the security
assumptions upon which currently used public key
cryptographic algorithms are based. In this paper, we
provide a survey of some of the public key
cryptographic algorithms that have been developed that,
while not currently in widespread use, are believed to
be resistant to quantum computing based attacks and
discuss some of the issues that protocol designers may
need to consider if there is a need to deploy these
algorithms at some point in the future.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; Diffie-Hellman ECC (elliptic curve
cryptography); DSA; Lamport signature; Lamport--Merkle;
MCELIECE; NTRU; NTRUEncrypt; NTRUSign; public key
cryptography; Quantum computers; RSA",
remark = "This paper is authored by employees of the U.S.
Government and is in the public domain.",
}
@Article{Petrakos:2009:CTA,
author = "Nikolaos Petrakos and George W. Dinolt and James Bret
Michael and Pantelimon Stanica",
title = "Cube-Type Algebraic Attacks on {Wireless Encryption
Protocols}",
journal = j-COMPUTER,
volume = "42",
number = "10",
pages = "103--105",
month = oct,
year = "2009",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2009.318",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Wed May 12 23:09:46 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Raghavan:2009:SPC,
author = "Barath Raghavan and Patric Verkaik and Alex C.
Snoeren",
title = "Secure and policy-compliant source routing",
journal = j-IEEE-TRANS-NETWORKING,
volume = "17",
number = "3",
pages = "764--777",
month = jun,
year = "2009",
CODEN = "IEANEP",
DOI = "https://doi.org/10.1109/TNET.2008.2007949",
ISSN = "1063-6692 (print), 1558-2566 (electronic)",
ISSN-L = "1063-6692",
bibdate = "Fri Jul 17 16:07:33 MDT 2009",
bibsource = "http://portal.acm.org/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib",
abstract = "In today's Internet, inter-domain route control
remains elusive; nevertheless, such control could
improve the performance, reliability, and utility of
the network for end users and ISPs alike. While
researchers have proposed a number of source routing
techniques to combat this limitation, there has thus
far been no way for independent ASes to ensure that
such traffic does not circumvent local traffic
policies, nor to accurately determine the correct party
to charge for forwarding the traffic.\par
We present Platypus, an authenticated source routing
system built around the concept of network
capabilities, which allow for accountable, fine-grained
path selection by cryptographically attesting to policy
compliance at each hop along a source route.
Capabilities can be composed to construct routes
through multiple ASes and can be delegated to third
parties. Platypus caters to the needs of both end users
and ISPs: users gain the ability to pool their
resources and select routes other than the default,
while ISPs maintain control over where, when, and whose
packets traverse their networks. We describe the design
and implementation of an extensive Platypus policy
framework that can be used to address several issues in
wide-area routing at both the edge and the core, and
evaluate its performance and security. Our results show
that incremental deployment of Platypus can achieve
immediate gains.",
acknowledgement = ack-nhfb,
fjournal = "IEEE\slash ACM Transactions on Networking",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771",
keywords = "authentication; capabilities; overlay networks; source
routing",
}
@Article{Regev:2009:LLE,
author = "Oded Regev",
title = "On lattices, learning with errors, random linear
codes, and cryptography",
journal = j-J-ACM,
volume = "56",
number = "6",
pages = "34:1--34:40",
month = sep,
year = "2009",
CODEN = "JACOAH",
DOI = "https://doi.org/10.1145/1568318.1568324",
ISSN = "0004-5411 (print), 1557-735X (electronic)",
ISSN-L = "0004-5411",
bibdate = "Fri Sep 4 13:33:31 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Our main result is a reduction from worst-case lattice
problems such as GapSVP and SIVP to a certain learning
problem. This learning problem is a natural extension
of the ``learning from parity with error'' problem to
higher moduli. It can also be viewed as the problem of
decoding from a random linear code. This, we believe,
gives a strong indication that these problems are hard.
Our reduction, however, is quantum. Hence, an efficient
solution to the learning problem implies a {\em
quantum\/} algorithm for GapSVP and SIVP. A main open
question is whether this reduction can be made
classical (i.e., nonquantum).\par
We also present a (classical) public-key cryptosystem
whose security is based on the hardness of the learning
problem. By the main result, its security is also based
on the worst-case quantum hardness of GapSVP and SIVP.
The new cryptosystem is much more efficient than
previous lattice-based cryptosystems: the public key is
of size $ \Otilde (n^2) $ and encrypting a message
increases its size by a factor of $ \Otilde (n) $ (in
previous cryptosystems these values are $ \Otilde (n^4)
$ and $ \Otilde (n^2) $, respectively). In fact, under
the assumption that all parties share a random bit
string of length $ \Otilde (n^2) $, the size of the
public key can be reduced to $ \Otilde (n) $.",
acknowledgement = ack-nhfb,
articleno = "34",
fjournal = "Journal of the Association for Computing Machinery",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401",
keywords = "average-case hardness; cryptography; Lattice; public
key encryption; quantum computation",
}
@Article{Ren:2009:CWT,
author = "Jian Ren",
title = "A cryptographic watermarking technique for multimedia
signals",
journal = j-ADV-COMPUT-MATH,
volume = "31",
number = "1--3",
pages = "267--281",
month = oct,
year = "2009",
CODEN = "ACMHEX",
DOI = "https://doi.org/10.1007/s10444-008-9096-1",
ISSN = "1019-7168 (print), 1572-9044 (electronic)",
ISSN-L = "1019-7168",
MRclass = "94A62 (94A60)",
MRnumber = "2511582",
bibdate = "Sat Feb 3 18:22:44 MST 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/advcomputmath.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://link.springer.com/article/10.1007/s10444-008-9096-1",
acknowledgement = ack-nhfb,
fjournal = "Advances in Computational Mathematics",
journal-URL = "http://link.springer.com/journal/10444",
}
@Article{Ren:2009:FCS,
author = "Yanli Ren and Dawu Gu",
title = "Fully {CCA2} secure identity based broadcast
encryption without random oracles",
journal = j-INFO-PROC-LETT,
volume = "109",
number = "11",
pages = "527--533",
day = "16",
month = may,
year = "2009",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:31 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@Article{Renaud:2009:VPC,
author = "Karen Renaud and Antonella {De Angeli}",
title = "Visual passwords: cure-all or snake-oil?",
journal = j-CACM,
volume = "52",
number = "12",
pages = "135--140",
month = dec,
year = "2009",
CODEN = "CACMA2",
DOI = "https://doi.org/10.1145/1610252.1610287",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
ISSN-L = "0001-0782",
bibdate = "Thu Feb 4 17:12:05 MST 2010",
bibsource = "http://www.acm.org/pubs/contents/journals/cacm/;
https://www.math.utah.edu/pub/tex/bib/cacm2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Users of computer systems are accustomed to being
asked for passwords -- it is as universal as it is
frustrating. In the past there was little tolerance for
the problems experienced remembering passwords, and
many users still remember, with embarrassment, having
to go hat-in-hand to request a password change and
being treated with disdain by a lofty administrator.
Latterly there is more understanding of the problems
experienced by users, especially since the ' {\em
password conundrum\/} ' has reached epidemic
proportions for Web users, who are asked for passwords
with unrelenting predictability.\par
The problems with passwords are clear --- users cannot
remember numbers of meaningless alphanumeric strings
with ease. Hence, they react by choosing simple and
predictable words or numbers related to their everyday
life, and engaging in insecure practices, such as
writing passwords down or sharing them. These practices
cause a breach affecting even the most secure and
protected network system. Hence the user is often
called the weakest link of the security chain, with
system administrators despairing of trying to maintain
security with the weak link so often reaching breaking
point. Users forgetting passwords has serious
economical consequences for organizations.\par
Both academia and industry have been investigating
alternatives to passwords, with varying degrees of
success. One of the most well-known solutions is the
biometric -- measurement of either behavioral or
physiological characteristics of the end-user. This is
obviously superior to the password because it removes
the burden on the user's memory. So why don't we just
switch to biometrics and give the poor user a break?
There are some valid and hard-to-overcome reasons for
the slow uptake of biometrics, but before we can
discuss them we need to consider the mechanics of
authentication.",
acknowledgement = ack-nhfb,
fjournal = "Communications of the ACM",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79",
}
@Book{Robinson:2009:LLE,
author = "Andrew Robinson",
title = "Lost languages: the enigma of the world's undeciphered
scripts",
publisher = "Thames and Hudson",
address = "London, UK",
pages = "352",
year = "2009",
ISBN = "0-500-51453-4 (hardcover), 0-500-28816-X (paperback)",
ISBN-13 = "978-0-500-51453-5 (hardcover), 978-0-500-28816-0
(paperback)",
LCCN = "CN120 .R63 2009",
bibdate = "Thu Sep 17 05:47:41 MDT 2015",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Beginning with the stories of three great
decipherments Egyptian hieroglyphs, Minoan Linear B and
Mayan glyphs Lost Languages moves on to dissect the
most well-known and enigmatic undeciphered scripts from
around the world. They include the Etruscan alphabet of
Italy, the Indus Valley seal script, Rongorongo from
remote Easter Island, the Zapotec script of Mexico
(probably the first writing system in the Americas),
and the unique Phaistos disc of Crete. Lost Languages
reports from the front lines of scholarship where
obsessions, genius, occasional delusion and sometimes
bitter rivalry are de rigueur among those currently
competing for the rare honour of cracking these ancient
codes and giving voice to forgotten worlds.",
acknowledgement = ack-nhfb,
author-dates = "1957--",
remark = "Originally published: New York: McGraw-Hill, 2002.",
subject = "Extinct languages; Inscriptions, Ancient; Inschrift.;
Tote Sprache.; Writing; History.; Language and
languages.; {\'e}criture; langue morte.; Extinct
languages.; Inscriptions, Ancient.",
tableofcontents = "Introduction : writing systems, coded civilizations
and undeciphered scripts \\
Part 1. Three great decipherments. Voices of the
Pharaohs: Egyptian hieroglyphs (Egypt) \\
Labyrinth of Minos : Linear B (Green) \\
Bishop de Landa's inquisition: Mayan glyphs (Central
America) \\
Voices of the black pharoahs : the Meroitic script
(Sudan) \\
Greek but not Greek : the Etruscan alphabet (Italy) \\
Mediterranean mystery : Linear A (the Aegean) \\
Secrets of the ancient ledgers : the proto-Elamite
script (Iran)",
}
@InCollection{Rousseau:2009:CCP,
author = "Christiane Rousseau and Yvan Saint-Aubin",
title = "La cryptographie {\`a} cle publique: le code {RSA}
(1978)",
crossref = "Rousseau:2009:MT",
pages = "213--244",
year = "2009",
DOI = "https://doi.org/10.1007/978-0-387-69213-5_7",
bibdate = "Tue Jul 20 16:43:36 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
language = "French",
}
@Book{Rupp:2009:CAC,
author = "Andy Rupp",
title = "Computational aspects of cryptography and
cryptanalysis",
volume = "6",
publisher = "Europ{\"a}ischer Universit{\"a}tsverlag",
address = "Berlin, Germany",
pages = "xviii + 245",
year = "2009",
ISBN = "3-89966-337-3",
ISBN-13 = "978-3-89966-337-2",
LCCN = "????",
bibdate = "Fri May 13 07:31:25 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "IT-Security",
acknowledgement = ack-nhfb,
}
@Article{Samtani:2009:WTO,
author = "Rajan Samtani",
title = "{Web} Technologies: Ongoing Innovation in Digital
Watermarking",
journal = j-COMPUTER,
volume = "42",
number = "3",
pages = "92--94",
month = mar,
year = "2009",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2009.93",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Thu Jul 2 08:29:12 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Magazine",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Sauvage:2009:ERF,
author = "Laurent Sauvage and Sylvain Guilley and Yves Mathieu",
title = "Electromagnetic Radiations of {FPGAs}: High Spatial
Resolution Cartography and Attack on a Cryptographic
Module",
journal = j-TRETS,
volume = "2",
number = "1",
pages = "4:1--4:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1502781.1502785",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Mon Jun 1 18:15:27 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Since the first announcement of a Side Channel
Analysis (SCA) about ten years ago, considerable
research has been devoted to studying these attacks on
Application Specific Integrated Circuits (ASICs), such
as smart cards or TPMs. In this article, we compare
power-line attacks with ElectroMagnetic (EM) attacks,
specifically targeting Field Programmable Gate Array
devices (FPGAs), as they are becoming widely used for
sensitive applications involving cryptography.\par
We show experimentally that ElectroMagnetic Analysis
(EMA) is always faster than the historical Differential
Power Analysis (DPA) in retrieving keys of symmetric
ciphers. In addition, these analyses prove to be very
convenient to conduct, as they are totally
non-invasive.\par
Research reports indicate that EMA can be conducted
globally, typically with macroscopic home-made coils
circling the device under attack, with fair results.
However, as accurate professional EM antennas are now
becoming more accessible, it has become commonplace to
carry out EM analyses locally.\par
Cartography has been carried out by optical means on
circuits realized with technology greater than 250
nanometers. Nonetheless, for deep submicron
technologies, the feature size of devices that are
spied upon is too small to be visible with photographic
techniques. In addition, the presence of the 6+
metallization layers obviously prevents a direct
observation of the layout. Therefore, EM imaging is
emerging as a relevant means to discover the underlying
device structure.\par
In this article, we present the first images of
deep-submicron FPGAs. The resolution is not as accurate
as photographic pictures: we notably compare the layout
of toy design examples placed at the four corners of
the FPGAs with the EM images we collected. We observe
that EM imaging has the advantage of revealing active
regions, which can be useful in locating a particular
processor (visible while active---invisible when
inactive).\par
In the context of EM attacks, we stress that the exact
localization of the cryptographic target is not
necessary: the coarse resolution we obtain is
sufficient. We note that the EM imaging does not reveal
the exact layout of the FPGA, but instead directly
guides the attacker towards the areas which are leaking
the most. We achieve attacks with an accurate sensor,
both far from (namely on a SMC capacitor on the board)
and close to (namely directly over the FPGA) the
encryption co-processor. As compared to the previously
published attacks, we report a successful attack on a
DES module in fewer than 6,300 measurements, which is
currently the best cracking performance against this
encryption algorithm implemented in FPGAs.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "cartography; DPA; EMA; FPGA; SCA; security",
}
@Article{Schaumont:2009:GEI,
author = "Patrick R. Schaumont and Alex K. Jones and Steve
Trimberger",
title = "{Guest Editors}' Introduction to Security in
Reconfigurable Systems Design",
journal = j-TRETS,
volume = "2",
number = "1",
pages = "1:1--1:??",
month = mar,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1502781.1502782",
ISSN = "1936-7406 (print), 1936-7414 (electronic)",
ISSN-L = "1936-7406",
bibdate = "Mon Jun 1 18:15:27 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This special issue on Security in Reconfigurable
Systems Design reports on recent research results in
the design and implementation of trustworthy
reconfigurable systems. Five articles cover topics
including power-efficient implementation of public-key
cryptography, side-channel analysis of electromagnetic
radiation, side-channel resistant design, design of
robust unclonable functions on an FPGA, and Trojan
detection in an FPGA bitstream.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Reconfigurable Technology and
Systems (TRETS)",
journal-URL = "http://portal.acm.org/toc.cfm?id=J1151",
keywords = "physically unclonable function; side-channel resistant
design; Trojan; Trustworthy design",
}
@Book{Schmeh:2009:VBF,
author = "Klaus Schmeh",
title = "{Versteckte Botschaften: die faszinierende Geschichte
der Steganografie}. (German) [{Hidden} Messages. {The}
Fascinating Story of Steganography]",
publisher = "Heise",
address = "Hannover, Germany",
pages = "xi + 234",
year = "2009",
ISBN = "3-936931-54-2 (paperback)",
ISBN-13 = "978-3-936931-54-9 (paperback)",
LCCN = "????",
bibdate = "Mon Oct 25 14:05:55 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
price = "SFR 32.00; EUR 18.00",
series = "Telepolis",
acknowledgement = ack-nhfb,
language = "German",
}
@Book{Seacord:2009:CCS,
author = "Robert C. Seacord",
title = "The {CERT} {C} secure coding standard",
publisher = pub-AW,
address = pub-AW:adr,
pages = "xxxiii + 682",
year = "2009",
ISBN = "0-321-56321-2 (paperback)",
ISBN-13 = "978-0-321-56321-7 (paperback)",
LCCN = "QA76.73.C15 S4155 2008",
bibdate = "Wed Oct 15 14:18:28 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "C (Computer program language); Computer security",
}
@Article{Seddik:2009:IWB,
author = "Hassen Seddik and Mounir Sayadi and Farhat Fnaiech and
Mohamed Cheriet",
title = "Image Watermarking Based on the {Hessenberg}
Transform",
journal = j-INT-J-IMAGE-GRAPHICS,
volume = "9",
number = "3",
pages = "411--433",
month = jul,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1142/S0219467809003514",
ISSN = "0219-4678",
bibdate = "Tue Aug 31 08:38:02 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Image and Graphics (IJIG)",
journal-URL = "http://www.worldscientific.com/worldscinet/ijig",
}
@Article{Shaikh:2009:SAU,
author = "Siraj A. Shaikh and Vicky J. Bush and Steve A.
Schneider",
title = "Specifying authentication using signal events in
{CSP}",
journal = j-COMPUT-SECUR,
volume = "28",
number = "5",
pages = "310--324",
month = jul,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:17 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000953",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Shmueli:2009:DEO,
author = "Erez Shmueli and Ronen Vaisenberg and Yuval Elovici
and Chanan Glezer",
title = "Database encryption: an overview of contemporary
challenges and design considerations",
journal = j-SIGMOD,
volume = "38",
number = "3",
pages = "29--34",
month = sep,
year = "2009",
CODEN = "SRECD8",
DOI = "https://doi.org/10.1145/1815933.1815940",
ISSN = "0163-5808 (print), 1943-5835 (electronic)",
ISSN-L = "0163-5808",
bibdate = "Mon Jun 21 18:07:29 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This article describes the major challenges and design
considerations pertaining to database encryption. The
article first presents an attack model and the main
relevant challenges of data security, encryption
overhead, key management, and integration footprint.
Next, the article reviews related academic work on
alternative encryption configurations pertaining to
encryption locus; indexing encrypted data; and key
management. Finally, the article concludes with a
benchmark using the following design criteria:
encryption configuration, encryption granularity and
keys storage.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGMOD Record",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689",
keywords = "database encryption; privacy; security",
}
@Article{Shu:2009:RCA,
author = "Chang Shu and Soonhak Kwon and K. Gaj",
title = "Reconfigurable Computing Approach for {Tate} Pairing
Cryptosystems over Binary Fields",
journal = j-IEEE-TRANS-COMPUT,
volume = "58",
number = "9",
pages = "1221--1237",
month = sep,
year = "2009",
CODEN = "ITCOB4",
DOI = "https://doi.org/10.1109/TC.2009.64",
ISSN = "0018-9340 (print), 1557-9956 (electronic)",
ISSN-L = "0018-9340",
bibdate = "Mon Jul 4 11:37:43 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4815221",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Computers",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
}
@Book{Sinkov:2009:ECM,
author = "Abraham Sinkov",
title = "Elementary cryptanalysis: a mathematical view",
volume = "22",
publisher = pub-MATH-ASSOC-AMER,
address = pub-MATH-ASSOC-AMER:adr,
edition = "Second",
pages = "xiv + 212",
year = "2009",
ISBN = "0-88385-647-6",
ISBN-13 = "978-0-88385-647-5",
LCCN = "????",
bibdate = "Sat May 14 07:20:58 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
note = "Revised and updated by Todd Feil.",
series = "Anneli lax new mathematical library",
URL = "http://www.loc.gov/catdir/enhancements/fy0914/2009927623-d.html;
http://www.loc.gov/catdir/enhancements/fy0914/2009927623-t.html",
acknowledgement = ack-nhfb,
author-dates = "1907--",
}
@Article{Spiekermann:2009:ACR,
author = "Sarah Spiekermann and Sergei Evdokimov",
title = "Authentication: Critical {RFID} Privacy-Enhancing
Technologies",
journal = j-IEEE-SEC-PRIV,
volume = "7",
number = "2",
pages = "56--62",
month = mar # "\slash " # apr,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2009.31",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Jul 2 10:02:21 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Storer:2009:PSR,
author = "Mark W. Storer and Kevin M. Greenan and Ethan L.
Miller and Kaladhar Voruganti",
title = "{POTSHARDS} --- a secure, recoverable, long-term
archival storage system",
journal = j-TOS,
volume = "5",
number = "2",
pages = "5:1--5:??",
month = jun,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1534912.1534914",
ISSN = "1553-3077 (print), 1553-3093 (electronic)",
ISSN-L = "1553-3077",
bibdate = "Tue Mar 16 15:33:46 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Users are storing ever-increasing amounts of
information digitally, driven by many factors including
government regulations and the public's desire to
digitally record their personal histories.
Unfortunately, many of the security mechanisms that
modern systems rely upon, such as encryption, are
poorly suited for storing data for indefinitely long
periods of time; it is very difficult to manage keys
and update cryptosystems to provide secrecy through
encryption over periods of decades. Worse, an adversary
who can compromise an archive need only wait for
cryptanalysis techniques to catch up to the encryption
algorithm used at the time of the compromise in order
to obtain ``secure'' data. To address these concerns,
we have developed POTSHARDS, an archival storage system
that provides long-term security for data with very
long lifetimes without using encryption. Secrecy is
achieved by using unconditionally secure secret
splitting and spreading the resulting shares across
separately managed archives. Providing availability and
data recovery in such a system can be difficult; thus,
we use a new technique, approximate pointers, in
conjunction with secure distributed RAID techniques to
provide availability and reliability across independent
archives. To validate our design, we developed a
prototype POTSHARDS implementation. In addition to
providing us with an experimental testbed, this
prototype helped us to understand the design issues
that must be addressed in order to maximize security.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Storage",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960",
keywords = "approximate pointers; Archival storage; secret
splitting",
}
@Article{Sun:2009:CPR,
author = "Fuyan Sun and Shutang Liu",
title = "Cryptographic pseudo-random sequence from the spatial
chaotic map",
journal = j-CHAOS-SOLITONS-FRACTALS,
volume = "41",
number = "5",
pages = "2216--2219",
month = "????",
year = "2009",
CODEN = "CSFOEH",
ISSN = "0960-0779 (print), 1873-2887 (electronic)",
ISSN-L = "0960-0779",
bibdate = "Wed Jan 18 21:56:15 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
acknowledgement = ack-nhfb,
fjournal = "Chaos, solitons \& fractals",
}
@Article{Sun:2009:TDS,
author = "Hung-Min Sun and Mu-En Wu and M. Jason Hinek and
Cheng-Ta Yang and Vincent S. Tseng",
title = "Trading decryption for speeding encryption in
{Rebalanced-RSA}",
journal = j-J-SYST-SOFTW,
volume = "82",
number = "9",
pages = "1503--1512",
month = sep,
year = "2009",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Tiwari:2009:CIF,
author = "Mohit Tiwari and Hassan M. G. Wassel and Bita Mazloom
and Shashidhar Mysore and Frederic T. Chong and Timothy
Sherwood",
title = "Complete information flow tracking from the gates up",
journal = j-SIGPLAN,
volume = "44",
number = "3",
pages = "109--120",
month = mar,
year = "2009",
CODEN = "SINODQ",
DOI = "https://doi.org/10.1145/1508284.1508258",
ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160
(electronic)",
ISSN-L = "0362-1340",
bibdate = "Tue Jun 16 14:39:26 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "For many mission-critical tasks, tight guarantees on
the flow of information are desirable, for example,
when handling important cryptographic keys or sensitive
financial data. We present a novel architecture capable
of tracking all information flow within the machine,
including all explicit data transfers and all implicit
flows (those subtly devious flows caused by not
performing conditional operations). While the problem
is impossible to solve in the general case, we have
created a machine that avoids the general-purpose
programmability that leads to this impossibility
result, yet is still programmable enough to handle a
variety of critical operations such as public-key
encryption and authentication. Through the application
of our novel gate-level information flow tracking
method, we show how all flows of information can be
precisely tracked. From this foundation, we then
describe how a class of architectures can be
constructed, from the gates up, to completely capture
all information flows and we measure the impact of
doing so on the hardware implementation, the ISA, and
the programmer.",
acknowledgement = ack-nhfb,
fjournal = "ACM SIGPLAN Notices",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706",
keywords = "gate level; information flow tracking; provably
sound",
}
@InProceedings{Tong:2009:RAPa,
author = "Qiaoling Tong and Xuecheng Zou and Hengqing Tong",
booktitle = "{2009. CSO 2009. International Joint Conference on
Computational Sciences and Optimization}",
title = "A {RFID} Authentication Protocol Based on Infinite
Dimension Pseudo Random Number Generator",
volume = "1",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "292--294",
year = "2009",
DOI = "https://doi.org/10.1109/CSO.2009.436",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5193698",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5193618",
}
@InProceedings{Tong:2009:RAPb,
author = "Qiaoling Tong and Xuecheng Zou and Hengqing Tong",
booktitle = "{2009. ICBBE 2009. 3rd International Conference on
Bioinformatics and Biomedical Engineering}",
title = "A {RFID} Authentication Protocol Based on Infinite
Dimension Pseudo Random Number Generator for Face
Recognition System",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--4",
year = "2009",
DOI = "https://doi.org/10.1109/ICBBE.2009.5162237",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5162237",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5162127",
}
@Article{Troutman:2009:CCGa,
author = "Justin Troutman and Vincent Rijmen",
title = "Crypto Corner: Green Cryptography: Cleaner Engineering
through Recycling",
journal = j-IEEE-SEC-PRIV,
volume = "7",
number = "4",
pages = "71--73",
month = jul # "\slash " # aug,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2009.91",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Thu Sep 10 15:38:24 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Troutman:2009:CCGb,
author = "Justin Troutman and Vincent Rijmen",
title = "Crypto Corner: Green Cryptography: Cleaner Engineering
through Recycling, Part 2",
journal = j-IEEE-SEC-PRIV,
volume = "7",
number = "5",
pages = "64--65",
month = sep # "\slash " # oct,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1109/MSP.2009.120",
ISSN = "1540-7993 (print), 1558-4046 (electronic)",
ISSN-L = "1540-7993",
bibdate = "Wed Oct 14 17:01:10 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Security and Privacy",
}
@Article{Tsolis:2009:ARM,
author = "Dimitrios Tsolis and Spiridon Nikolopoulos and Lambros
Drossos and Spyros Sioutas and Theodore Papatheodorou",
title = "Applying robust multibit watermarks to digital
images",
journal = j-J-COMPUT-APPL-MATH,
volume = "227",
number = "1",
pages = "213--220",
day = "1",
month = may,
year = "2009",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 13:13:31 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/jcomputapplmath2005.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0377042708003543",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
@InProceedings{Uchida:2009:FPR,
author = "A. Uchida and T. Honjo and K. Amano and K. Hirano and
H. Someya and H. Okumura and S. Yoshimori and K.
Yoshimura and P. Davis and Y. Tokura",
booktitle = "{Lasers and Electro-Optics 2009 and the European
Quantum Electronics Conference. CLEO Europe - EQEC
2009. European Conference on}",
title = "Fast physical random bit generator based on chaotic
semiconductor lasers: Application to quantum
cryptography",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1",
year = "2009",
DOI = "https://doi.org/10.1109/CLEOE-EQEC.2009.5192510",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5192510",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5164156",
}
@Article{Uz:2009:MBT,
author = "Tamer Uz and George Bebis and Ali Erol and Salil
Prabhakar",
title = "Minutiae-based template synthesis and matching for
fingerprint authentication",
journal = j-COMP-VIS-IMAGE-UNDERSTANDING,
volume = "113",
number = "9",
pages = "979--992",
month = sep,
year = "2009",
CODEN = "CVIUF4",
ISSN = "1077-3142 (print), 1090-235X (electronic)",
ISSN-L = "1077-3142",
bibdate = "Sat Apr 2 10:55:59 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/10773142",
acknowledgement = ack-nhfb,
fjournal = "Computer Vision and Image Understanding",
journal-URL = "http://www.sciencedirect.com/science/journal/10773142",
}
@Article{Vassev:2009:STA,
author = "Emil Vassev and Mike Hinchey",
title = "Software Technologies: {ASSL}: a Software Engineering
Approach to Autonomic Computing",
journal = j-COMPUTER,
volume = "42",
number = "6",
pages = "90--93",
month = jun,
year = "2009",
CODEN = "CPTRB4",
DOI = "https://doi.org/10.1109/MC.2009.174",
ISSN = "0018-9162 (print), 1558-0814 (electronic)",
ISSN-L = "0018-9162",
bibdate = "Thu Jul 2 08:29:13 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Computer Magazine",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
}
@Article{Vlachos:2009:OPV,
author = "Michail Vlachos and Aris Anagnostopoulos and Olivier
Verscheure and Philip S. Yu",
title = "Online pairing of {VoIP} conversations",
journal = j-VLDB-J,
volume = "18",
number = "1",
pages = "77--98",
month = jan,
year = "2009",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-007-0087-5",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Tue Sep 15 15:49:59 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "This paper answers the following question; given a
multiplicity of evolving 1-way conversations, can a
machine or an algorithm discern the conversational
pairs in an online fashion, without understanding the
content of the communications? Our analysis indicates
that this is possible, and can be achieved just by
exploiting the temporal dynamics inherent in a
conversation. We also show that our findings are
applicable for anonymous and encrypted conversations
over VoIP networks. We achieve this by exploiting the
aperiodic inter-departure time of VoIP packets, hence
trivializing each VoIP stream into a binary
time-series, indicating the voice activity of each
stream. We propose effective techniques that
progressively pair conversing parties with high
accuracy and in a limited amount of time. Our findings
are verified empirically on a dataset consisting of
1,000 conversations. We obtain very high pairing
accuracy that reaches 97\% after 5 min of voice
conversations. Using a modeling approach we also
demonstrate analytically that our result can be
extended over an unlimited number of conversations.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "Binary time-series clustering; Conversation pairing;
Stream clustering; Voice-over-IP",
}
@InProceedings{Volos:2009:IEP,
author = "C. K. Volos and I. M. Kyprianidis and I. N.
Stouboulos",
booktitle = "{2009 16th International Conference on Digital Signal
Processing}",
title = "Image encryption process based on a chaotic {True
Random Bit Generator}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--4",
year = "2009",
DOI = "https://doi.org/10.1109/ICDSP.2009.5201107",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5201107",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5176123",
}
@Article{Wallich:2009:SGP,
author = "P. Wallich",
title = "The supercomputer goes personal",
journal = j-IEEE-SPECTRUM,
volume = "46",
number = "4",
pages = "64--64",
month = apr,
year = "2009",
CODEN = "IEESAM",
DOI = "https://doi.org/10.1109/MSPEC.2009.4808388",
ISSN = "0018-9235 (print), 1939-9340 (electronic)",
ISSN-L = "0018-9235",
bibdate = "Sat Jan 18 12:29:46 2020",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ieeespectrum2000.bib;
https://www.math.utah.edu/pub/tex/bib/super.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Spectrum",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6",
keywords = "Cryptography; Games; Graphics; Proteins;
Supercomputers",
}
@Article{Wang:2009:DSM,
author = "J. Wang and J. L{\"u} and S. Lian and G. Liu",
title = "On the Design of Secure Multimedia Authentication",
journal = j-J-UCS,
volume = "15",
number = "2",
pages = "426--??",
month = "????",
year = "2009",
CODEN = "????",
ISSN = "0948-6968",
ISSN-L = "0948-6968",
bibdate = "Wed Aug 25 22:38:58 MDT 2010",
bibsource = "http://www.jucs.org/jucs;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.jucs.org/jucs_15_2/on_the_design_of",
acknowledgement = ack-nhfb,
fjournal = "J.UCS: Journal of Universal Computer Science",
journal-URL = "http://www.jucs.org/jucs",
}
@Article{Wang:2009:NWA,
author = "Chung-Chuan Wang and Chin-Chen Chang and Jinn-Ke Jan",
title = "Novel Watermarking Authentication Schemes for Binary
Images Based on Dual-Pair Block Pixel Patterns",
journal = j-FUND-INFO,
volume = "90",
number = "1--2",
pages = "125--155",
month = jan,
year = "2009",
CODEN = "FUMAAJ",
DOI = "https://doi.org/10.3233/FI-2009-0010",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:04 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Wang:2009:NWM,
author = "Yu-Ping Wang and Shi-Min Hu",
title = "A New Watermarking Method for {$3$D} Models Based on
Integral Invariants",
journal = j-IEEE-TRANS-VIS-COMPUT-GRAPH,
volume = "15",
number = "2",
pages = "285--294",
month = mar # "\slash " # apr,
year = "2009",
CODEN = "ITVGEA",
DOI = "https://doi.org/10.1109/TVCG.2008.101",
ISSN = "1077-2626 (print), 1941-0506 (electronic), 2160-9306",
ISSN-L = "1077-2626",
bibdate = "Thu Jul 2 10:22:33 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Transactions on Visualization and Computer
Graphics",
journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2945",
}
@Article{Wang:2009:RDA,
author = "Xiang-Yang Wang and Pan-Pan Niu and Hong-Ying Yang",
title = "A Robust, Digital-Audio Watermarking Method",
journal = j-IEEE-MULTIMEDIA,
volume = "16",
number = "3",
pages = "60--69",
month = jul # "\slash " # sep,
year = "2009",
CODEN = "IEMUE4",
DOI = "https://doi.org/10.1109/MMUL.2009.44",
ISSN = "1070-986X (print), 1941-0166 (electronic)",
ISSN-L = "1070-986X",
bibdate = "Thu May 13 11:33:52 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "IEEE Multimedia",
}
@Article{Wang:2009:SST,
author = "Ronghua Wang and Wenliang Du and Xiaogang Liu and Peng
Ning",
title = "{ShortPK}: a short-term public key scheme for
broadcast authentication in sensor networks",
journal = j-TOSN,
volume = "6",
number = "1",
pages = "9:1--9:??",
month = dec,
year = "2009",
CODEN = "????",
DOI = "https://doi.org/10.1145/1653760.1653769",
ISSN = "1550-4859 (print), 1550-4867 (electronic)",
ISSN-L = "1550-4859",
bibdate = "Tue Mar 16 15:24:34 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "Broadcast authentication is an important functionality
in sensor networks. Energy constraints on sensor nodes
and the real-time nature of the broadcasts render many
of the existing solutions impractical: previous works
focusing primarily on symmetric key schemes have
difficulties in achieving real-time authentication.
Public Key Cryptography (PKC), however, can satisfy the
real-time requirements, and recent trends indicate that
public key is becoming feasible for sensor
networks.\par
However, PKC operations are still expensive
computations. It is impractical to use PKC in the
conventional ways for broadcast authentication in
sensor networks. To reduce costs, we propose {\em
ShortPK}, an efficient Short-term Public Key broadcast
authentication scheme. The basic idea is to use
short-length public/private keys, but limit their
lifetime to only a short period of time. To cover a
long period of time, we need to use many public/private
key pairs; distributing these public keys to sensors is
a challenging problem. We describe a progressive key
distribution scheme that is secure, efficient, and
packet-loss resilient. We compare our scheme with the
traditional 160-bit ECC public key schemes, and show
that our scheme can achieve a significant improvement
on energy consumption.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Sensor Networks (TOSN)",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981",
keywords = "communication; public key; Sensor networks",
}
@Book{Wayner:2009:DCI,
author = "Peter Wayner",
title = "Disappearing cryptography: information hiding:
steganography and watermarking",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
edition = "Third",
pages = "xv + 439",
year = "2009",
ISBN = "0-12-374479-2, 0-08-092270-8 (e-book)",
ISBN-13 = "978-0-12-374479-1, 978-0-08-092270-6 (e-book)",
LCCN = "TK5105.59 .W39 2009",
bibdate = "Wed Aug 27 07:34:37 MDT 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
z3950.loc.gov:7090/Voyager",
URL = "http://www.sciencedirect.com/science/book/9780123744791",
abstract = "Cryptology is the practice of hiding digital
information by means of various obfuscatory and
steganographic techniques. The application of said
techniques facilitates message confidentiality and
sender/receiver identity authentication, and helps to
ensure the integrity and security of computer
passwords, ATM card information, digital signatures,
DVD and HDDVD content, and electronic commerce.
Cryptography is also central to digital rights
management (DRM), a group of techniques for
technologically controlling the use of copyrighted
material that is being widely implemented and deployed
at the behest of corporations that own and create
revenue from the hundreds of thousands of
mini-transactions that take place daily on programs
like iTunes. This new edition of our best-selling book
on cryptography and information hiding delineates a
number of different methods to hide information in all
types of digital media files. These methods include
encryption, compression, data embedding and
watermarking, data mimicry, and scrambling. During the
last 5 years, the continued advancement and exponential
increase of computer processing power have enhanced the
efficacy and scope of electronic espionage and content
appropriation. Therefore, this edition has amended and
expanded outdated sections in accordance with new
dangers, and includes 5 completely new chapters that
introduce newer more sophisticated and refined
cryptographic algorithms and techniques (such as
fingerprinting, synchronization, and quantization)
capable of withstanding the evolved forms of attack.
Each chapter is divided into sections, first providing
an introduction and high-level summary for those who
wish to understand the concepts without wading through
technical explanations, and then presenting concrete
examples and greater detail for those who want to write
their own programs. This combination of practicality
and theory allows programmers and system designers to
not only implement tried and true encryption
procedures, but also consider probable future
developments in their designs, thus fulfilling the need
for preemptive caution that is becoming ever more
explicit as the transference of digital media
escalates.",
acknowledgement = ack-nhfb,
author-dates = "1964--",
subject = "Computer networks; Security measures; Cryptography;
Internet",
tableofcontents = "Framing information \\
Encryption \\
Error correction \\
Secret sharing \\
Compression \\
Basic mimicry \\
Grammars and mimicry \\
Turing and reverse \\
Life in the noise \\
Anonymous remailers \\
Secret broadcasts \\
Keys \\
Ordering and reordering \\
Spreading \\
Synthetic worlds \\
Watermarks \\
Steganalysis \\
Obfuscation \\
Synchronization \\
Translucent databases \\
Plain sight \\
Coda",
}
@Article{Weir:2009:UPS,
author = "Catherine S. Weir and Gary Douglas and Martin
Carruthers and Mervyn Jack",
title = "User perceptions of security, convenience and
usability for ebanking authentication tokens",
journal = j-COMPUT-SECUR,
volume = "28",
number = "1--2",
pages = "47--62",
month = feb # "\slash " # mar,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:15 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808000941",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{White:2009:EOD,
author = "Tobin White",
title = "Encrypted objects and decryption processes:
problem-solving with functions in a learning
environment based on cryptography",
journal = j-EDUC-STUD-MATH,
volume = "72",
number = "1",
pages = "17--37",
month = sep,
year = "2009",
CODEN = "EDSMAN",
DOI = "https://doi.org/10.1007/s10649-008-9180-y",
ISSN = "0013-1954 (print), 1573-0816 (electronic)",
ISSN-L = "0013-1954",
bibdate = "Sat Jan 14 17:14:41 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/educstudmath.bib",
URL = "http://link.springer.com/content/pdf/10.1007/s10649-008-9180-y.pdf",
acknowledgement = ack-nhfb,
fjournal = "Educational Studies in Mathematics",
journal-URL = "http://link.springer.com/journal/10649",
}
@Article{Wuensche:2009:CAE,
author = "Andrew Wuensche",
title = "{Cellular Automata Encryption}: the reverse algorithm,
{Z}-parameter and chain-rules",
journal = j-PARALLEL-PROCESS-LETT,
volume = "19",
number = "2",
pages = "283--297",
month = jun,
year = "2009",
CODEN = "PPLTEE",
DOI = "https://doi.org/10.1142/S0129626409000225",
ISSN = "0129-6264 (print), 1793-642X (electronic)",
bibdate = "Thu Sep 2 09:08:12 MDT 2010",
bibsource = "http://ejournals.wspc.com.sg/ppl/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Parallel Processing Letters",
journal-URL = "http://www.worldscientific.com/loi/ppl",
}
@Article{Xu:2009:AVB,
author = "Songhua Xu and Wenxia Yang and Francis C. M. Lau",
title = "Applications: a Visualization Based Approach for
Digital Signature Authentication",
journal = j-CGF,
volume = "28",
number = "3",
pages = "935--942",
month = jun,
year = "2009",
CODEN = "CGFODY",
DOI = "https://doi.org/10.1111/j.1467-8659.2009.01455.x",
ISSN = "0167-7055 (print), 1467-8659 (electronic)",
ISSN-L = "0167-7055",
bibdate = "Sat May 11 13:27:22 MDT 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cgf.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Com{\-}pu{\-}ter Graphics Forum",
journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/",
onlinedate = "27 Jul 2009",
}
@Article{Yang:2009:AIO,
author = "Yin Yang and Stavros Papadopoulos and Dimitris
Papadias and George Kollios",
title = "Authenticated indexing for outsourced spatial
databases",
journal = j-VLDB-J,
volume = "18",
number = "3",
pages = "631--648",
month = jun,
year = "2009",
CODEN = "VLDBFR",
DOI = "https://doi.org/10.1007/s00778-008-0113-2",
ISSN = "1066-8888 (print), 0949-877X (electronic)",
ISSN-L = "1066-8888",
bibdate = "Tue Sep 15 14:55:19 MDT 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "In spatial database outsourcing, a data owner
delegates its data management tasks to a location-based
service (LBS), which indexes the data with an
authenticated data structure (ADS). The LBS receives
queries (ranges, nearest neighbors) originating from
several clients/subscribers. Each query initiates the
computation of a verification object (VO) based on the
ADS. The VO is returned to the client that can verify
the result correctness using the public key of the
owner. Our first contribution is the MR-tree, a
space-efficient ADS that supports fast query processing
and verification. Our second contribution is the
MR*-tree, a modified version of the MR-tree, which
significantly reduces the VO size through a novel
embedding technique. Finally, whereas most ADSs must be
constructed and maintained by the owner, we outsource
the MR- and MR*-tree construction and maintenance to
the LBS, thus relieving the owner from this
computationally intensive task.",
acknowledgement = ack-nhfb,
fjournal = "VLDB Journal: Very Large Data Bases",
journal-URL = "http://portal.acm.org/toc.cfm?id=J869",
keywords = "Authenticated index; Database outsourcing; Mobile
computing; Spatial database",
}
@Article{Yang:2009:CGA,
author = "Seung S. Yang and Hongsik Choi",
title = "A complement to the {GridOne} authentication method",
journal = j-NETWORK-SECURITY,
volume = "2009",
number = "12",
pages = "12--18",
month = dec,
year = "2009",
CODEN = "NTSCF5",
DOI = "https://doi.org/10.1016/S1353-4858(10)70007-6",
ISSN = "1353-4858 (print), 1872-9371 (electronic)",
ISSN-L = "1353-4858",
bibdate = "Mon Dec 4 17:00:11 MST 2017",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/network-security.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S1353485810700076",
acknowledgement = ack-nhfb,
fjournal = "Network Security",
journal-URL = "https://www.sciencedirect.com/journal/network-security",
}
@Article{Yang:2009:CLW,
author = "Cheng-Hsing Yang and Chi-Yao Weng and Shiuh-Jeng Wang
and Hung-Min Sun",
title = "Codebook-linked Watermarking Scheme for Digital
Images",
journal = j-FUND-INFO,
volume = "92",
number = "4",
pages = "397--409",
month = jun,
year = "2009",
CODEN = "FUMAAJ",
ISSN = "0169-2968 (print), 1875-8681 (electronic)",
ISSN-L = "0169-2968",
bibdate = "Sat Mar 5 17:08:38 MST 2016",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/fundinfo2000.bib",
acknowledgement = ack-nhfb,
fjournal = "Fundamenta Informaticae",
journal-URL = "http://content.iospress.com/journals/fundamenta-informaticae",
}
@Article{Yang:2009:ETP,
author = "Jen-Ho Yang and Chin-Chen Chang",
title = "An efficient three-party authenticated key exchange
protocol using elliptic curve cryptography for
mobile-commerce environments",
journal = j-J-SYST-SOFTW,
volume = "82",
number = "9",
pages = "1497--1502",
month = sep,
year = "2009",
CODEN = "JSSODM",
ISSN = "0164-1212 (print), 1873-1228 (electronic)",
ISSN-L = "0164-1212",
bibdate = "Tue Sep 7 07:27:05 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/01641212",
acknowledgement = ack-nhfb,
fjournal = "The Journal of systems and software",
journal-URL = "http://www.sciencedirect.com/science/journal/01641212",
}
@Article{Yang:2009:IBR,
author = "Jen-Ho Yang and Chin-Chen Chang",
title = "An {ID}-based remote mutual authentication with key
agreement scheme for mobile devices on elliptic curve
cryptosystem",
journal = j-COMPUT-SECUR,
volume = "28",
number = "3--4",
pages = "138--143",
month = may # "\slash " # jun,
year = "2009",
CODEN = "CPSEDU",
ISSN = "0167-4048 (print), 1872-6208 (electronic)",
ISSN-L = "0167-4048",
bibdate = "Mon Sep 23 09:46:16 MDT 2019",
bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "https://www.sciencedirect.com/science/article/pii/S0167404808001120",
acknowledgement = ack-nhfb,
fjournal = "Computers \& Security",
journal-URL = "http://www.sciencedirect.com/science/journal/01674048",
}
@Article{Yao:2009:CAR,
author = "Danfeng Yao and Roberto Tamassia",
title = "Compact and Anonymous Role-Based Authorization Chain",
journal = j-TISSEC,
volume = "12",
number = "3",
pages = "15:1--15:??",
month = jan,
year = "2009",
CODEN = "ATISBQ",
DOI = "https://doi.org/10.1145/1455526.1455528",
ISSN = "1094-9224 (print), 1557-7406 (electronic)",
ISSN-L = "1094-9224",
bibdate = "Mon Feb 2 18:03:37 MST 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
abstract = "We introduce a decentralized delegation model called
anonymous role-based cascaded delegation. In this
model, a delegator can issue authorizations on behalf
of her role without revealing her identity. This type
of delegation protects the sensitive membership
information of a delegator and hides the internal
structure of an organization. To provide an efficient
storage and transmission mechanism for credentials used
in anonymous role-based cascaded delegation, we present
a new digital signature scheme that supports both
signer anonymity and signature aggregation. Our scheme
has compact role signatures that make it especially
suitable for ubiquitous computing environments, where
users may have mobile computing devices with narrow
communication bandwidth and small storage units.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Information and System Security",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789",
keywords = "aggregate signature; anonymity; Delegation",
}
@Article{Yi:2009:SSG,
author = "Ke Yi and Feifei Li and Graham Cormode and Marios
Hadjieleftheriou and George Kollios and Divesh
Srivastava",
title = "Small synopses for group-by query verification on
outsourced data streams",
journal = j-TODS,
volume = "34",
number = "3",
pages = "15:1--15:??",
month = aug,
year = "2009",
CODEN = "ATDSD3",
DOI = "https://doi.org/10.1145/1567274.1567277",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Mon Aug 31 16:11:01 MDT 2009",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Due to the overwhelming flow of information in many
data stream applications, data outsourcing is a natural
and effective paradigm for individual businesses to
address the issue of scale. In the standard data
outsourcing model, the data owner outsources streaming
data to one or more third-party servers, which answer
queries posed by a potentially large number of clients
on the data owner's behalf. Data outsourcing
intrinsically raises issues of trust, making outsourced
query assurance on data streams a problem with
important practical implications. Existing solutions
proposed in this model all build upon cryptographic
primitives such as signatures and collision-resistant
hash functions, which only work for certain types of
queries, for example, simple selection/aggregation
queries.\par
In this article, we consider another common type of
queries, namely, ``GROUP BY, SUM'' queries, which
previous techniques fail to support. Our new solutions
are not based on cryptographic primitives, but instead
use algebraic and probabilistic techniques to compute a
small synopsis on the true query result, which is then
communicated to the client so as to verify the
correctness of the query result returned by the server.
The synopsis uses a constant amount of space
irrespective of the result size, has an extremely small
probability of failure, and can be maintained using no
extra space when the query result changes as elements
stream by. We then generalize our synopsis to allow
some tolerance on the number of erroneous groups, in
order to support semantic load shedding on the server.
When the number of erroneous groups is indeed
tolerable, the synopsis can be strengthened so that we
can locate and even correct these errors. Finally, we
implement our techniques and perform an empirical
evaluation using live network traffic.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Database Systems",
journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777",
keywords = "data streams; outsourcing; Synopses",
}
@InProceedings{Yilek:2009:WPK,
author = "Scott Yilek and Eric Rescorla and Hovav Shacham and
Brandon Enright and Stefan Savage",
editor = "????",
booktitle = "ACM Internet Measurement Conference",
title = "When private keys are public: Results from the {2008
Debian OpenSSL} vulnerability",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "??--??",
year = "2009",
DOI = "????",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Mon Mar 09 16:09:39 2015",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "????",
acknowledgement = ack-nhfb,
remark = "Cite in \cite[reference 79]{Schneier:2015:SWC}.",
}
@InProceedings{Youssef:2009:IEU,
author = "M. I. Youssef and M. Zahara and A. E. Emam and M. A.
Elghany",
booktitle = "{NRSC 2009. National Radio Science Conference, 2009}",
title = "Image encryption using pseudo random number and
chaotic sequence generators",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--15",
year = "2009",
bibdate = "Fri Jan 6 08:10:49 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5233974",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5210443",
}
@Article{Zhang:2009:CII,
author = "Fangguo Zhang and Xiaofeng Chen",
title = "Cryptanalysis and improvement of an {ID}-based ad-hoc
anonymous identification scheme at {CT-RSA 05}",
journal = j-INFO-PROC-LETT,
volume = "109",
number = "15",
pages = "846--849",
day = "16",
month = jul,
year = "2009",
CODEN = "IFPLAT",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Thu Mar 31 15:53:37 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
http://www.sciencedirect.com/science/journal/00200190",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
}
@InProceedings{Zhang:2009:IBR,
author = "Jianhong Zhang and Cheng Ji",
editor = "{IEEE}",
booktitle = "{Proceedings of the International Conference on
Computational Intelligence and Software Engineering,
2009. CiSE 2009, December 11--13, 2009, Wuhan, China}",
title = "An Id-Based and Repairing {NTRUSign}-Based Anonymous
Multi-Proxy Signature Scheme",
publisher = pub-IEEE,
address = pub-IEEE:adr,
bookpages = "????",
pages = "1--??",
year = "2009",
DOI = "https://doi.org/10.1109/CISE.2009.5366284",
ISBN = "1-4244-4507-8",
ISBN-13 = "978-1-4244-4507-3",
LCCN = "QA76.758 2009",
bibdate = "Thu Apr 21 11:00:03 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.mit.edu:9909/mit01",
note = "IEEE catalog number CFP0926H.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5362500",
abstract = "Proxy signature is an important delegation technology,
it allows an original signer to delegate her signing
capability to a proxy signer and the proxy signer can
produce a signature on behalf of the original signer.
In this paper, we propose an ID-based and repairing
NTRUSign-based anonymous multi-proxy signature scheme.
With the characteristic of NTRUSign, our scheme has
more effective the key generation and rapid computation
speed than other similar schemes based on RSA or ECC.
The signers in our scheme are all anonymous so that no
one can forge the signing key composed of the hash
value of the original and all the proxy signers'
identities. The secretly chosen small polynomials were
transmitted among signers according to a certain order
without secure channels. The signing key is the
combination of the original and all the proxy signers'
keys. We also show our INBAMPS scheme satisfies all the
properties of the general multi-signature scheme. And
we point out that our scheme is resistant to
existential message attack based on repairing NTRUSign.
Thus, our INBAMPS scheme is secure.",
acknowledgement = ack-nhfb,
keywords = "ANSI X9.98-2010; NTRUSign",
}
@InProceedings{Akavia:2010:EBO,
author = "Adi Akavia and Oded Goldreich and Shafi Goldwasser and
Dana Moshkovitz",
title = "Erratum for: {{\em On basing one-way functions on
NP-hardness}}",
crossref = "ACM:2010:PAI",
pages = "795--796",
year = "2010",
bibdate = "Wed Sep 1 10:42:57 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "See \cite{Akavia:2006:BOW}.",
acknowledgement = ack-nhfb,
}
@InProceedings{Chang:2010:PRN,
author = "Weiling Chang and Binxing Fang and Xiaochun Yun and
Shupeng Wang and Xiangzhan Yu",
booktitle = "{2010 Data Compression Conference (DCC)}",
title = "A pseudo-random number generator based on {LZSS}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "524",
year = "2010",
DOI = "https://doi.org/10.1109/DCC.2010.77",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5453503",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5453382",
keywords = "L12RC4; LZSS compression algorithm; RC4 stream
cipher",
}
@InProceedings{Lan:2010:RNG,
author = "Jingjing Lan and Wang Ling Goh and Zhi Hui Kong and
Kiat Seng Yeo",
booktitle = "{2010 International SoC Design Conference (ISOCC)}",
title = "A random number generator for low power cryptographic
application",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "328--331",
year = "2010",
DOI = "https://doi.org/10.1109/SOCDC.2010.5682906",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5682906",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5678854",
}
@Article{Marton:2010:RDC,
author = "Kinga Marton and Alin Suciu and Iosif Ignat",
title = "Randomness in Digital Cryptography: a Survey",
journal = "Romanian Journal of Information Science and
Technology",
volume = "13",
number = "3",
pages = "219--240",
month = "????",
year = "2010",
CODEN = "????",
ISSN = "1453-8245",
ISSN-L = "1453-8245",
bibdate = "Tue Jan 31 15:21:48 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http:www.imt.ro/romjist/Volum13/Number13_3/pdf/KMarton.pdf",
acknowledgement = ack-nhfb,
ajournal = "Rom. J. Inf. Sci. Technol.",
}
@InProceedings{Moghadam:2010:DRN,
author = "I. Zarei Moghadam and A. S. Rostami and M. R.
Tanhatalab",
booktitle = "{2010 International Conference on Computer Design and
Applications (ICCDA)}",
title = "Designing a random number generator with novel
parallel {LFSR} substructure for key stream ciphers",
volume = "5",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "V5--598--V5--601",
year = "2010",
DOI = "https://doi.org/10.1109/ICCDA.2010.5541188",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5541188",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5520349",
}
@InProceedings{Navin:2010:ETU,
author = "A. H. Navin and Z. Navadad and B. Aasadi and M.
Mirnia",
booktitle = "{2010 International Conference on Computational
Intelligence and Communication Networks (CICN)}",
title = "Encrypted Tag by Using Data-Oriented Random Number
Generator to Increase Security in Wireless Sensor
Network",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "335--338",
year = "2010",
DOI = "https://doi.org/10.1109/CICN.2010.75",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5701989",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5701810",
}
@InProceedings{Peris-Lopez:2010:CSP,
author = "Pedro Peris-Lopez and Enrique {San Mill{\'a}n} and Jan
C. A. van der Lubbe and Luis A. Entrena",
booktitle = "{2010 International Conference for Internet Technology
and Secured Transactions (ICITST)}",
title = "Cryptographically secure pseudo-random bit generator
for {RFID} tags",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1--6",
year = "2010",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5678035",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5672505",
}
@InProceedings{Xin:2010:IEB,
author = "Hong Xin and Zhu Shujing and Chen Weibin and Jian
Chongjun",
booktitle = "{2010 International Conference on Computer Application
and System Modeling (ICCASM)}",
title = "An image encryption base on non-linear pseudo-random
number generator",
volume = "9",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "V9--238--V9--241",
year = "2010",
DOI = "https://doi.org/10.1109/ICCASM.2010.5623043",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5623043",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5602791",
}
@Article{Bahi:2011:ECS,
author = "Jacques M. Bahi and Rapha{\"e}l Couturier and
Christophe Guyeux and Pierre-Cyrille H{\'e}am",
title = "Efficient and Cryptographically Secure Generation of
Chaotic Pseudorandom Numbers on {GPU}",
journal = "arxiv.org",
volume = "??",
number = "??",
pages = "??--??",
day = "22",
month = dec,
year = "2011",
bibdate = "Thu Jan 19 17:58:12 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://arxiv.org/abs/1112.5239",
abstract = "In this paper we present a new pseudorandom number
generator (PRNG) on graphics processing units (GPU).
This PRNG is based on the so-called chaotic iterations.
It is firstly proven to be chaotic according to the
Devaney's formulation. We thus propose an efficient
implementation for GPU that successfully passes the
BigCrush tests, deemed to be the hardest battery of
tests in TestU01. Experiments show that this PRNG can
generate about 20 billion of random numbers per second
on Tesla C1060 and NVidia GTX280 cards. It is then
established that, under reasonable assumptions, the
proposed PRNG can be cryptographically secure. A
chaotic version of the Blum--Goldwasser asymmetric key
encryption scheme is finally proposed.",
acknowledgement = ack-nhfb,
}
@InProceedings{Seyedzadeh:2011:IEA,
author = "Seyed Mohammad Seyedzadeh and Yasaman Hashemi",
booktitle = "{2011 11th International Conference on Intelligent
Systems Design and Applications (ISDA)}",
title = "Image encryption algorithm based on {Choquet Fuzzy
Integral} with self-adaptive pseudo-random number
generator",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "642--647",
year = "2011",
DOI = "https://doi.org/10.1109/ISDA.2011.6121728",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6121728",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6112291",
}
@InProceedings{Seyedzadeh:2011:IES,
author = "S. M. Seyedzadeh and S. Mirzakuchaki",
booktitle = "{2011 International Symposium on Artificial
Intelligence and Signal Processing (AISP)}",
title = "Image encryption scheme based on {Choquet} fuzzy
integral with pseudo-random keystream generator",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "101--106",
year = "2011",
DOI = "https://doi.org/10.1109/AISP.2011.5960982",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5960982",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5955054",
}
@InProceedings{Stipcevic:2011:QRN,
author = "M. Stipcevic",
booktitle = "{2011 Proceedings of the 34th International Convention
MIPRO}",
title = "Quantum random number generators and their use in
cryptography",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "1474--1479",
year = "2011",
bibdate = "Fri Jan 6 07:45:38 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5967293",
acknowledgement = ack-nhfb,
book-URL = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5945021",
}
@Article{Xing-Yuan:2011:PRS,
author = "Wang Xing-Yuan and Qin Xue and Xie Yi-Xin",
title = "Pseudo-Random Sequences Generated by a Class of
One-Dimensional Smooth Map",
journal = j-CHIN-PHYS-LETT,
volume = "28",
number = "8",
pages = "080501",
year = "2011",
CODEN = "CPLEEU",
DOI = "https://doi.org/10.1088/0256-307X/28/8/080501",
ISSN = "0256-307X (print), 1741-3540 (electronic)",
ISSN-L = "0256-307X",
bibdate = "Wed Feb 22 08:59:20 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://stacks.iop.org/0256-307X/28/i=8/a=080501",
abstract = "We extend a class of a one-dimensional smooth map. We
make sure that for each desired interval of the
parameter the map's Lyapunov exponent is positive. Then
we propose a novel parameter perturbation method based
on the good property of the extended one-dimensional
smooth map. We perturb the parameter $r$ in each
iteration by the real number $ x_i$ generated by the
iteration. The auto-correlation function and NIST
statistical test suite are taken to illustrate the
method's randomness finally. We provide an application
of this method in image encryption. Experiments show
that the pseudo-random sequences are suitable for this
application.",
acknowledgement = ack-nhfb,
fjournal = "Chinese Physics Letters",
}
@TechReport{Anonymous:2012:SHS,
author = "Anonymous",
key = "FIPS-180-4",
title = "{Secure Hash Standard (SHS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 180-4",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "v + 30",
month = mar,
year = "2012",
bibdate = "Wed Jan 30 09:27:44 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/datacompression.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf;
http://csrc.nist.gov/publications/PubsFIPS.html#fips180-4",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Federal Information
Processing Standards; hash algorithm; hash function;
message digest; Secure Hash Standard",
}
@TechReport{Anonymous:2013:DSS,
author = "Anonymous",
key = "FIPS-186-4",
title = "{Digital Signature Standard (DSS)}",
type = "{Federal Information Processing Standards}
Publication",
number = "FIPS Pub 186-4",
institution = pub-NIST,
address = pub-NIST:adr,
pages = "vii + 121",
month = jul,
year = "2013",
DOI = "https://doi.org/10.6028/NIST.FIPS.186-4",
bibdate = "Thu Aug 21 06:15:29 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
URL = "http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf",
acknowledgement = ack-nhfb,
keywords = "computer security; cryptography; Digital Signature
Standard (DSS); Federal Information Processing
Standards",
}
@Article{He:2013:GME,
author = "Q. Y. He and M. D. Reid",
title = "Genuine Multipartite {Einstein--Podolsky--Rosen}
Steering",
journal = j-PHYS-REV-LET,
volume = "111",
number = "25",
pages = "250403",
month = dec,
year = "2013",
CODEN = "PRLTAO",
DOI = "https://doi.org/10.1103/PhysRevLett.111.250403",
ISSN = "0031-9007 (print), 1079-7114 (electronic), 1092-0145",
ISSN-L = "0031-9007",
bibdate = "Wed Mar 26 14:58:12 2014",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/einstein.bib",
URL = "http://link.aps.org/doi/10.1103/PhysRevLett.111.250403;
http://www.scientificcomputing.com/news/2014/03/einsteins-entanglement-produces-quantum-encryption;
http://www.swinburne.edu.au/engineering/caous/news_and_events/mulitipartite%20EPR%20steering%20paper.htm",
acknowledgement = ack-nhfb,
fjournal = "Physical Review Letters",
journal-URL = "http://prl.aps.org/browse",
keywords = "$N$-partite Einstein-Podolsky-Rosen (EPR) steering;
quantum cryptography; quantum secret sharing",
numpages = "5",
}
@Article{Mukhopadhyay:2014:EMP,
author = "Debapriyay Mukhopadhyay and Subhas C. Nandy",
title = "Efficient multiple-precision integer division
algorithm",
journal = j-INFO-PROC-LETT,
volume = "114",
number = "3",
pages = "152--157",
month = mar,
year = "2014",
CODEN = "IFPLAT",
DOI = "https://doi.org/10.1016/j.ipl.2013.10.005",
ISSN = "0020-0190 (print), 1872-6119 (electronic)",
ISSN-L = "0020-0190",
bibdate = "Mon Dec 9 09:33:47 MST 2013",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib;
http://www.sciencedirect.com/science/journal/00200190",
note = "This paper provides a correction to the algorithm
presented in \cite{Huang:2005:EMP}, and also supplies a
complicated correctness proof.",
URL = "http://www.sciencedirect.com/science/article/pii/S0020019013002627",
acknowledgement = ack-nhfb,
fjournal = "Information Processing Letters",
journal-URL = "http://www.sciencedirect.com/science/journal/00200190",
keywords = "computational arithmetic; cryptography; division
algorithm; normalization",
}
@Article{Ahmed:2017:IRD,
author = "Kareem Ahmed and Ibrahim El-Henawy",
title = "Increasing robustness of {Data Encryption Standard} by
integrating {DNA} cryptography",
journal = j-INT-J-COMPUT-APPL,
volume = "39",
number = "2",
pages = "91--105",
year = "2017",
DOI = "https://doi.org/10.1080/1206212X.2017.1289690",
ISSN = "1206-212X (print), 1925-7074 (electronic)",
ISSN-L = "1206-212X",
bibdate = "Sat Apr 21 17:31:06 MDT 2018",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/ijca.bib",
URL = "https://www.tandfonline.com/doi/full/10.1080/1206212X.2017.1289690",
acknowledgement = ack-nhfb,
fjournal = "International Journal of Computer Applications",
journal-URL = "https://www.tandfonline.com/loi/tjca20",
online-date = "22 Feb 2017",
}
@Misc{Gutmann:20xx:ESR,
author = "Peter Gutmann",
title = "Encryption and Security-related Resources",
howpublished = "World-Wide Web site.",
year = "20xx",
bibdate = "Mon Dec 08 09:54:15 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.cs.auckland.ac.nz/~pgut001/links.html",
acknowledgement = ack-nhfb,
}
@Book{Mrayati:20xx:AET,
editor = "M. Mrayati and Y. Meer Alam and M. H. at-Tayyan",
title = "Analysis and editing of three {Arabic} manuscripts:
{Al-Kindi}, {Ibn-Adlan}, {Ibn-Al-Durahim}",
publisher = "KFCRIS \& KACST",
address = "Riyadh, Saudi Arabia",
pages = "????",
year = "20xx",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Thu May 12 06:53:13 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Introduction by Chaker Faham.",
series = "Origins of Arab cryptography and cryptanalysis",
acknowledgement = ack-nhfb,
keywords = "cryptography / Arab countries / history",
remark = "Translated by Said M. Asaad. Revised by Mohammed
Ibrahim Al-Suwaiyel and Marwan Bawab and Ishaq ibn
Ibrahim Katib",
}
@Misc{Sale:20xx:CRP,
author = "Tony Sale",
title = "The {Colossus} Rebuild Project",
howpublished = "World-Wide Web site.",
year = "20xx",
bibdate = "Wed Apr 20 12:07:15 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.codesandciphers.org.uk/lorenz/rebuild.htm",
acknowledgement = ack-nhfb,
}
@Proceedings{Pellikaan:1996:AGC,
editor = "R. Pellikaan and M. Perret and S. G. Vladut",
booktitle = "Arithmetic, geometry, and coding theory: proceedings
of the international conference held at Centre
international de rencontres math{\'e}matiques {(CIRM),
Luminy, France, June 28--July 2, 1993}",
title = "Arithmetic, geometry, and coding theory: proceedings
of the international conference held at Centre
international de rencontres math{\'e}matiques {(CIRM),
Luminy, France, June 28--July 2, 1993}",
publisher = pub-GRUYTER,
address = pub-GRUYTER:adr,
pages = "xii + 288",
year = "1996",
ISBN = "3-11-014616-9",
ISBN-13 = "978-3-11-014616-5",
LCCN = "QA268 .A75 1996",
bibdate = "Wed Jan 16 09:27:31 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 102.45",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; geometry, algebraic ---
congresses; number theory --- congresses",
}
@Proceedings{Williams:1999:QCQ,
editor = "Colin P. Williams",
booktitle = "Quantum computing and quantum communications: First
{NASA} International Conference, {QCQS} [i.e., {QCQC}]
'98, Palm Springs, California, {USA}, February 17--20,
1998: selected papers",
title = "Quantum computing and quantum communications: First
{NASA} International Conference, {QCQS} [i.e., {QCQC}]
'98, Palm Springs, California, {USA}, February 17--20,
1998: selected papers",
volume = "1509",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 480",
year = "1999",
ISBN = "3-540-65514-X (softcover)",
ISBN-13 = "978-3-540-65514-5 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.889 .Q37 1998",
bibdate = "Sat Jul 3 09:51:14 MDT 1999",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "optical communications --- congresses; quantum
computers --- congresses",
}
@Proceedings{ACM:2000:PTS,
editor = "{ACM}",
booktitle = "Proceedings of the thirty second annual {ACM}
Symposium on Theory of Computing: Portland, Oregon, May
21--23, [2000]",
title = "Proceedings of the thirty second annual {ACM}
Symposium on Theory of Computing: Portland, Oregon, May
21--23, [2000]",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "ix + 756",
year = "2000",
ISBN = "1-58113-184-4",
ISBN-13 = "978-1-58113-184-0",
bibdate = "Sat Oct 28 16:10:32 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "ACM order number 508000.",
acknowledgement = ack-nhfb,
keywords = "computational complexity -- congresses; computer
programming -- congresses; electronic data processing
-- congresses; electronic digital computers --
congresses; online resources",
}
@Proceedings{Anonymous:2000:CCI,
editor = "Anonymous",
booktitle = "Cool Chips {III}: An International Symposium on
Low-Power and High-Speed Chips, Kikai-Shinko-Kaikan,
Tokyo, Japan April 24--25, 2000",
title = "Cool Chips {III}: An International Symposium on
Low-Power and High-Speed Chips, Kikai-Shinko-Kaikan,
Tokyo, Japan April 24--25, 2000",
publisher = "????",
address = "????",
pages = "????",
year = "2000",
ISBN = "",
ISBN-13 = "",
LCCN = "",
bibdate = "Mon Jan 08 09:19:21 2001",
bibsource = "http://www.coolchips.org/index-cool3.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Bellare:2000:ACC,
editor = "Mihir Bellare",
booktitle = "Advances in cryptology --- {CRYPTO} 2000: 20th annual
International Cryptology Conference, Santa Barbara,
California, {USA}, August 20--24, 2000: proceedings",
title = "Advances in cryptology --- {CRYPTO} 2000: 20th annual
International Cryptology Conference, Santa Barbara,
California, {USA}, August 20--24, 2000: proceedings",
volume = "1880",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 543",
year = "2000",
ISBN = "3-540-67907-3",
ISBN-13 = "978-3-540-67907-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 C79 2000 Bar",
bibdate = "Mon Oct 16 18:31:56 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Buchmann:2000:CTC,
editor = "Johannes Buchmann",
booktitle = "Coding theory, cryptography, and related areas:
proceedings of an International Conference on Coding
Theory, Cryptography, and Related Areas, held in
Guanajuato, Mexico, in April 1998",
title = "Coding theory, cryptography, and related areas:
proceedings of an International Conference on Coding
Theory, Cryptography, and Related Areas, held in
Guanajuato, Mexico, in April 1998",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 259",
year = "2000",
ISBN = "3-540-66248-0 (softcover)",
ISBN-13 = "978-3-540-66248-8 (softcover)",
LCCN = "TK5102.94 .I58 1998",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.springer.com/mathematics/numbers/book/978-3-540-66248-8",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; data encryption
(computer science) --- congresses; data transmission
systems --- security measures --- congresses",
}
@Proceedings{Christianson:2000:SPI,
editor = "Bruce Christianson",
booktitle = "{Security protocols: 7th International Workshop,
Cambridge, UK, April 19--21, 1999: Proceedings}",
title = "{Security protocols: 7th International Workshop,
Cambridge, UK, April 19--21, 1999: Proceedings}",
volume = "1796",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 227",
year = "2000",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-67381-4 (softcover)",
ISBN-13 = "978-3-540-67381-1 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.1796",
bibdate = "Mon Oct 16 18:31:56 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t1796.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1796",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; cryptography --- congresses",
}
@Proceedings{Domingo-Ferrer:2000:SCR,
editor = "Josep Domingo-Ferrer and David Chan and Anthony
Watson",
booktitle = "Smart card research and advanced applications: {IFIP
TC8\slash WG8.8 Fourth Working Conference on Smart Card
Research and Advanced Applications, September 20--22,
2000, Bristol, United Kingdom}",
title = "Smart card research and advanced applications: {IFIP
TC8\slash WG8.8 Fourth Working Conference on Smart Card
Research and Advanced Applications, September 20--22,
2000, Bristol, United Kingdom}",
volume = "52",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "ix + 388",
year = "2000",
ISBN = "0-7923-7953-5",
ISBN-13 = "978-0-7923-7953-9",
LCCN = "TK7895.S62 I34 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "IFIP",
acknowledgement = ack-nhfb,
keywords = "smart cards --- congresses",
}
@Proceedings{ElAbbadi:2000:VPI,
editor = "Amr {El Abbadi} and Michael L. Brodie and Sharma
Chakravarthy and Umeshwar Dayal and Nabil Kamel and
Gunter Schlageter and Kyu-Young Whang",
booktitle = "{VLDB} 2000, Proceedings of 26th International
Conference on Very Large Data Bases, September 10--14,
2000, Cairo, Egypt",
title = "{VLDB} 2000, Proceedings of 26th International
Conference on Very Large Data Bases, September 10--14,
2000, Cairo, Egypt",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "????",
year = "2000",
ISBN = "1-55860-715-3",
ISBN-13 = "978-1-55860-715-6",
LCCN = "????",
bibdate = "Thu Jan 11 12:34:25 2001",
bibsource = "DBLP; http://dblp.uni-trier.de;
http://www.vldb.org/dblp/db/conf/vldb/vldb2000.html;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Heys:2000:SAC,
editor = "Howard Heys and Carlisle Adams",
booktitle = "Selected areas in cryptography: 6th annual
international workshop, {SAC'99}, Kingston, Ontario,
Canada, August 9--10, 1999: proceedings",
title = "Selected areas in cryptography: 6th annual
international workshop, {SAC}'99, Kingston, Ontario,
Canada, August 9--10, 1999: proceedings",
volume = "1758",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 241",
year = "2000",
ISBN = "3-540-67185-4",
ISBN-13 = "978-3-540-67185-5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.1758",
bibdate = "Mon Oct 16 09:20:30 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Contents: A universal encryption standard / Helena
Handschuh and Serge Vaudenay --- Yarrow-160: notes on
the design and analysis of the Yarrow cryptographic
pseudorandom number generator / John Kelsey, Bruce
Schneier, and Niels Ferguson --- Elliptic curve
pseudorandom sequence generators / Guang Gong, Thomas
A. Berson, and Douglas R. Stinson --- Adaptive-attack
norm for decorrelation and super-pseudorandomness /
Serge Vaudenay --- Guesswork and variation distance as
measures of cipher security / John O. Pliam ---
Modeling linear characteristics of
substitution-permutation networks / Liam Keliher, Henk
Meijer, and Stafford Tavares --- Strong linear
dependence and unbiased distribution of non-propagative
vectors / Yuliang Zheng and Xian-Mo Zhang --- Security
of E2 against truncated differential cryptanalysis /
Shiho Moriai \ldots{} [et al..] --- Key-schedule
cryptanalysis of DEAL / John Kelsey and Bruce Schneier
--- Efficient evaluation of security against
generalized interpolation attack / Kazumaro Aoki ---
Efficient implementation of cryptosystems based on
non-maximal imaginary quadratic orders / Detlef
Huhnlein --- Improving and extending the Lim/Lee
exponentiation algorithm / Biljana Cubaleska, Andreas
Rieke, and Thomas Hermann --- Software optimization of
decorrelation module / Fabrice Noilhan --- Pseudonym
systems / Anna Lysyanskaya \ldots{} [et al.] ---
Unconditionally secure proactive secret sharing scheme
with combinatorial structures / Douglas R. Stinson and
R. Wei --- Protecting a mobile agent's route against
collusions / Dirk Westhoff \ldots{} [et al.] ---
Photuris: design criteria / William Allen Simpson",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; data encryption
(computer science) --- congresses",
}
@Proceedings{IEEE:2000:ASF,
editor = "{IEEE}",
booktitle = "41st Annual Symposium on Foundations of Computer
Science: proceedings: 12--14 November, 2000, Redondo
Beach, California",
title = "41st Annual Symposium on Foundations of Computer
Science: proceedings: 12--14 November, 2000, Redondo
Beach, California",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 688",
year = "2000",
CODEN = "ASFPDV",
ISBN = "0-7695-0850-2, 0-7695-0851-0 (case), 0-7695-0852-9
(microfiche)",
ISBN-13 = "978-0-7695-0850-4, 978-0-7695-0851-1 (case),
978-0-7695-0852-8 (microfiche)",
ISSN = "0272-5428",
LCCN = "TK7885.A1 S92 2000",
bibdate = "Thu Apr 05 06:27:02 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "IEEE Computer Society order number PR00850.",
acknowledgement = ack-nhfb,
}
@Proceedings{Imai:2000:PKC,
editor = "Hideki Imai and Yuliang Zheng",
booktitle = "Public key cryptography: third International Workshop
on Practice and Theory in Public Key Cryptosystems,
{PKC} 2000, Melbourne, Victoria, Australia, January
18--20, 2000: proceedings",
title = "Public key cryptography: third International Workshop
on Practice and Theory in Public Key Cryptosystems,
{PKC} 2000, Melbourne, Victoria, Australia, January
18--20, 2000: proceedings",
volume = "1751",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 483",
year = "2000",
ISBN = "3-540-66967-1",
ISBN-13 = "978-3-540-66967-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.1751",
bibdate = "Mon Oct 16 18:31:56 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; data encryption (computer
science) --- congresses",
}
@Proceedings{Joyner:2000:CTC,
editor = "David Joyner",
booktitle = "Coding theory and cryptography: from {Enigma} and
{Geheimschreiber} to quantum theory",
title = "Coding theory and cryptography: from {Enigma} and
{Geheimschreiber} to quantum theory",
publisher = pub-SV,
address = pub-SV:adr,
pages = "vi + 256",
year = "2000",
DOI = "https://doi.org/10.1007/978-3-642-59663-6",
ISBN = "3-540-66336-3 (softcover), 3-642-59663-0 (e-book)",
ISBN-13 = "978-3-540-66336-2 (softcover), 978-3-642-59663-6
(e-book)",
LCCN = "QA268 .C67 1999",
bibdate = "Wed Jan 16 09:17:51 2002",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/maple-extract.bib",
note = "Proceedings of the Conference on Coding Theory,
Cryptography and Number Theory held at the U.S. Naval
Academy during October 25--26, 1998",
price = "UK\pounds 44.50",
URL = "http://frode.home.cern.ch/frode/pubs/cryptoday.pdf",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; cryptography ---
congresses",
tableofcontents = "P. Hilton: Reminiscences and Reflections of a
Codebreaker \\
W. T. Tutte: FISH and I \\
F. Weierud: Sturgeon, The FISH BP Never Really Caught
\\
D. A. Hatch: ENIGMA and PURPLE: How the Allies Broke
German and Japanese Codes During the War \\
L. Ulfving and F. Weierud: The Geheimschreiber Secret
\\
B. Wardlaw: The RSA Public Key Cryptosystem \\
J. Cosgrave: Number Theory and Cryptography (using
Maple) \\
S. J. Lomonaco, Jr.: A Talk on Quantum Cryptography or
How Alice Outwits Eve \\
T. S. Michael: The Rigidity Theorems of Hamada and
Ohmori, Revisited \\
A. Shokrollahi: Counting Prime Divisors on Elliptic
Curves and Multiplication in Finite Fields \\
A. Shokrollahi: On Cyclic MDS-Codes \\
S. Gao and A. Shokrollahi: Computing Roots of
Polynomials Over Function Fields of Curves \\
D. Joyner and S. Shokranian: Remarks on Codes From
Modular Curves: MAPLE Applications \\
Index",
}
@Proceedings{NIST:2000:TAE,
editor = "{NIST}",
booktitle = "The Third {Advanced Encryption Standard} Candidate
Conference, April 13--14, 2000, New York, {NY}, {USA}",
title = "The Third {Advanced Encryption Standard} Candidate
Conference, April 13--14, 2000, New York, {NY}, {USA}",
publisher = pub-NIST,
address = pub-NIST:adr,
pages = "358",
year = "2000",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Tue Feb 06 15:28:26 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://csrc.nist.gov/encryption/aes/round2/conf3/aes3conf.htm;
http://csrc.nist.gov/encryption/aes/round2/conf3/papers/AES3Proceedings-1.pdf;
http://csrc.nist.gov/encryption/aes/round2/conf3/papers/AES3Proceedings-2.pdf;
http://csrc.nist.gov/encryption/aes/round2/conf3/papers/AES3Proceedings-3.pdf;
http://csrc.nist.gov/encryption/aes/round2/conf3/papers/AES3Proceedings.pdf",
acknowledgement = ack-nhfb,
}
@Proceedings{Okamoto:2000:ACA,
editor = "Tatsuaki Okamoto",
booktitle = "Advances in cryptology --- {ASIACRYPT} 2000: 6th
International Conference on the Theory and Application
of Cryptology and Information Security, Kyoto, Japan,
December 3--7, 2000: proceedings",
title = "Advances in cryptology --- {ASIACRYPT} 2000: 6th
International Conference on the Theory and Application
of Cryptology and Information Security, Kyoto, Japan,
December 3--7, 2000: proceedings",
volume = "1976",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 630",
year = "2000",
ISBN = "3-540-41404-5 (softcover)",
ISBN-13 = "978-3-540-41404-9 (softcover)",
LCCN = "QA76.9.A25 I555 2000",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Preneel:2000:ACE,
editor = "Bart Preneel",
booktitle = "Advances in cryptology: {EUROCRYPT} 2000:
International Conference on the Theory and Application
of Cryptographic Techniques, Bruges, Belgium, May
14--18, 2000: proceedings",
title = "Advances in cryptology: {EUROCRYPT} 2000:
International Conference on the Theory and Application
of Cryptographic Techniques, Bruges, Belgium, May
14--18, 2000: proceedings",
volume = "1807",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 608",
year = "2000",
ISBN = "3-540-67517-5",
ISBN-13 = "978-3-540-67517-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.1807",
bibdate = "Mon Oct 16 18:31:56 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "cryptography --- congresses; data encryption (computer
science) --- congresses; online resources",
}
@Proceedings{Quisquater:2000:SCR,
editor = "J.-J. Quisquater and Bruce Schneier",
booktitle = "Smart card research and applications: third
international conference, {CARDIS'98},
{Louvain-la-Neuve}, Belgium, September 1998:
proceedings",
title = "Smart card research and applications: third
international conference, {CARDIS'98},
{Louvain-la-Neuve}, Belgium, September 1998:
proceedings",
volume = "1820",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 379",
year = "2000",
ISBN = "3-540-67923-5",
ISBN-13 = "978-3-540-67923-3",
LCCN = "TK7895.S62 C36 1998",
bibdate = "Wed Feb 06 08:18:26 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "smart cards --- congresses",
}
@Book{Rojas:2000:FCH,
editor = "Ra{\'u}l Rojas and Ulf Hashagen",
booktitle = "The First Computers: History and Architectures",
title = "The First Computers: History and Architectures",
publisher = pub-MIT,
address = pub-MIT:adr,
pages = "xii + 457",
year = "2000",
ISBN = "0-262-18197-5 (hardcover), 0-585-35535-5
(electronic)",
ISBN-13 = "978-0-262-18197-6 (hardcover), 978-0-585-35535-1
(electronic)",
LCCN = "QA76.17 .F57 2000",
bibdate = "Sat Nov 20 19:51:29 MST 2010",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/bauer-friedrich-ludwig.bib;
https://www.math.utah.edu/pub/bibnet/authors/r/rutishauser-heinz.bib;
https://www.math.utah.edu/pub/bibnet/authors/s/stiefel-eduard.bib;
https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib;
https://www.math.utah.edu/pub/bibnet/authors/w/wilkes-maurice-v.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
z3950.loc.gov:7090/Voyager",
series = "History of computing",
acknowledgement = ack-nhfb,
author-dates = "Eduard Stiefel (21 April 1909--25 November 1978);
Friedrich (``Fritz'') Ludwig Bauer (10 June 1924--26
March 2015); Heinz Rutishauser (30 January 1918--10
November 1970); John von Neumann (28 December 1903--8
February 1957); Sir Maurice Vincent Wilkes (26 June
1913--29 November 2010)",
subject = "Computers; History; Computer architecture",
tableofcontents = "A preview of things to come: some remarks on the
first generation of computers / Michael R. Williams /
1--13 \\
The structures of computation / Michael S. Mahoney /
17--32 \\
Reconstructions, historical and otherwise: the
challenge of high-tech artifacts / Robert W. Seidel /
33--52 \\
A classification scheme for program controlled
calculators / Andreas Brennecke / 53--68 \\
Hardware components and computer design / Harry D.
Huskey / 69--87 \\
Reconstruction of the Atanasoff--Berry Computer / John
Gustafson / 91--106 \\
Howard Aiken and the dawn of the computer age / I.
Bernard Cohen / 107--120 \\
The ENIAC: history, operation, and reconstruction in
VLSI / Jan Van der Spiegel, James F. Tau, Titiimaea F.
Ala'ilima, Lin Ping Ang / 121--178 \\
The Institute for Advanced Study Computer: a case study
in the application of concepts from the history of
technology / William Aspray / 179--193 \\
Nothing new since von Neumann: a historian looks at
computer architecture, 1945--1995 / Paul Ceruzzi /
195--217 \\
The DEHOMAG D11 tabulator: a milestone in the history
of data processing / Friedrich W. Kistermann / 221--235
\\
The architecture of Konrad Zuse's early computing
machines / Ra{\'u}l Rojas / 237--261 \\
Konrad Zuse's Z4: architecture, programming, and
modifications at the ETH Zurich / Ambros P. Speiser /
263--276 \\
The Plankalk{\"u}l of Konrad Zuse revisited / Friedrich
L. Bauer / 277--293 \\
The G1 and the G{\"o}ttingen family of digital
computers / Wilhelm Hopmann / 295--313 \\
Konrad Zuse and industrial manufacturing of electronic
computers in Germany / Hartmut Petzold / 315--322 \\
Helmut Hoelzer: inventor of the electronic analog
computer / Thomas Lange / 323--348 \\
The Colossus of Bletchley Park: the German cipher
system / Anthony E. Sale / 351--364 \\
The Manchester Mark 1 computers / R. B. E. Napper /
365--377 \\
Rebuilding the first Manchester computer / Christopher
P. Burton / 379--386 \\
The Atlas computer / Frank H. Sumner / 387--396 \\
Past into present: the EDSAC simulator / Martin
Campbell-Kelly / 397--416 \\
The first Japanese computers and their software
simulators / Seiichi Okoma / 419--434 \\
The {Parametron Computer PC-1} and its initial input
routine / Eiiti Wada / 435--452",
}
@Proceedings{Roy:2000:PCI,
editor = "Bimal Roy",
booktitle = "Progress in cryptology: {INDOCRYPT} 2000: First
International Conference in Cryptology in India,
Calcutta, India, December 10--13, 2000: proceedings",
title = "Progress in cryptology: {INDOCRYPT} 2000: First
International Conference in Cryptology in India,
Calcutta, India, December 10--13, 2000: proceedings",
volume = "1977",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 294",
year = "2000",
ISBN = "3-540-41452-5",
ISBN-13 = "978-3-540-41452-0",
LCCN = "QA267.A1 L43 no.1977",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Schmalz:2000:MAD,
editor = "Mark S. Schmalz",
booktitle = "{Mathematics and applications of data\slash image
coding, compression, and encryption III: 2 August 2000,
San Diego, USA}",
title = "{Mathematics and applications of data\slash image
coding, compression, and encryption III: 2 August 2000,
San Diego, USA}",
volume = "4122",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "v + 218",
year = "2000",
ISBN = "0-8194-3767-0",
ISBN-13 = "978-0-8194-3767-9",
LCCN = "TA1637 .M378 2000",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Earlier conferences have title: Mathematics of
data\slash image coding, compression, and encryption.",
series = "SPIE proceedings series",
acknowledgement = ack-nhfb,
keywords = "data encryption (computer science) --- congresses;
image compression --- congresses; image processing ---
digital techniques --- congresses; image processing ---
mathematics --- congresses",
}
@Proceedings{Song:2000:ISC,
editor = "JooSeok Song",
booktitle = "Information security and cryptology --- {ICISC'99:
second international conference, Seoul, Korea, December
9--10, 1999: proceedings}",
title = "Information security and cryptology --- {ICISC'99:
second international conference, Seoul, Korea, December
9--10, 1999: proceedings}",
volume = "1787",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 277",
year = "2000",
ISBN = "3-540-67380-6 (softcover)",
ISBN-13 = "978-3-540-67380-4 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.1787",
bibdate = "Mon Oct 16 18:31:56 MDT 2000",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
tableofcontents = "On provable security for conventional cryptography
/ Serge Vaudenay \\
Correlation properties of the Bluetooth combiner
generator / Miia Hermelin and Kaisa Nyberg \\
Preventing double-spent coins from revealing user's
whole secret / DaeHun Nyang and JooSeok Song \\
On the optimal diffusion layers with practical security
against differential and linear cryptanalysis / Ju-Sung
Kang \ldots{} [et al.] \\
Non-linear complexity of the Naor--Reingold
pseudo-random function / William D. Banks \ldots{} [et
al.] \\
Relationships between bent functions and complementary
plateaued functions / Yuliang Zheng and Xian-Mo Zhang
\\
A technique for boosting the security of cryptographic
systems with one-way hash functions / Takeshi Koshiba
\\
Over $F^p$ vs. over $F2^n$ and on Pentium vs. on Alpha
in software implementation of hyperelliptic curve
cryptosystems / Yasuyuki Sakai and Kouichi Sakurai \\
Speeding up elliptic scalar multiplication with
precomputation / Chae Hoon Lim and Hyo Sun Hwang \\
Why hierarchical key distribution is appropriate for
multicast networks / Chandana Gamage, Jussipekka Leiwo,
and Yuliang Zheng \\
Secure selection protocols / Kapali Viswanathan, Colin
Boyd, and Ed Dawson \\
Efficient 3-pass password-based key exchange protocol
with low computational cost for client / Hyoungkyu Lee
\ldots{} [et al.] \\
A 2-pass authentication and key agreement protocol for
mobile communications / Kook-Heui Lee \ldots{} [et al.]
\\
Verifiable secret sharing and time capsules / Josef
Pieprzyk and Eiji Okamoto \\
A new approach to robust threshold RSA signature
schemes / Rei Safavi-Naini, Huaxiong Wang, and Kwok-Yan
Lam \\
On threshold RSA-signing with no dealer / Shingo
Miyazaki, Kouichi Sakurai, and Moti Yung \\
A new approach to efficient verifiable secret sharing
for threshold KCDSA signature / Ho-Sun Yoon and
Heung-Youl Youm \\
A hardware-oriented algorithm for computing in
Jacobians and its implementation for hyperelliptic
curve cryptosystems / Tetsuya Tamura, Kouichi Sakurai,
and Tsutomu Matsumoto \\
A security design for a wide-area distributed system /
Jussipekka Leiwo \ldots{} [et al.] \\
Self-escrowed public-key infrastructures / Pascal
Paillier and Moti Yung \\
Electronic funds transfer protocol using
domain-verifiable signcryption scheme / Moonseog Seo
and Kwangjo Kim",
}
@Proceedings{USENIX:2000:PFSa,
editor = "{USENIX}",
booktitle = "Proceedings of the Fourteenth Systems Administration
Conference {(LISA} {XIV)}, December 3--8, 2000, New
Orleans, Louisiana, {USA}",
title = "Proceedings of the Fourteenth Systems Administration
Conference ({LISA} {XIV}), December 3--8, 2000, New
Orleans, Louisiana, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "vii + 378",
year = "2000",
ISBN = "1-880446-13-8",
ISBN-13 = "978-1-880446-13-3",
LCCN = "????",
bibdate = "Wed Oct 16 05:12:45 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/lisa2000/technical.html",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:2000:PFW,
editor = "USENIX",
booktitle = "Proceedings of the First Workshop on Industrial
Experiences with Systems Software {(WIESS 2000)},
October 22, 2000, Paradise Point Resort, San Diego,
California, {USA}",
title = "Proceedings of the First Workshop on Industrial
Experiences with Systems Software ({WIESS} 2000),
October 22, 2000, Paradise Point Resort, San Diego,
California, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "84",
year = "2000",
ISBN = "1-880446-15-4",
ISBN-13 = "978-1-880446-15-7",
LCCN = "QA76.76.S95 W67 2000",
bibdate = "Wed Oct 16 05:52:48 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/osdi2000/wiess2000/",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:2000:PLI,
editor = "{USENIX}",
booktitle = "Proceedings of the 3rd Large Installation System
Administration of Windows {NT/2000} Conference: August
1--2, 2000, Seattle, Washington, {USA}",
title = "Proceedings of the 3rd Large Installation System
Administration of Windows {NT}/2000 Conference: August
1--2, 2000, Seattle, Washington, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "69",
year = "2000",
ISBN = "1-880446-19-7",
ISBN-13 = "978-1-880446-19-5",
LCCN = "????",
bibdate = "Wed Oct 16 07:17:23 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://db.usenix.org/publications/library/proceedings/lisa-nt2000/",
acknowledgement = ack-nhfb,
keywords = "LISA-NT",
}
@Proceedings{USENIX:2000:PNU,
editor = "{USENIX}",
booktitle = "Proceedings of the Ninth {USENIX} Security Symposium,
August 14--17, 2000, Denver, Colorado",
title = "Proceedings of the Ninth {USENIX} Security Symposium,
August 14--17, 2000, Denver, Colorado",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "275",
year = "2000",
ISBN = "1-880446-18-9",
ISBN-13 = "978-1-880446-18-8",
LCCN = "????",
bibdate = "Wed Oct 16 06:36:41 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec2000",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2001:PAA,
editor = "{ACM}",
booktitle = "{Proceedings of the 33rd Annual ACM Symposium on
Theory of Computing: Hersonissos, Crete, Greece, July
6--8, 2001}",
title = "{Proceedings of the 33rd Annual ACM Symposium on
Theory of Computing: Hersonissos, Crete, Greece, July
6--8, 2001}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xii + 757",
year = "2001",
ISBN = "1-58113-349-9",
ISBN-13 = "978-1-58113-349-3",
LCCN = "QA76.6 .A13 2001",
bibdate = "Wed Feb 20 17:51:33 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib",
note = "ACM order number 508010.",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2001:SHP,
editor = "{ACM}",
booktitle = "{SC2001}: High Performance Networking and Computing.
Denver, {CO}, November 10--16, 2001",
title = "{SC2001}: High Performance Networking and Computing.
Denver, {CO}, November 10--16, 2001",
publisher = pub-ACM # " and " # pub-IEEE,
address = pub-ACM:adr # " and " # pub-IEEE:adr,
pages = "????",
year = "2001",
ISBN = "1-58113-293-X",
ISBN-13 = "978-1-58113-293-9",
LCCN = "????",
bibdate = "Thu Feb 21 18:29:36 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Alster:2001:PKC,
editor = "Kazimierz Alster and Jerzy Urbanowicz and Hugh C.
Williams",
booktitle = "Public-key cryptography and computational number
theory: proceedings of the international conference
organized by the Stefan Banach International
Mathematical Center, Warsaw, Poland, September 11-15,
2000",
title = "Public-key cryptography and computational number
theory: proceedings of the international conference
organized by the Stefan Banach International
Mathematical Center, Warsaw, Poland, September 11-15,
2000",
publisher = pub-GRUYTER,
address = pub-GRUYTER:adr,
pages = "xii + 331",
year = "2001",
ISBN = "3-11-017046-9 (cloth)",
ISBN-13 = "978-3-11-017046-7 (cloth)",
LCCN = "QA268 .P83 2001",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; public key cryptography
--- congresses",
}
@Proceedings{Apers:2001:PTS,
editor = "Peter M. G. Apers and Paolo Atzeni and Stefano Ceri
and Stefano Paraboschi and Kotagiri Ramamohanarao and
Richard T. Snodgrass",
booktitle = "Proceedings of the Twenty-seventh International
Conference on Very Large Data Bases: Roma, Italy,
11--14th September, 2001",
title = "Proceedings of the Twenty-seventh International
Conference on Very Large Data Bases: Roma, Italy,
11--14th September, 2001",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "xviv + 727",
year = "2001",
ISBN = "1-55860-804-4",
ISBN-13 = "978-1-55860-804-7",
LCCN = "QA76.9.D3 I559 2001",
bibsource = "DBLP; http://dblp.uni-trier.de;
http://www.dia.uniroma3.it/vldb2001/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Attali:2001:JSC,
editor = "Isabelle Attali and Thomas Jensen",
booktitle = "{Java on smart cards: programming and security: first
international workshop, JavaCard 2000, Cannes, France,
September 14, 2000: revised papers}",
title = "{Java on smart cards: programming and security: first
international workshop, JavaCard 2000, Cannes, France,
September 14, 2000: revised papers}",
volume = "2041",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 162",
year = "2001",
ISBN = "3-540-42167-X (paperback)",
ISBN-13 = "978-3-540-42167-2 (paperback)",
LCCN = "QA76.73.J38 J3635 2000; QA267.A1 L43 no.2041",
bibdate = "Mon May 6 06:26:30 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2041.htm",
acknowledgement = ack-nhfb,
keywords = "electronic texts; Java (computer program language);
online resources",
}
@Proceedings{Attali:2001:SCP,
editor = "Isabelle Attali and Thomas Jensen",
booktitle = "Smart card programming and security: International
Conference on Research in Smart Cards, {E}-smart 2001,
Cannes, France, {September19-21}, 2001: proceedings",
title = "Smart card programming and security: International
Conference on Research in Smart Cards, {E}-smart 2001,
Cannes, France, {September19-21}, 2001: proceedings",
volume = "2140",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 254",
year = "2001",
ISBN = "3-540-42610-8 (paperback)",
ISBN-13 = "978-3-540-42610-3 (paperback)",
LCCN = "TK7895.S62 I54 2001",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2140.htm",
acknowledgement = ack-nhfb,
keywords = "Java (computer program language); smart cards",
}
@Proceedings{Bigun:2001:AVB,
editor = "Josef Bigun and Fabrizio Smeraldi",
booktitle = "{Audio-and video-based biometric person
authentication: Third International Conference, AVBPA
2001, Halmstad, Sweden, June 6--8, 2001: Proceedings}",
title = "{Audio-and video-based biometric person
authentication: Third International Conference, AVBPA
2001, Halmstad, Sweden, June 6--8, 2001: Proceedings}",
volume = "2091",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 374",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-42216-1 (paperback)",
ISBN-13 = "978-3-540-42216-7 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.S65 .A944 2001; QA267.A1 L43 no.2091",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2091.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2091",
acknowledgement = ack-nhfb,
keywords = "automatic speech recognition --- congresses; biometry
--- congresses; optical pattern recognition --
congresses",
}
@Book{Bouwmeester:2001:PQI,
editor = "Dirk Bouwmeester and Artur Ekert and Anton Zeilinger",
booktitle = "The physics of quantum information: Quantum
cryptography, quantum teleportation, quantum
computation",
title = "The physics of quantum information: Quantum
cryptography, quantum teleportation, quantum
computation",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 314",
year = "2001",
ISBN = "3-540-66778-4",
ISBN-13 = "978-3-540-66778-0",
LCCN = "QA76.889 .P47 2000",
bibdate = "Sat Nov 5 08:49:29 MDT 2011",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/shps-b.bib",
series = "Physics and astronomy online library",
acknowledgement = ack-nhfb,
}
@Proceedings{Boyd:2001:ACA,
editor = "Colin Boyd",
booktitle = "Advances in cryptology --- {ASIACRYPT} 2001: 7th
International Conference on the Theory and Application
of Cryptology and Information Security, Gold Coast,
Australia, December 9--13, 2001: proceedings",
title = "Advances in cryptology --- {ASIACRYPT} 2001: 7th
International Conference on the Theory and Application
of Cryptology and Information Security, Gold Coast,
Australia, December 9--13, 2001: proceedings",
volume = "2248",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 601",
year = "2001",
ISBN = "3-540-42987-5 (paperback)",
ISBN-13 = "978-3-540-42987-6 (paperback)",
LCCN = "QA76.9.A25 I555 2001",
bibdate = "Wed Feb 13 17:10:50 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2248.htm",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Burgess:2001:ISC,
editor = "N. Burgess and L. Ciminiera",
booktitle = "{15th IEEE Symposium on Computer Arithmetic: ARITH-15
2001: proceedings: Vail, Colorado, 11--13 June, 2001}",
title = "{15th IEEE Symposium on Computer Arithmetic: ARITH-15
2001: proceedings: Vail, Colorado, 11--13 June, 2001}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 285",
year = "2001",
ISBN = "0-7695-1150-3; 0-7695-1152-X",
ISBN-13 = "978-0-7695-1150-4; 978-0-7695-1152-8",
ISSN = "1063-6889",
LCCN = "QA76.9.C62 S95 2001",
bibdate = "Fri May 03 14:20:49 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib",
note = "IEEE order no. PR01150.",
price = "US\$145",
acknowledgement = ack-nhfb,
keywords = "ARITH-15",
xxnote = "Check dates: 11--13 or 11--17??",
xxtitle = "Computer Arithmetic: Papers presented at the {15th
IEEE Symposium on Computer Arithmetic (Arith-15 2001),
11--17 June, 2001, Vail, CO}",
}
@Proceedings{Christianson:2001:SPI,
editor = "Bruce Christianson",
booktitle = "{Security protocols: 8th International Workshop,
Cambridge, UK, April 3--5, 2000: Revised Papers}",
title = "{Security protocols: 8th International Workshop,
Cambridge, UK, April 3--5, 2000: Revised Papers}",
volume = "2133",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 255",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-42566-7 (softcover)",
ISBN-13 = "978-3-540-42566-3 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.2133",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2133.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2133",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; cryptography --- congresses",
}
@Proceedings{Eloff:2001:AIS,
editor = "Jan H. P. Eloff and Les Labuschagne and Rossouw von
Solms",
booktitle = "Advances in Information Security Management and Small
Systems Security: {IFIP TC11 WG11.1\slash WG11.2}
Eighth Annual Working Conference on Information
Security Management and Small Systems Security,
September 27--28, 2001, Las Vegas, Nevada, {USA}",
title = "Advances in Information Security Management and Small
Systems Security: {IFIP TC11 WG11.1\slash WG11.2}
Eighth Annual Working Conference on Information
Security Management and Small Systems Security,
September 27--28, 2001, Las Vegas, Nevada, {USA}",
volume = "72",
publisher = pub-KLUWER,
address = pub-KLUWER:adr,
pages = "232",
year = "2001",
ISBN = "0-7923-7506-8",
ISBN-13 = "978-0-7923-7506-7",
LCCN = "QA76.9.A25 I465 2001",
bibdate = "Wed Jan 16 09:32:38 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 97.00",
series = "International Federation for Information Processing",
acknowledgement = ack-nhfb,
keywords = "computer security --- management congresses",
}
@Proceedings{Frankel:2001:FCI,
editor = "Yair Frankel",
booktitle = "{Financial cryptography: 4th International Conference,
FC 2000, Anguilla, British West Indies, February
20--24, 2000: Proceedings}",
title = "{Financial cryptography: 4th International Conference,
FC 2000, Anguilla, British West Indies, February
20--24, 2000: Proceedings}",
volume = "1962",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 378",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-42700-7 (softcover)",
ISBN-13 = "978-3-540-42700-1 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.1962; HG1710 .F35 2000",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t1962.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1962",
acknowledgement = ack-nhfb,
keywords = "computer networks --- security measures ---
congresses; data encryption (computer science) ---
congresses; electronic commerce --- security measures
congresses; electronic funds transfers --- security
measures --- congresses; Internet --- security measures
--- congresses",
}
@Book{Hinsley:2001:CIS,
editor = "F. H. (Francis Harry) Hinsley and Alan Stripp",
booktitle = "Codebreakers: the inside story of {Bletchley Park}",
title = "Codebreakers: the inside story of {Bletchley Park}",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "xxi + 321 + 8",
year = "2001",
ISBN = "0-19-280132-5",
ISBN-13 = "978-0-19-280132-6",
LCCN = "D810.C88 C63 2001",
bibdate = "Thu Dec 28 09:44:08 MST 2017",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
remark = "Originally published: 1993. Includes indexes.",
subject = "World War, 1939--1945; Cryptography; Secret service;
Great Britain; Electronic intelligence; Personal
narratives, British; Cryptography; Electronic
intelligence; Secret service; Bletchley Park (Milton
Keynes, England); History; England; Milton Keynes;
Bletchley Park",
tableofcontents = "Introduction : The influence of Ultra in the Second
World War / F. H. Hinsley \\
The production of Ultra intelligence: Life in and out
of Hut 3 / William Millward \\
The duty officer, Hut 3 / Ralph Bennett \\
A naval officer in Hut 3 / Edward Thomas \\
The Z Watch in Hut 4, part I / Alec Dakin \\
The Z Watch in Hut 4, part II / Walter Eytan \\
Italian naval decrypts / Patrick Wilkinson \\
Naval Section VI / Vivienne Alford \\
Anglo-American signals intelligence co-operation /
Telford Taylor \\
An American at Bletchley Park / Robert M. Slusser \\
Bletchley Park, the Admiralty, and naval Enigma / F. H.
Hinsley \\
Enigma: The Enigma machine : its mechanism and use /
Alan Stripp \\
Hut 6 : early days / Stuart Milner-Barry \\
Hut 6 : 1941--1945 / Derek Taunt \\
Hut 8 and naval Enigma, part I / Joan Murray \\
Hut 8 and naval Enigma, part II / Rolf Noskwith \\
The Abwehr Enigma / Peter Twinn \\
The bombers / Diana Payne \\
Fish: An introduction to Fish / F. H. Hinsley \\
Enigma and Fish / Jack Good \\
The Tunny machine / Ken Halton \\
Operation Tunny / Gil Hayward \\
Field ciphers and tactical codes: Recollections of
Bletchley Park, France, and Cairo / Henry Dryden \\
Army Ultra's poor relations / Noel Currer-Briggs \\
Navy Ultra's poor relations / Christopher Morris \\
Tactical signals of the German Air Force / Peter Gray
Lucas \\
Japanese codes: Japanese naval codes / Michael Loewe
\\
Bedford--Bletchley--Kilindini--Colombo / Hugh Denham
\\
Japanese military codes / Maurice Wiles \\
Japanese Army Air Force codes at Bletchley Park and
Delhi / Alan Stripp \\
Recollections of temps perdu at Bletchley Park / Carmen
Blacker \\
Appendix: how the Bletchley Park buildings took shape /
Bob Watson",
}
@Proceedings{Honary:2001:CCI,
editor = "Bahram Honary",
booktitle = "Cryptography and coding: 8th {IMA} international
conference, Cirencester, {UK}, December 17--19, 2001:
proceedings",
title = "Cryptography and coding: 8th {IMA} international
conference, Cirencester, {UK}, December 17--19, 2001:
proceedings",
volume = "2260",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 416",
year = "2001",
ISBN = "3-540-43026-1",
ISBN-13 = "978-3-540-43026-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA268 .C76 2001",
bibdate = "Wed Feb 13 12:10:46 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2260.htm",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; cryptography ---
congresses",
}
@Proceedings{IEEE:2001:EIW,
editor = "IEEE",
booktitle = "{Eighth IEEE Workshop on Hot Topics in Operating
Systems (HotOS-VIII). May 20--23, 2001, Schloss Elmau,
Germany}",
title = "{Eighth IEEE Workshop on Hot Topics in Operating
Systems (HotOS-VIII). May 20--23, 2001, Schloss Elmau,
Germany}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
year = "2001",
ISBN = "0-7695-1040-X",
ISBN-13 = "978-0-7695-1040-8",
bibdate = "Mon May 28 08:55:24 2001",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
note = "IEEE catalog number PR01040.",
price = "US\$135.00",
URL = "http://computer.org/CSPRESS/CATALOG/pr01040.htm",
}
@Proceedings{IEEE:2001:ISF,
editor = "{IEEE}",
booktitle = "{42nd IEEE Symposium on Foundations of Computer
Science: proceedings: October 14--17, 2001, Las Vegas,
Nevada, USA}",
title = "{42nd IEEE Symposium on Foundations of Computer
Science: proceedings: October 14--17, 2001, Las Vegas,
Nevada, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiii + 670",
year = "2001",
CODEN = "ASFPDV",
ISBN = "0-7695-1390-5, 0-7695-1391-3 (case), 0-7695-1392-1
(microfiche)",
ISBN-13 = "978-0-7695-1390-4, 978-0-7695-1391-1 (case),
978-0-7695-1392-8 (microfiche)",
ISSN = "0272-5428",
LCCN = "????",
bibdate = "Thu Feb 21 19:19:40 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Kilian:2001:ACC,
editor = "Joe Kilian",
booktitle = "Advances in cryptology --- {CRYPTO} 2001: 21st Annual
International Cryptology Conference, Santa Barbara,
California, {USA}, August 19--23, 2001: proceedings",
title = "Advances in cryptology --- {CRYPTO} 2001: 21st Annual
International Cryptology Conference, Santa Barbara,
California, {USA}, August 19--23, 2001: proceedings",
volume = "2139",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 598",
year = "2001",
ISBN = "3-540-42456-3 (paperback)",
ISBN-13 = "978-3-540-42456-7 (paperback)",
LCCN = "QA76.9.A25 C79 2001; QA267.A1 L43 no.2139",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
price = "UK\pounds 47.00",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2139.htm",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Kim:2001:PKC,
editor = "Kwangjo Kim",
booktitle = "{Public key cryptography: 4th International Workshop
on Practice and Theory in Public Key Cryptosystems, PKC
2001, Cheju Island, Korea, February 13--15, 2001:
Proceedings}",
title = "{Public key cryptography: 4th International Workshop
on Practice and Theory in Public Key Cryptosystems, PKC
2001, Cheju Island, Korea, February 13--15, 2001:
Proceedings}",
volume = "1992",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 421",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-41658-7 (softcover)",
ISBN-13 = "978-3-540-41658-6 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I567 2001; QA267.A1 L43 no.1992",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t1992.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1992",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; data encryption (computer
science) --- congresses; public key cryptography ---
congresses",
}
@Proceedings{Koc:2001:CHEa,
editor = "{\c{C}}etin K. Ko{\c{c}} and Christof Paar",
booktitle = "{Cryptographic hardware and embedded systems --- CHES
2000: Second International Workshop, Worcester, MA,
USA, August 17--18, 2000: Proceedings}",
title = "{Cryptographic hardware and embedded systems --- CHES
2000: Second International Workshop, Worcester, MA,
USA, August 17--18, 2000: Proceedings}",
volume = "1965",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 354",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-41455-X (softcover)",
ISBN-13 = "978-3-540-41455-1 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7895.E42 C454 2000",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t1965.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1965",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography --
congresses; embedded computer systems --- congresses",
}
@Proceedings{Koc:2001:CHEb,
editor = "{\c{C}}etin K. Ko{\c{c}} and David Naccache and
Christof Paar",
booktitle = "{Cryptographic hardware and embedded systems --- CHES
2001: Third International Workshop, Paris, France, May
14--16, 2001: Proceedings}",
title = "{Cryptographic hardware and embedded systems --- CHES
2001: Third International Workshop, Paris, France, May
14--16, 2001: Proceedings}",
volume = "2162",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 410",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-42521-7",
ISBN-13 = "978-3-540-42521-2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7895.E42 C454 2001; QA267.A1 L43 no.2162",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS # " and " # ser-LNAI,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2162.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2162",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography --
congresses; embedded computer systems --- congresses",
}
@Proceedings{Naccache:2001:TCC,
editor = "David Naccache",
booktitle = "{Topics in cryptology, CT-RSA 2001: the
Cryptographers' Track at RSA Conference 2001, San
Francisco, CA, USA, April 8--12, 2001: Proceedings}",
title = "{Topics in cryptology, CT-RSA 2001: the
Cryptographers' Track at RSA Conference 2001, San
Francisco, CA, USA, April 8--12, 2001: Proceedings}",
volume = "2020",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 471",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-41898-9 (paperback)",
ISBN-13 = "978-3-540-41898-6 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no.2020; QA76.9.A25 R753 2001",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2020.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2020",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Pfitzmann:2001:ACE,
editor = "Birgit Pfitzmann",
booktitle = "Advances in cryptology: {EUROCRYPT} 2001:
International Conference on the Theory and Application
of Cryptographic Techniques, Innsbruck, Austria, May
6--10, 2001: proceedings",
title = "Advances in cryptology: {EUROCRYPT} 2001:
International Conference on the Theory and Application
of Cryptographic Techniques, Innsbruck, Austria, May
6--10, 2001: proceedings",
volume = "2045",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 544",
day = "25",
month = apr,
year = "2001",
ISBN = "3-540-42070-3",
ISBN-13 = "978-3-540-42070-5",
LCCN = "QA76.9.A25 E964 2001; QA76.9.A25 E96 2001",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2045.htm;
http://link.springer.de/link/service/series/0558/tocs/t2045.htm",
acknowledgement = ack-nhfb,
keywords = "cryptography --- congresses; data encryption (computer
science) --- congresses",
}
@Proceedings{Rangan:2001:PCI,
editor = "C. Pandu Rangan and C. Ding",
booktitle = "Progress in cryptology: {INDOCRYPT} 2001: Second
International Conference on Cryptology in India,
Chennai, India, December 16--20, 2001: proceedings",
title = "Progress in cryptology: {INDOCRYPT} 2001: Second
International Conference on Cryptology in India,
Chennai, India, December 16--20, 2001: proceedings",
volume = "2247",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 349",
year = "2001",
ISBN = "3-540-43010-5",
ISBN-13 = "978-3-540-43010-0",
LCCN = "QA76.9.A25 I5535 2001",
bibdate = "Thu Jan 17 16:49:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2247.htm",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Schmalz:2001:MDI,
editor = "Mark S. Schmalz",
booktitle = "{Mathematics of data\slash image coding, compression,
and encryption IV, with applications: 30--31 July,
2001, San Diego, [California] USA}",
title = "{Mathematics of data\slash image coding, compression,
and encryption IV, with applications: 30--31 July,
2001, San Diego, [California] USA}",
volume = "4475",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "ix + 286",
year = "2001",
ISBN = "0-8194-4189-9",
ISBN-13 = "978-0-8194-4189-8",
LCCN = "TA1637 .M375 2001",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Previous conference has title: Mathematics and
applications of data/image coding, compression, and
encryption III",
series = "SPIE proceedings series",
acknowledgement = ack-nhfb,
keywords = "data encryption (computer science) --- congresses;
image compression --- congresses; image processing ---
digital techniques --- congresses; image processing ---
mathematics --- congresses",
}
@Proceedings{Schneier:2001:FSE,
editor = "Bruce Schneier",
booktitle = "{Fast software encryption: 7th International Workshop,
FSE 2000, New York, NY, USA, April 10--12, 2000:
Proceedings}",
title = "{Fast software encryption: 7th International Workshop,
FSE 2000, New York, NY, USA, April 10--12, 2000:
Proceedings}",
volume = "1978",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 313",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-41728-1",
ISBN-13 = "978-3-540-41728-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA267.A1 L43 no. 1978",
bibdate = "Wed Jan 16 10:50:16 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t1978.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1978",
acknowledgement = ack-nhfb,
}
@Proceedings{Silverman:2001:CLI,
editor = "Joseph H. Silverman",
booktitle = "{Cryptography and lattices: International Conference,
CaLC 2001, Providence RI, USA, March 29--30, 2001:
Revised Papers}",
title = "{Cryptography and lattices: International Conference,
CaLC 2001, Providence RI, USA, March 29--30, 2001:
Revised Papers}",
volume = "2146",
publisher = pub-SV,
address = pub-SV:adr,
pages = "vi + 217",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-42488-1 (paperback)",
ISBN-13 = "978-3-540-42488-8 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA268 .C35 2001; QA267.A1 L43 no.2146",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS # " and " # ser-LNAI,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2146.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2146",
acknowledgement = ack-nhfb,
keywords = "coding theory --- congresses; cryptography ---
congresses; lattice theory --- congresses",
}
@Proceedings{Stinson:2001:SAC,
editor = "Douglas R. Stinson and Stafford Tavares",
booktitle = "Selected areas in cryptography: 7th annual
international workshop, {SAC} 2000, Waterloo, Ontario,
Canada, August 14--15, 2000: proceedings",
title = "Selected areas in cryptography: 7th annual
international workshop, {SAC} 2000, Waterloo, Ontario,
Canada, August 14--15, 2000: proceedings",
volume = "2012",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 338",
year = "2001",
ISBN = "3-540-42069-X (paperback)",
ISBN-13 = "978-3-540-42069-9 (paperback)",
LCCN = "QA76.9.A25 S22 2000; QA267.A1 L43 no.2012",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2012.htm",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; data encryption
(computer science) --- congresses",
}
@Proceedings{Tian:2001:ICE,
editor = "Jun Tian and Tieniu Tan and Liangpei Zhang",
booktitle = "Image compression and encryption technologies: {22--24
October 2001, Wuhan, China}",
title = "Image compression and encryption technologies: {22--24
October 2001, Wuhan, China}",
volume = "4551",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "xii + 284",
year = "2001",
ISBN = "0-8194-4279-8",
ISBN-13 = "978-0-8194-4279-6",
LCCN = "TK5105.59 .I43 2001",
bibdate = "Thu Apr 4 08:00:09 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "SPIE proceedings series",
acknowledgement = ack-nhfb,
keywords = "computer networks --- security measures ---
congresses; data encryption (computer science) ---
congresses; image compression --- congresses",
}
@Proceedings{USENIX:2001:PFT,
editor = "{USENIX}",
booktitle = "Proceedings of the {FREENIX} Track: 2001 {USENIX}
Annual Technical Conference: June 25--30, 2001,
Marriott Copley Place Hotel, Boston, Massachusetts,
{USA}",
title = "Proceedings of the {FREENIX} Track: 2001 {USENIX}
Annual Technical Conference: June 25--30, 2001,
Marriott Copley Place Hotel, Boston, Massachusetts,
{USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "346",
year = "2001",
ISBN = "1-880446-10-3",
ISBN-13 = "978-1-880446-10-2",
LCCN = "QA76.8.U65 U84 2001",
bibdate = "Mon Oct 14 07:43:52 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix01/freenix01/technical.html",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:2001:PTU,
editor = "{USENIX}",
booktitle = "Proceedings of the Tenth {USENIX} Security Symposium,
August 13--17, 2001, Washington, {DC}, {USA}",
title = "Proceedings of the Tenth {USENIX} Security Symposium,
August 13--17, 2001, Washington, {DC}, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "363",
year = "2001",
ISBN = "1-880446-18-9, 1-880446-07-3",
ISBN-13 = "978-1-880446-18-8, 978-1-880446-07-2",
LCCN = "QA76.9.A25 U565 2001",
bibdate = "Tue Oct 15 16:46:48 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec01/technical.html",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:2001:PUA,
editor = "{USENIX}",
booktitle = "Proceedings of the 2001 {USENIX} Annual Technical
Conference: June 25--30, 2001, Marriott Copley Place
Hotel, Boston, Massachusetts, {USA}",
title = "Proceedings of the 2001 {USENIX} Annual Technical
Conference: June 25--30, 2001, Marriott Copley Place
Hotel, Boston, Massachusetts, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "346",
year = "2001",
ISBN = "1-880446-09-X",
ISBN-13 = "978-1-880446-09-6",
LCCN = "QA76.8.U65 U84 2001",
bibdate = "Mon Oct 14 07:43:52 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix01/technical.html",
acknowledgement = ack-nhfb,
}
@Proceedings{Vaudenay:2001:SAC,
editor = "Serge Vaudenay and Amr M. Youssef",
booktitle = "Selected Areas in Cryptography: 8th Annual
International Workshop, {SAC 2001}, Toronto, Ontario,
Canada, August 16--17, 20001: proceedings",
title = "Selected Areas in Cryptography: 8th Annual
International Workshop, {SAC} 2001, Toronto, Ontario,
Canada, August 16--17, 20001: proceedings",
volume = "2259",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 357",
year = "2001",
ISBN = "3-540-43066-0",
ISBN-13 = "978-3-540-43066-7",
LCCN = "QA76.9.A25 S22 2001",
bibdate = "Fri Mar 08 07:38:18 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Won:2001:ISC,
editor = "Dongho Won",
booktitle = "{Information security and cryptology: ICISC 2000,
Third International Conference, Seoul, Korea, December
8--9, 2000: Proceedings}",
title = "{Information security and cryptology: ICISC 2000,
Third International Conference, Seoul, Korea, December
8--9, 2000: Proceedings}",
volume = "2015",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 260",
year = "2001",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-41782-6 (softcover)",
ISBN-13 = "978-3-540-41782-8 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I32 2000; QA267.A1 L43 no.2015",
bibdate = "Thu Jan 17 11:49:19 MST 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2015.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2015",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{ACM:2002:PTF,
editor = "{ACM}",
booktitle = "Proceedings of the Thiry-Fourth Annual {ACM} Symposium
on Theory of Computing, Montr{\'e}al, Qu{\'e}bec,
Canada, May 19--21, 2002",
title = "Proceedings of the Thiry-Fourth Annual {ACM} Symposium
on Theory of Computing, Montr{\'e}al, Qu{\'e}bec,
Canada, May 19--21, 2002",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xv + 824",
year = "2002",
ISBN = "1-58113-495-9",
ISBN-13 = "978-1-58113-495-7",
LCCN = "QA75.5 .A22 2002",
bibdate = "Tue Jan 13 06:29:11 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "ACM order number 508020.",
acknowledgement = ack-nhfb,
}
@Book{Anonymous:2002:QCQ,
editor = "Anonymous",
booktitle = "Quantum computation and quantum cryptography",
title = "Quantum computation and quantum cryptography",
volume = "34(4)",
publisher = pub-SV,
address = pub-SV:adr,
pages = "309--559",
year = "2002",
CODEN = "ALGOEJ",
ISSN = "0178-4617 (print), 1432-0541 (electronic)",
ISSN-L = "0178-4617",
MRclass = "68-06 (00B15 81P68 94A60)",
MRnumber = "MR1943509",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica;
MathSciNet database",
series = j-ALGORITHMICA,
}
@Proceedings{Bernstein:2002:VPT,
editor = "Philip A. Bernstein and others",
booktitle = "{VLDP 2002}: proceedings of the Twenty-Eighth
International Conference on Very Large Data Bases, Hong
Kong {SAR}, China, 20--23 August 2002",
title = "{VLDP 2002}: proceedings of the Twenty-Eighth
International Conference on Very Large Data Bases, Hong
Kong {SAR}, China, 20--23 August 2002",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "xxvi + 1118",
year = "2002",
ISBN = "1-55860-869-9",
ISBN-13 = "978-1-55860-869-6",
LCCN = "????",
bibdate = "Mon Dec 22 18:37:23 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Bertlmann:2002:QUB,
editor = "Reinhold A. Bertlmann and Anton Zeilinger",
booktitle = "{Quantum [Un]speakables: From Bell to Quantum
Information: Conference in Commemoration of the
Physicist John S. Bell, 10--14 November 2000, Vienna}",
title = "{Quantum [Un]speakables: From Bell to Quantum
Information: Conference in Commemoration of the
Physicist John S. Bell, 10--14 November 2000, Vienna}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xxii + 483",
year = "2002",
ISBN = "3-540-42756-2",
ISBN-13 = "978-3-540-42756-8",
LCCN = "????",
bibdate = "Thu Jun 14 06:22:25 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/schroedinger-erwin.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
subject-dates = "John S. Bell (1928--1990)",
}
@Proceedings{Christianson:2002:SPI,
editor = "Bruce Christianson and Bruno Crispo and James A.
Malcolm and Michael Roe",
booktitle = "{Security Protocols: 9th International Workshop
Cambridge, UK, April 25--27, 2001. Revised Papers}",
title = "{Security Protocols: 9th International Workshop
Cambridge, UK, April 25--27, 2001. Revised Papers}",
volume = "2467",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 238",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-44263-4",
ISBN-13 = "978-3-540-44263-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 S443 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2467.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2467",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; cryptography --- congresses",
xxbooktitle = "{Security protocols: 9th International Workshop,
Cambridge, {UK}, April 25--27, 2001: Revised Papers}",
xxtitle = "{Security protocols: 9th International Workshop,
Cambridge, {UK}, April 25--27, 2001: Revised Papers}",
}
@Proceedings{Daemen:2002:FSE,
editor = "Joan Daemen and Vincent Rijmen",
booktitle = "{Fast software encryption: 9th International Workshop,
FSE 2002, Leuven, Belgium, February 4--6, 2002: Revised
Papers}",
title = "{Fast Software Encryption: 9th International Workshop,
FSE 2002, Leuven, Belgium, February 4--6, 2002. Revised
Papers}",
volume = "2365",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 276",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-44009-7 (softcover)",
ISBN-13 = "978-3-540-44009-3 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 F77 2002b",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2365.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2365",
acknowledgement = ack-nhfb,
keywords = "computers --- access control --- passwords ---
congresses; data encryption (computer science) ---
congresses",
}
@Proceedings{Desmedt:2002:PKC,
editor = "Yvo G. Desmedt",
booktitle = "{Public Key Cryptography---PKC 2003: 6th International
Workshop on Practice and Theory in Public Key
Cryptography Miami, FL, USA, January 6--8, 2003.
Proceedings}",
title = "{Public Key Cryptography---PKC 2003: 6th International
Workshop on Practice and Theory in Public Key
Cryptography Miami, FL, USA, January 6--8, 2003.
Proceedings}",
volume = "2567",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 364",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00324-X (softcover)",
ISBN-13 = "978-3-540-00324-3 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I567 2003",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2567.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2567",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; data encryption (computer
science) --- congresses; public key cryptography ---
congresses",
}
@Proceedings{Franklin:2002:PAS,
editor = "Michael Franklin and Bongki Moon and Anastassia
Ailamaki",
booktitle = "Proceedings of the {ACM} {SIGMOD} International
Conference on Management of Data, June 3--6, 2002,
Madison, {WI}, {USA}",
title = "Proceedings of the {ACM} {SIGMOD} International
Conference on Management of Data, June 3--6, 2002,
Madison, {WI}, {USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 641",
year = "2002",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Fri Oct 31 08:15:18 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "ACM order number 475020.",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2002:PAI,
editor = "{IEEE}",
booktitle = "{Proceedings of the 43rd Annual IEEE Symposium on
Foundations of Computer Science, FOCS 2002, Vancouver,
BC, Canada, 16--19 November 2002}",
title = "{Proceedings of the 43rd Annual IEEE Symposium on
Foundations of Computer Science, FOCS 2002, Vancouver,
BC, Canada, 16--19 November 2002}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xvi + 813",
year = "2002",
CODEN = "ASFPDV",
DOI = "https://doi.org/10.1109/SFCS.2002.1181875",
ISBN = "0-7695-1822-2",
ISBN-13 = "978-0-7695-1822-0",
ISSN = "0272-5428",
LCCN = "QA267",
bibdate = "Fri Jul 15 14:24:23 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "IEEE Computer Society Order Number PR01822",
URL = "http://ieeexplore.ieee.org/iel5/8411/26517/01181875.pdf",
acknowledgement = ack-nhfb,
}
@Proceedings{Kaliski:2002:CHE,
editor = "Burton S. {Kaliski Jr.} and {\c{C}}etin K. Ko{\c{c}}
and Christof Paar",
booktitle = "{Cryptographic Hardware and Embedded Systems---CHES
2002: 4th International Workshop Redwood Shores, CA,
USA, August 13--15, 20. Revised Papers}",
title = "{Cryptographic Hardware and Embedded Systems---CHES
2002: 4th International Workshop Redwood Shores, CA,
USA, August 13--15, 20. Revised Papers}",
volume = "2523",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 609",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00409-2 (softcover)",
ISBN-13 = "978-3-540-00409-7 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7895.E42 C454 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2523.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2523",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses; embedded computer systems --- congresses",
}
@Proceedings{Kim:2002:ISC,
editor = "Kwangjo Kim",
booktitle = "{Information security and cryptology --- ICISC 2001:
4th International Conference, Seoul, Korea, December
6--7, 2001: Proceedings}",
title = "{Information security and cryptology --- ICISC 2001:
4th International Conference, Seoul, Korea, December
6--7, 2001: Proceedings}",
volume = "2288",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 456",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-43319-8 (paperback)",
ISBN-13 = "978-3-540-43319-4 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I32 2001",
bibdate = "Wed Sep 11 11:56:55 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2288.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2288",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography
congresses",
}
@Proceedings{Knudsen:2002:ACE,
editor = "Lars Knudsen",
booktitle = "{Advances in Cryptology---EUROCRYPT 2002:
International Conference on the Theory and Applications
of Cryptographic Techniques, Amsterdam, The
Netherlands, April 28--May 2, 2002. Proceedings}",
title = "{Advances in Cryptology---EUROCRYPT 2002:
International Conference on the Theory and Applications
of Cryptographic Techniques, Amsterdam, The
Netherlands, April 28--May 2, 2002. Proceedings}",
volume = "2332",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 545",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-43553-0 (softcover)",
ISBN-13 = "978-3-540-43553-2 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 E964 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2332.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2332",
acknowledgement = ack-nhfb,
keywords = "computers --- access control --- congresses;
cryptography --- congresses; data transmission systems
--- security measures --- congresses",
}
@Proceedings{Matsui:2002:FSE,
editor = "Mitsuru Matsui",
booktitle = "{Fast software encryption: 8th International Workshop,
FSE 2001, Yokohama, Japan, April 2--4, 2001: Revised
Papers}",
title = "{Fast software encryption: 8th International Workshop,
FSE 2001, Yokohama, Japan, April 2--4, 2001: Revised
Papers}",
volume = "2355",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 350",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-43869-6 (softcover)",
ISBN-13 = "978-3-540-43869-4 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 F77 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2355.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2355",
acknowledgement = ack-nhfb,
keywords = "computers --- access control --- passwords ---
congresses",
}
@Proceedings{Menezes:2002:PCI,
editor = "A. J. (Alfred J.) Menezes and Palash Sarkar",
booktitle = "{Progress in cryptology: INDOCRYPT 2002: Third
International Conference on Cryptology in India,
Hyderabad, India, December 16--18, 2002: Proceedings}",
title = "{Progress in cryptology: INDOCRYPT 2002: Third
International Conference on Cryptology in India,
Hyderabad, India, December 16--18, 2002: Proceedings}",
volume = "2551",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 435",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00263-4 (softcover)",
ISBN-13 = "978-3-540-00263-5 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I5535 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2551.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2551",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Naccache:2002:PKC,
editor = "David Naccache and Pascal Paillier",
booktitle = "{Public key cryptography: 4th [i.e., 5th]
International Workshop on Practice and Theory in Public
Key Cryptosystems, PKC 2002, Paris, France, February
12--14, 2002: Proceedings}",
title = "{Public key cryptography: 4th [i.e., 5th]
International Workshop on Practice and Theory in Public
Key Cryptosystems, PKC 2002, Paris, France, February
12--14, 2002: Proceedings}",
volume = "2274",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 383",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-43168-3",
ISBN-13 = "978-3-540-43168-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I567 2002",
bibdate = "Wed Sep 11 11:56:55 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2274.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2274",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; computers --- access
control --- congresses; data encryption (computer
science) --- congresses; public key cryptography ---
congresses",
}
@Proceedings{Preneel:2002:TCC,
editor = "Bart Preneel",
booktitle = "{Topics in cryptology, CT-RSA 2002: the
Cryptographers' Track at RSA Conference 2002, San Jose,
CA, USA, February 18--22, 2002: Proceedings}",
title = "{Topics in cryptology, CT-RSA 2002: the
Cryptographers' Track at RSA Conference 2002, San Jose,
CA, USA, February 18--22, 2002: Proceedings}",
volume = "2271",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 309",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-43224-8",
ISBN-13 = "978-3-540-43224-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 R753 2002",
bibdate = "Wed Sep 11 11:56:55 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2271.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2271",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Syverson:2002:FCI,
editor = "Paul F. Syverson",
booktitle = "{Financial Cryptography: 5th International Conference,
FC 2001, Grand Cayman, British West Indies, February
19--22, 2001. Proceedings}",
title = "{Financial Cryptography: 5th International Conference,
FC 2001, Grand Cayman, British West Indies, February
19--22, 2001. Proceedings}",
volume = "2339",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 377",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-44079-8 (softcover)",
ISBN-13 = "978-3-540-44079-6 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "HG1710 .F35 2001",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2339.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2339",
acknowledgement = ack-nhfb,
}
@Proceedings{Tistarelli:2002:BAI,
editor = "Massimo Tistarelli and Josef Bigun and Anil K. Jain",
booktitle = "{Biometric authentication: International ECCV 2002
Workshop, Copenhagen, Denmark, June 1, 2002:
Proceedings}",
title = "{Biometric authentication: International ECCV 2002
Workshop, Copenhagen, Denmark, June 1, 2002:
Proceedings}",
volume = "2359",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 372",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-43723-1 (softcover)",
ISBN-13 = "978-3-540-43723-9 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.P3 I568 2002",
bibdate = "Wed Sep 11 11:56:55 MDT 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2359.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2359",
acknowledgement = ack-nhfb,
keywords = "biometric identification congresses; identification --
automation congresses; pattern recognition systems --
congresses",
}
@Proceedings{USENIX:2002:PBF,
editor = "{USENIX}",
booktitle = "Proceedings of {BSDCon 2002}: February 11--14, 2002,
Cathedral Hill Hotel, San Francisco, {CA}",
title = "Proceedings of {BSDCon} 2002: February 11--14, 2002,
Cathedral Hill Hotel, San Francisco, {CA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "viii + 151",
year = "2002",
ISBN = "1-880446-02-2",
ISBN-13 = "978-1-880446-02-7",
LCCN = "QA76.76.O63 B736 2002",
bibdate = "Tue Oct 15 12:45:29 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/bsdcon02/tech.html",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:2002:PFT,
editor = "{USENIX}",
booktitle = "Proceedings of the {FREENIX} Track: 2002 {USENIX}
Annual Technical Conference, June 10--15, 2002,
Monterey, California, {USA}",
title = "Proceedings of the {FREENIX} Track: 2002 {USENIX}
Annual Technical Conference, June 10--15, 2002,
Monterey, California, {USA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "308",
year = "2002",
ISBN = "1-880446-01-4",
ISBN-13 = "978-1-880446-01-0",
LCCN = "QA76.8.U65 P765 2002",
bibdate = "Tue Oct 15 11:36:01 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/usenix2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/usenix02/",
acknowledgement = ack-nhfb,
}
@Proceedings{USENIX:2002:PUS,
editor = "{USENIX}",
booktitle = "Proceedings of the 11th {USENIX} Security Symposium
2002, August 5--9, 2002, San Francisco, {CA}",
title = "Proceedings of the 11th {USENIX} Security Symposium
2002, August 5--9, 2002, San Francisco, {CA}",
publisher = pub-USENIX,
address = pub-USENIX:adr,
pages = "ix + 353",
year = "2002",
ISBN = "1-931971-00-5",
ISBN-13 = "978-1-931971-00-3",
LCCN = "????",
bibdate = "Tue Oct 15 07:55:57 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://www.usenix.org/publications/library/proceedings/sec02/",
acknowledgement = ack-nhfb,
}
@Proceedings{Yung:2002:ACC,
editor = "Moti Yung",
booktitle = "Advances in cryptology --- {CRYPTO 2002}: 22nd Annual
International Cryptology Conference, Santa Barbara,
California, {USA}, August 18--22, 2002: Proceedings",
title = "Advances in cryptology --- {CRYPTO 2002}: 22nd Annual
International Cryptology Conference, Santa Barbara,
California, {USA}, August 18--22, 2002: Proceedings",
volume = "2442",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 626",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-44050-X (paperback)",
ISBN-13 = "978-3-540-44050-5 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 C79 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS # " and " # ser-LNAI,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2442.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2442",
acknowledgement = ack-nhfb,
keywords = "computer security -- congresses; cryptography ---
congresses",
}
@Proceedings{Zheng:2002:ACA,
editor = "Yuliang Zheng",
booktitle = "{Advances in Cryptology---ASIACRYPT 2002: 8th
International Conference on the Theory and Application
of Cryptology and Information Security, Queenstown, New
Zealand, December 1--5, 2002. Proceedings}",
title = "{Advances in Cryptology---ASIACRYPT 2002: 8th
International Conference on the Theory and Application
of Cryptology and Information Security, Queenstown, New
Zealand, December 1--5, 2002. Proceedings}",
volume = "2501",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 578",
year = "2002",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00171-9 (paperback)",
ISBN-13 = "978-3-540-00171-3 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I555 2002",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2501.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2501",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{ACM:2003:PAS,
editor = "{ACM}",
booktitle = "{Proceedings of the 2003 ACM SIGMOD International
Conference on Management of Data 2003, San Diego,
California, June 09--12, 2003}",
title = "{Proceedings of the 2003 ACM SIGMOD International
Conference on Management of Data 2003, San Diego,
California, June 09--12, 2003}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xvi + 687",
year = "2003",
ISBN = "1-58113-634-X",
ISBN-13 = "978-1-58113-634-0",
LCCN = "????",
bibdate = "Fri Oct 31 08:24:52 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2003:PTF,
editor = "{ACM}",
booktitle = "{Proceedings of the Thirty-Fifth ACM Symposium on
Theory of Computing, San Diego, CA, USA, June 9--11,
2003}",
title = "{Proceedings of the Thirty-Fifth ACM Symposium on
Theory of Computing, San Diego, CA, USA, June 9--11,
2003}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xii + 728",
year = "2003",
ISBN = "????",
ISBN-13 = "????",
LCCN = "QA75.5 .A22 2003",
bibdate = "Tue Jan 13 06:29:11 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "ACM order number 508030.",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2003:PTS,
editor = "{ACM}",
booktitle = "{Proceedings of the Twenty-Second ACM
SIGMOD-SIGACT-SIGART Symposium on Principles of
Database Systems: PODS 2003: San Diego, Calif., June
9--11, 2003}",
title = "{Proceedings of the Twenty-Second ACM
SIGMOD-SIGACT-SIGART Symposium on Principles of
Database Systems: PODS 2003: San Diego, Calif., June
9--11, 2003}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "viii + 308",
year = "2003",
ISBN = "1-58113-670-6",
ISBN-13 = "978-1-58113-670-8",
LCCN = "QA76.9.D3 A296 2003",
bibdate = "Fri Oct 31 08:19:07 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "ACM order number 475030",
acknowledgement = ack-nhfb,
}
@Proceedings{Bajard:2003:ISC,
editor = "Jean Claude Bajard and Michael Schulte",
booktitle = "{16th IEEE Symposium on Computer Arithmetic: ARITH-16
2003: proceedings: Santiago de Compostela, Spain, June
15--18, 2003}",
title = "{16th IEEE Symposium on Computer Arithmetic: ARITH-16
2003: proceedings: Santiago de Compostela, Spain, June
15--18, 2003}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2003",
ISBN = "0-7695-1894-X",
ISBN-13 = "978-0-7695-1894-7",
ISSN = "1063-6889",
LCCN = "????",
bibdate = "Sat Jul 20 17:45:12 2002",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "IEEE order no. PR01894.",
URL = "http://www.dec.usc.es/arith16/",
acknowledgement = ack-nhfb,
}
@Proceedings{Biham:2003:ACE,
editor = "Eli Biham",
booktitle = "{Advances in cryptology --- EUROCRYPT 2003:
International Conference on the Theory and Applications
of Cryptographic Techniques, Warsaw, Poland, May 4--8,
2003: Proceedings}",
title = "{Advances in cryptology --- EUROCRYPT 2003:
International Conference on the Theory and Applications
of Cryptographic Techniques, Warsaw, Poland, May 4--8,
2003: Proceedings}",
volume = "2656",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 648",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-14039-5 (paperback)",
ISBN-13 = "978-3-540-14039-9 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 E964 2003",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2656.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2656",
acknowledgement = ack-nhfb,
keywords = "computers --- access control --- congresses;
cryptography --- congresses; data transmission systems
--- security measures --- congresses",
}
@Proceedings{Blaze:2003:FCI,
editor = "Matt Blaze",
booktitle = "{Financial cryptography: 6th International Conference,
FC 2002, Southampton, Bermuda, March 11--14, 2002:
Revised Papers}",
title = "{Financial cryptography: 6th International Conference,
FC 2002, Southampton, Bermuda, March 11--14, 2002:
Revised Papers}",
volume = "2357",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 299",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00646-X (softcover)",
ISBN-13 = "978-3-540-00646-6 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "HG1710 .F35 2002",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2357.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2357",
acknowledgement = ack-nhfb,
keywords = "computer networks --- security measures congresses;
data encryption (computer science) --- congresses;
electronic commerce --- security measures congresses;
electronic funds transfers --- security measures ---
congresses; Internet --- security measures congresses",
}
@Proceedings{Boneh:2003:ACC,
editor = "Dan Boneh",
booktitle = "Advances in {Cryptology---CRYPTO 2003}: 23rd Annual
International Cryptology Conference Santa Barbara,
California, {USA}, August 17--21, 2003 Proceedings",
title = "Advances in Cryptology---{CRYPTO 2003}: 23rd Annual
International Cryptology Conference Santa Barbara,
California, {USA}, August 17--21, 2003 Proceedings",
volume = "2729",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 630",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b11817",
ISBN = "3-540-40674-3",
ISBN-13 = "978-3-540-40674-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 C79 2003",
bibdate = "Thu Nov 18 18:53:10 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2729.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2729;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b11817",
acknowledgement = ack-nhfb,
}
@Proceedings{Cimato:2003:SCN,
editor = "Stelvio Cimato and Clemente Galdi and Guiseppe
Persiano",
booktitle = "{Security in communication networks: Third
International Conference, SCN 2002, Amalfi, Italy,
September 11--13, 2002: Revised Papers}",
title = "{Security in communication networks: Third
International Conference, SCN 2002, Amalfi, Italy,
September 11--13, 2002: Revised Papers}",
volume = "2576",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 363",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00420-3 (softcover)",
ISBN-13 = "978-3-540-00420-2 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK5105.59 .S385 2002",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2576.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2576",
acknowledgement = ack-nhfb,
keywords = "computer networks --- security measures ---
congresses; computer security --- congresses;
cryptography --- congresses",
}
@Proceedings{Freytag:2003:VPI,
editor = "Johann Christoph Freytag and Peter C. Lockemann and
Serge Abiteboul and Michael J. Carey and Patricia G.
Selinger and Andreas Heuer",
booktitle = "{VLDB 2003}: Proceedings of 29th International
Conference on Very Large Data Bases, September 9--12,
2003, Berlin, Germany",
title = "{VLDB 2003}: Proceedings of 29th International
Conference on Very Large Data Bases, September 9--12,
2003, Berlin, Germany",
publisher = pub-MORGAN-KAUFMANN,
address = pub-MORGAN-KAUFMANN:adr,
pages = "1151",
year = "2003",
ISBN = "0-12-722442-4",
ISBN-13 = "978-0-12-722442-8",
LCCN = "????",
bibdate = "Mon Dec 22 18:35:48 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2003:PAI,
editor = "{IEEE}",
booktitle = "{Proceedings: 44th Annual IEEE Symposium on
Foundations of Computer Science, FOCS 2003, 11--14
October 2003, Cambridge, Massachusetts}",
title = "{Proceedings: 44th Annual IEEE Symposium on
Foundations of Computer Science, FOCS 2003, 11--14
October 2003, Cambridge, Massachusetts}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiii + 661",
year = "2003",
CODEN = "ASFPDV",
ISBN = "0-7695-2040-5",
ISBN-13 = "978-0-7695-2040-7",
ISSN = "0272-5428",
LCCN = "QA76 .S979 2003",
bibdate = "Fri Jul 15 14:29:27 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "IEEE Computer Society Order Number PR02040.",
URL = "http://ieeexplore.ieee.org/iel5/8767/27770/01238173.pdf;
http://ieeexplore.ieee.org/xpl/RecentCon.jsp?punumber=8767&conhome=1000292",
acknowledgement = ack-nhfb,
}
@Proceedings{Johansson:2003:FSE,
editor = "Thomas Johansson",
booktitle = "{Fast Software Encryption: 10th International
Workshop, FSE 2003, Lund, Sweden, February 24--26,
2003: Revised Papers}",
title = "{Fast Software Encryption: 10th International
Workshop, FSE 2003, Lund, Sweden, February 24--26,
2003: Revised Papers}",
volume = "2887",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 395",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b93938",
ISBN = "3-540-20449-0",
ISBN-13 = "978-3-540-20449-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 F77 2003",
bibdate = "Tue Nov 16 05:54:34 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2887.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2887;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b93938",
acknowledgement = ack-nhfb,
}
@Proceedings{Johansson:2003:PCI,
editor = "Thomas Johansson and Subhamoy Maitra",
booktitle = "{Progress in Cryptology---INDOCRYPT 2003: 4th
International Conference on Cryptology in India, New
Delhi, India, December 8--10, 2003: Proceedings}",
title = "{Progress in Cryptology---INDOCRYPT 2003: 4th
International Conference on Cryptology in India, New
Delhi, India, December 8--10, 2003: Proceedings}",
volume = "2904",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 429",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b94593",
ISBN = "3-540-20609-4",
ISBN-13 = "978-3-540-20609-5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I5535 2003",
bibdate = "Tue Nov 16 06:03:39 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2904.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2904;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b94593",
acknowledgement = ack-nhfb,
}
@Proceedings{Joye:2003:TCC,
editor = "Marc Joye",
booktitle = "{Topics in cryptology, CT-RSA 2003: the
Cryptographers' Track at the RSA Conference 2003, San
Francisco, CA, USA, April 13--17, 2003: Proceedings}",
title = "{Topics in cryptology, CT-RSA 2003: the
Cryptographers' Track at the RSA Conference 2003, San
Francisco, CA, USA, April 13--17, 2003: Proceedings}",
volume = "2612",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 416",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00847-0",
ISBN-13 = "978-3-540-00847-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 C822 2003",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2612.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2612",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Kittler:2003:AVB,
editor = "Josef Kittler and Mark S. Nixon",
booktitle = "{Audio-and video-based biometric person
authentication: 4th International Conference, AVBPA
2003, Guildford, UK, June 9--11, 2003: Proceedings}",
title = "{Audio-and video-based biometric person
authentication: 4th International Conference, AVBPA
2003, Guildford, UK, June 9--11, 2003: Proceedings}",
volume = "2688",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvii + 978",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-40302-7 (softcover)",
ISBN-13 = "978-3-540-40302-9 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.S65 A944 2003",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2688.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2688",
acknowledgement = ack-nhfb,
keywords = "automatic speech recognition --- congresses; biometric
identification congresses; optical pattern recognition
--- congresses",
}
@Proceedings{Laih:2003:ACA,
editor = "Chi Sung Laih",
booktitle = "{Advances in Cryptology---ASIACRYPT 2003: 9th
International Conference on the Theory and Application
of Cryptology and Information Security, Taipei, Taiwan,
November 30--December 4, 2003: Proceedings}",
title = "{Advances in Cryptology---ASIACRYPT 2003: 9th
International Conference on the Theory and Application
of Cryptology and Information Security, Taipei, Taiwan,
November 30--December 4, 2003: Proceedings}",
volume = "2894",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 542",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b94617",
ISBN = "3-540-20592-6",
ISBN-13 = "978-3-540-20592-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I555 2003",
bibdate = "Tue Nov 16 05:58:33 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2894.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2894;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b94617",
acknowledgement = ack-nhfb,
}
@Proceedings{Lee:2003:ISC,
editor = "Pil Joong Lee and Chae Hoon Lim",
booktitle = "{Information security and cryptology --- ICISC 2002:
5th International Conference, Seoul, Korea, November
28--29, 2002: Revised Papers}",
title = "{Information security and cryptology --- ICISC 2002:
5th International Conference, Seoul, Korea, November
28--29, 2002: Revised Papers}",
volume = "2587",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 536",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00716-4",
ISBN-13 = "978-3-540-00716-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I32 2002",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2587.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2587",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; cryptography ---
congresses",
}
@Proceedings{Nyberg:2003:SAC,
editor = "Kaisa Nyberg and Howard Heys",
booktitle = "{Selected areas in cryptography: 9th annual
International Workshop, SAC 2002, St. John's,
Newfoundland, Canada, August 15--16, 2002: Revised
Papers}",
title = "{Selected areas in cryptography: 9th annual
International Workshop, SAC 2002, St. John's,
Newfoundland, Canada, August 15--16, 2002: Revised
Papers}",
volume = "2595",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 404",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-00622-2",
ISBN-13 = "978-3-540-00622-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 S22 2002",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2595.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2595",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; data encryption
(computer science)",
}
@Proceedings{Paterson:2003:CCI,
editor = "Kenneth G. Paterson",
booktitle = "{Cryptography and Coding: 9th IMA International
Conference, Cirencester, UK, December 16--18, 2003:
Proceedings}",
title = "{Cryptography and Coding: 9th IMA International
Conference, Cirencester, UK, December 16--18, 2003:
Proceedings}",
volume = "2898",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 383",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b93924",
ISBN = "3-540-20663-9",
ISBN-13 = "978-3-540-20663-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA268 .C76 2003",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2898.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2898;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b93924",
acknowledgement = ack-nhfb,
}
@Proceedings{Petitcolas:2003:DWF,
editor = "Fabien A. P. Petitcolas and Hyoung Joong Kim",
booktitle = "{Digital watermarking: First International Workshop,
IWDW 2002, Seoul, Korea, November 21--22, 2002: Revised
Papers}",
title = "{Digital watermarking: First International Workshop,
IWDW 2002, Seoul, Korea, November 21--22, 2002: Revised
Papers}",
volume = "2613",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 263",
year = "2003",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-01217-6 (softcover)",
ISBN-13 = "978-3-540-01217-7 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I939 2002",
bibdate = "Thu Aug 21 09:09:03 MDT 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "Also available via the World Wide Web.",
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2613.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2613",
acknowledgement = ack-nhfb,
keywords = "computer security --- congresses; data protection ---
congresses; digital watermarking congresses",
}
@Proceedings{Schmalz:2003:MDI,
editor = "Mark S. Schmalz and others",
booktitle = "{Mathematics of data/image coding, compression, and
encryption V, with applications: 9--10 July 2002,
Seattle, Washington, USA}",
title = "{Mathematics of data/image coding, compression, and
encryption V, with applications: 9--10 July 2002,
Seattle, Washington, USA}",
volume = "4793",
publisher = "SPIE",
address = "Bellingham, Wash., USA",
pages = "vii + 324",
year = "2003",
ISBN = "0-8194-4560-6",
ISBN-13 = "978-0-8194-4560-5",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TA1637 .M382 2003; TA1637 .M38 2002; TA1637 .M38 2003;
TA1637 .M38 2003eb; TA1637; TS510 .S63; Internet",
bibdate = "Sat Dec 24 08:47:41 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = "SPIE proceedings series",
URL = "http://link.spie.org/PSISDG/4793/1;
http://uclibs.org/PID/39661",
acknowledgement = ack-nhfb,
subject = "Image processing; Mathematics; Congresses; Digital
techniques; Image compression; Data encryption
(Computer science)",
}
@Proceedings{Walter:2003:CHE,
editor = "Colin D. Walter and {\c{C}}etin K. Ko{\c{c}} and
Christof Paar",
booktitle = "Cryptographic Hardware and Embedded {Systems---CHES
2003}: 5th International Workshop, Cologne, Germany,
September 8--10, 2003: Proceedings",
title = "Cryptographic Hardware and Embedded Systems---{CHES
2003}: 5th International Workshop, Cologne, Germany,
September 8--10, 2003: Proceedings",
volume = "2779",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 440",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b13240",
ISBN = "3-540-40833-9",
ISBN-13 = "978-3-540-40833-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7895.E42",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2779.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2779;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b13240",
acknowledgement = ack-nhfb,
}
@Proceedings{Wright:2003:FCI,
editor = "Rebecca N. Wright",
booktitle = "Financial cryptography: {7th International Conference,
FC 2003, Guadeloupe, French West Indies, January
27--30, 2003: revised papers}",
title = "Financial cryptography: {7th International Conference,
FC 2003, Guadeloupe, French West Indies, January
27--30, 2003: revised papers}",
volume = "2742",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 320",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b11831",
ISBN = "3-540-40663-8",
ISBN-13 = "978-3-540-40663-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "HG1710 .F35 2003",
bibdate = "Mon Nov 15 17:53:12 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2742;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b11831",
acknowledgement = ack-nhfb,
meetingname = "FC 2003 (2003: Guadeloupe)",
subject = "Computer networks; Congresses; Data encryption
(Computer science); Electronic funds transfers;
Electronic commerce; Internet; Security measures",
}
@Proceedings{Zhou:2003:ACN,
editor = "Jianying Zhou and Moti Yung and Yongfei Han",
booktitle = "{Applied Cryptography and Network Security: First
Title: International Conference, ACNS 2003, Kunming,
China, October 16--19, 2003: Proceedings}",
title = "{Applied Cryptography and Network Security: First
Title: International Conference, ACNS 2003, Kunming,
China, October 16--19, 2003: Proceedings}",
volume = "2846",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 436",
year = "2003",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b13996",
ISBN = "3-540-20208-0",
ISBN-13 = "978-3-540-20208-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK5102.94 .A28 2003",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2846.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2846;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b13996",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2004:PAA,
editor = "ACM",
booktitle = "{Proceedings of the 36th Annual ACM Symposium on the
Theory of Computing: Chicago, Illinois, USA, June
13--15, 2004}",
title = "{Proceedings of the 36th Annual ACM Symposium on the
Theory of Computing: Chicago, Illinois, USA, June
13--15, 2004}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xvii + 646",
year = "2004",
ISBN = "1-58113-852-0",
ISBN-13 = "978-1-58113-852-8",
LCCN = "QA75.5 .A22 2004",
bibdate = "Wed Apr 5 06:05:06 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
meetingname = "ACM Symposium on Theory of Computing (36th: 2004:
Chicago, Ill.)",
remark = "ACM order number 508040.",
subject = "Electronic digital computers; Congresses; Computer
programming; Computational complexity; Electronic data
processing",
}
@Proceedings{ACM:2004:PAS,
editor = "{ACM}",
booktitle = "Proceedings of the 2004 {ACM} {SIGMOD} International
Conference on Management of Data 2004, Paris, France,
June 13--18, 2004",
title = "Proceedings of the 2004 {ACM} {SIGMOD} International
Conference on Management of Data 2004, Paris, France,
June 13--18, 2004",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xix + 974",
year = "2004",
ISBN = "1-58113-859-8",
ISBN-13 = "978-1-58113-859-7",
LCCN = "QA76.9.D3",
bibdate = "Fri Oct 31 08:24:52 2003",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{Bao:2004:PKC,
editor = "Feng Bao and Robert Deng and Jianying Zhou",
booktitle = "{Public Key Cryptography---PKC 2004: 7th International
Workshop on Practice and Theory in Public Key
Cryptography, Singapore, March 1--4, 2004:
Proceedings}",
title = "{Public Key Cryptography---PKC 2004: 7th International
Workshop on Practice and Theory in Public Key
Cryptography, Singapore, March 1--4, 2004:
Proceedings}",
volume = "2947",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 454",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b95631",
ISBN = "3-540-21018-0",
ISBN-13 = "978-3-540-21018-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I567 2004",
bibdate = "Tue Nov 16 06:43:18 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2947.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2947;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b95631",
acknowledgement = ack-nhfb,
}
@Proceedings{Cachin:2004:ACE,
editor = "Christian Cachin and Jan Camenisch",
booktitle = "{Advances in Cryptology---EUROCRYPT 2004:
International Conference on the Theory and Applications
of Cryptographic Techniques, Interlaken, Switzerland,
May 2--6, 2004: Proceedings}",
title = "{Advances in Cryptology---EUROCRYPT 2004:
International Conference on the Theory and Applications
of Cryptographic Techniques, Interlaken, Switzerland,
May 2--6, 2004: Proceedings}",
volume = "3027",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 628",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b97182",
ISBN = "3-540-21935-8",
ISBN-13 = "978-3-540-21935-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3027.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3027;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b97182",
acknowledgement = ack-nhfb,
}
@Proceedings{Canteaut:2004:PCI,
editor = "Anne Canteaut and Kapaleeswaran Viswanathan",
booktitle = "{Progress in cryptology: INDOCRYPT 2004: 5th
International Conference on Cryptology in India,
Chennai, India, December 20--22, 2004: Proceedings}",
title = "{Progress in cryptology: INDOCRYPT 2004: 5th
International Conference on Cryptology in India,
Chennai, India, December 20--22, 2004: Proceedings}",
volume = "3348",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 429",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b104579",
ISBN = "3-540-24130-2",
ISBN-13 = "978-3-540-24130-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I5535 2004",
bibdate = "Thu Jun 2 09:13:47 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3348;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3348;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b104579",
acknowledgement = ack-nhfb,
meetingname = "International Conference in Cryptology in India (5th:
2004: Chennai, India)",
subject = "Computer security; Congresses; Cryptography;
Congresses",
}
@Book{Copeland:2004:ETS,
editor = "B. Jack Copeland",
booktitle = "The Essential {Turing}: Seminal Writings in Computing,
Logic, Philosophy, Artificial Intelligence, and
Artificial Life, plus The Secrets of {Enigma}",
title = "The Essential {Turing}: Seminal Writings in Computing,
Logic, Philosophy, Artificial Intelligence, and
Artificial Life, plus The Secrets of {Enigma}",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "viii + 613",
year = "2004",
ISBN = "0-19-825079-7 (hardcover), 0-19-825080-0 (paperback)",
ISBN-13 = "978-0-19-825079-1 (hardcover), 978-0-19-825080-7
(paperback)",
LCCN = "QA29.T8 E77 2004",
bibdate = "Sat Nov 19 18:33:05 MST 2005",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/a/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
URL = "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/;
http://www.loc.gov/catdir/toc/fy053/2004275594.html",
acknowledgement = ack-nhfb,
remark = "This useful volumes reprints important Turing papers
and letters, with substantial introductions to each.",
subject = "Cognitive science; Electronic data processing;
Artificial intelligence; Turing, Alan Mathison",
subject-dates = "1912--1954",
tableofcontents = "Alan Turing 1912--1954 / Jack Copeland 1--3 \\
Computable Numbers: A Guide / Jack Copeland 5--57 \\
1. On Computable Numbers, with an Application to the
Entscheidensproblem (1936) 58--90 \\
2. On Computable Numbers: Corrections and Critiques /
Alan Turing, Emil Post, and Donald W. Davies 91--124
\\
3. Systems of Logic Based on Ordinals (1938), including
excerpts of Turing's correspondence, 1936--1938
125--204\\
4. Letters on Logic to Max Newman (c. 1940) 205--216
\\
Enigma / Jack Copeland 217--264 \\
5. History of Hut 8 to December 1941 (1945), featuring
an excerpt from Turing's 'Treatise on the Enigma' /
Patrick Mahon 265--312 \\
6. Bombe and Spider (1940) 313--335 \\
7. Letter to Winston Churchill (1941) 336--340 \\
8. Memorandum to OP-20-G on Naval Enigma (c. 1941)
341--352 \\
Artificial Intelligence / Jack Copeland 353--361 \\
9. Lecture on the Automatic Computing Machine (1947)
362--394 \\
10. Intelligent Machinery (1948) 395--432 \\
11. Computing Machinery and Intelligence (1950)
433--464 \\
12. Intelligent Machinery, A Heretical Theory (c. 1951)
465--475 \\
13. Can Digital Computers Think? 476--486 \\
14. Can Automatic Calculating Machines Be Said to
Think? (1952) / Alan Turing, Richard Braithwaite,
Geoffrey Jefferson, and Max Newman 487--506 \\
Artificial Life / Jack Copeland 517--518 \\
15. The Chemical Basis of Morphogenesis (1952) 519--561
\\
16. Chess (1953) 562--575 \\
17. Solvable and Unsolvable Problems (1954) 576--595",
}
@Proceedings{Franklin:2004:ACC,
editor = "Matt Franklin",
booktitle = "{Advances in Cryptology --- CRYPTO 2004: 24th Annual
International Cryptology Conference, Santa Barbara,
California, USA, August 15--19, 2004. Proceedings}",
title = "{Advances in Cryptology --- CRYPTO 2004: 24th Annual
International Cryptology Conference, Santa Barbara,
California, USA, August 15--19, 2004. Proceedings}",
volume = "3152",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 578",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b99099",
ISBN = "3-540-22668-0",
ISBN-13 = "978-3-540-22668-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "10.1007/b99099",
bibdate = "Sat Jun 04 08:10:04 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3152;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b99099",
acknowledgement = ack-nhfb,
}
@Proceedings{Handschuh:2004:SAC,
editor = "Helena Handschuh and M. Anwar Hasan",
booktitle = "{Selected Areas in Cryptography: 11th international
workshop, SAC 2004, Waterloo, Canada, August 9--10,
2004: Revised selected papers}",
title = "{Selected Areas in Cryptography: 11th international
workshop, SAC 2004, Waterloo, Canada, August 9--10,
2004: Revised selected papers}",
volume = "3357",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 353",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b105103",
ISBN = "3-540-24327-5",
ISBN-13 = "978-3-540-24327-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 S22 2004",
bibdate = "Thu Jun 02 07:52:30 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3357;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b105103",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2004:PAI,
editor = "{IEEE}",
booktitle = "{Proceedings: 45th Annual IEEE Symposium on
Foundations of Computer Science: FOCS 2004, 17--19
October, 2004, Rome, Italy}",
title = "{Proceedings: 45th Annual IEEE Symposium on
Foundations of Computer Science: FOCS 2004, 17--19
October, 2004, Rome, Italy}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 632",
year = "2004",
CODEN = "ASFPDV",
ISBN = "0-7695-2228-9",
ISBN-13 = "978-0-7695-2228-9",
ISSN = "0272-5428",
LCCN = "QA276",
bibdate = "Fri Jul 15 14:47:05 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "IEEE Computer Society Order Number P2228",
URL = "http://ieeexplore.ieee.org/iel5/9430/29918/01366212.pdf;
http://ieeexplore.ieee.org/servlet/opac?punumber=9430",
acknowledgement = ack-nhfb,
subject = "Electronic data processing; Congresses; Machine
theory; Congresses",
}
@Proceedings{Jakobsson:2004:ACN,
editor = "Markus Jakobsson and Moti Yung and Jianying Zhou",
booktitle = "{Applied Cryptography and Network Security: Second
International Conference, ACNS 2004, Yellow Mountain,
China, June 8--11, 2004: Proceedings}",
title = "{Applied Cryptography and Network Security: Second
International Conference, ACNS 2004, Yellow Mountain,
China, June 8--11, 2004: Proceedings}",
volume = "3089",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 510",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b98360",
ISBN = "3-540-22217-0",
ISBN-13 = "978-3-540-22217-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK5102.94 .A28 2004",
bibdate = "Tue Nov 16 08:24:05 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3089.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3089;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b98360",
acknowledgement = ack-nhfb,
}
@Proceedings{Joye:2004:CHE,
editor = "Marc Joye and Jean-Jacques Quisquater",
booktitle = "{Cryptographic Hardware and Embedded Systems---CHES
2004: 6th International Workshop Cambridge, MA, USA,
August 11--13, 2004. Proceedings}",
title = "{Cryptographic Hardware and Embedded Systems---CHES
2004: 6th International Workshop Cambridge, MA, USA,
August 11--13, 2004. Proceedings}",
volume = "3156",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 454",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b99451",
ISBN = "3-540-22666-4",
ISBN-13 = "978-3-540-22666-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3156.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3156;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b99451",
acknowledgement = ack-nhfb,
}
@Proceedings{Juels:2004:FCI,
editor = "Ari Juels",
booktitle = "{Financial Cryptography: 8th International Conference,
FC 2004, Key West, FL, USA, February 9--12, 2004:
Revised Papers}",
title = "{Financial Cryptography: 8th International Conference,
FC 2004, Key West, FL, USA, February 9--12, 2004:
Revised Papers}",
volume = "3110",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 280",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b98935",
ISBN = "3-540-22420-3",
ISBN-13 = "978-3-540-22420-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "HG1710 .F35 2004",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3110.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3110;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b98935",
acknowledgement = ack-nhfb,
}
@Proceedings{Kalker:2004:DWS,
editor = "Ton Kalker and Ingemar J. Cox and Yong Man Ro",
booktitle = "{Digital Watermarking: Second International Workshop,
IWDW 2003, Seoul, Korea, October 20--22, 2003: Revised
Papers}",
title = "{Digital Watermarking: Second International Workshop,
IWDW 2003, Seoul, Korea, October 20--22, 2003: Revised
Papers}",
volume = "2939",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 602",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b95658",
ISBN = "3-540-21061-X",
ISBN-13 = "978-3-540-21061-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I89 2003",
bibdate = "Tue Nov 16 06:35:48 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2939.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2939;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b95658",
acknowledgement = ack-nhfb,
}
@Proceedings{Katsikas:2004:PKI,
editor = "Sokratis K. Katsikas and Stefanos Gritzalis and Javier
Lopez",
booktitle = "{Public Key Infrastructure: First European PKI
Workshop: Research and Applications, EuroPKI 2004,
Samos Island, Greece, June 25--26, 2004: Proceedings}",
title = "{Public Key Infrastructure: First European PKI
Workshop: Research and Applications, EuroPKI 2004,
Samos Island, Greece, June 25--26, 2004: Proceedings}",
volume = "3093",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 380",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b98201",
ISBN = "3-540-22216-2",
ISBN-13 = "978-3-540-22216-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 E973 2004",
bibdate = "Tue Nov 16 08:26:16 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3093.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3093;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b98201",
acknowledgement = ack-nhfb,
}
@Proceedings{Lee:2004:ACA,
editor = "Pil Joong Lee",
booktitle = "{Advances in cryptology, ASIACRYPT 2004: 10th
International Conference on the Theory and Application
of Cryptology and Information Security, Jeju Island,
Korea, December 5--9, 2004: Proceedings}",
title = "{Advances in cryptology, ASIACRYPT 2004: 10th
International Conference on the Theory and Application
of Cryptology and Information Security, Jeju Island,
Korea, December 5--9, 2004: Proceedings}",
volume = "3329",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvi + 546",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b104116",
ISBN = "3-540-23975-8 (paperback)",
ISBN-13 = "978-3-540-23975-8 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I555 2004; QA75.5 .L48 no. 3329",
bibdate = "Thu Jun 2 09:13:35 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3329;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b104116",
acknowledgement = ack-nhfb,
meetingname = "International Conference on the Theory and Application
of Cryptology and Information Security (10th: 2004:
Jeju Island, Korea)",
subject = "Computer security; Congresses; Cryptography;
Congresses",
}
@Proceedings{Li:2004:ABP,
editor = "Stan Z. Li and Jianhuang Lai and Tieniu Tan and Guocan
Feng and Yunhong Wang",
booktitle = "{Advances in Biometric Person Authentication: 5th
Chinese Conference on Biometric Recognition,
SINOBIOMETRICS 2004, Guangzhou, China, December 13--14,
2004: Proceedings}",
title = "{Advances in Biometric Person Authentication: 5th
Chinese Conference on Biometric Recognition,
SINOBIOMETRICS 2004, Guangzhou, China, December 13--14,
2004: Proceedings}",
volume = "3338",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 699",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b104239",
ISBN = "3-540-24029-2",
ISBN-13 = "978-3-540-24029-7",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.B56 C4 2004",
bibdate = "Thu Jun 02 07:52:30 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3338;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b104239",
acknowledgement = ack-nhfb,
}
@Proceedings{Lim:2004:ISC,
editor = "Jong In Lim and Dong Hoon Lee",
booktitle = "{Information Security and Cryptology---ICISC 2003: 6th
International Conference, Seoul, Korea, November
27--28, 2003: Revised Papers}",
title = "{Information Security and Cryptology---ICISC 2003: 6th
International Conference, Seoul, Korea, November
27--28, 2003: Revised Papers}",
volume = "2971",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 458",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b96249",
ISBN = "3-540-21376-7",
ISBN-13 = "978-3-540-21376-5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2971.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2971;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b96249",
acknowledgement = ack-nhfb,
}
@Proceedings{Maltoni:2004:BAE,
editor = "Davide Maltoni and Anil K. Jain",
booktitle = "{Biometric Authentication: ECCV 2004 International
Workshop, BioAW 2004, Prague, Czech Republic, May 15th,
2004: Proceedings}",
title = "{Biometric Authentication: ECCV 2004 International
Workshop, BioAW 2004, Prague, Czech Republic, May 15th,
2004: Proceedings}",
volume = "3087",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 341",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b99174",
ISBN = "3-540-22499-8",
ISBN-13 = "978-3-540-22499-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.P3E27 2004",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3087.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3087;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b99174",
acknowledgement = ack-nhfb,
}
@Proceedings{Matsui:2004:SAC,
editor = "Mitsuru Matsui and Robert Zuccherato",
booktitle = "{Selected Areas in Cryptography: 10th Annual
International Workshop, SAC 2003, Ottawa, Canada,
August 14--15, 2003, Revised Papers}",
title = "{Selected Areas in Cryptography: 10th Annual
International Workshop, SAC 2003, Ottawa, Canada,
August 14--15, 2003, Revised Papers}",
volume = "3006",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 360",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b96837",
ISBN = "3-540-21370-8",
ISBN-13 = "978-3-540-21370-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3006.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3006;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b96837",
acknowledgement = ack-nhfb,
}
@Proceedings{Naor:2004:TCF,
editor = "Moni Naor",
booktitle = "{Theory of Cryptography: First Theory of Cryptography
Conference, TCC 2004, Cambridge, MA, USA, February
19--21, 2004: Proceedings}",
title = "{Theory of Cryptography: First Theory of Cryptography
Conference, TCC 2004, Cambridge, MA, USA, February
19--21, 2004: Proceedings}",
volume = "2951",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 521",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b95566",
ISBN = "3-540-21000-8",
ISBN-13 = "978-3-540-21000-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 C6676 2004",
bibdate = "Tue Nov 16 06:47:00 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2951.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2951;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b95566",
acknowledgement = ack-nhfb,
}
@Proceedings{Okamoto:2004:TCC,
editor = "Tatsuaki Okamoto",
booktitle = "{Topics in Cryptology---CT-RSA 2004: The
Cryptographers' Track at the RSA Conference 2004, San
Francisco, CA, USA, February 23--27, 2004:
Proceedings}",
title = "{Topics in Cryptology---CT-RSA 2004: The
Cryptographers' Track at the RSA Conference 2004, San
Francisco, CA, USA, February 23--27, 2004:
Proceedings}",
volume = "2964",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 386",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b95630",
ISBN = "3-540-20996-4",
ISBN-13 = "978-3-540-20996-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 C822 2004",
bibdate = "Tue Nov 16 06:53:23 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2964.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2964;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b95630",
acknowledgement = ack-nhfb,
}
@Book{Paun:2004:CTT,
editor = "Gheorghe P{\u{a}}un and Grzegorz Rozenberg and Arto
Salomaa",
booktitle = "Current trends in theoretical computer science: the
challenge of the new century",
title = "Current trends in theoretical computer science: the
challenge of the new century",
publisher = pub-WORLD-SCI,
address = pub-WORLD-SCI:adr,
pages = "????",
year = "2004",
ISBN = "981-238-783-8 (set), 981-238-966-0 (vol. 1),
981-238-965-2 (vol. 2)",
ISBN-13 = "978-981-238-783-7 (set), 978-981-238-966-4 (vol. 1),
978-981-238-965-7 (vol. 2)",
LCCN = "QA76 .C878 2004",
bibdate = "Wed Apr 5 05:38:43 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
remark = "Vol 1. Algorithms and complexity; vol. 2. Formal
models and semantics.",
subject = "Computer science",
}
@Proceedings{Roy:2004:FSE,
editor = "Bimal Roy and Willi Meier",
booktitle = "{Fast Software Encryption: 11th International
Workshop, FSE 2004: Delhi, India, February 5--7, 2004:
Revised Papers}",
title = "{Fast Software Encryption: 11th International
Workshop, FSE 2004: Delhi, India, February 5--7, 2004:
Revised Papers}",
volume = "3017",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 484",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b98177",
ISBN = "3-540-22171-9",
ISBN-13 = "978-3-540-22171-5",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Nov 11 19:26:30 MST 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3017.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3017;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b98177",
acknowledgement = ack-nhfb,
}
@Proceedings{Schmalz:2004:MDIa,
editor = "Mark S. Schmalz",
booktitle = "{Mathematics of data\slash image coding, compression,
and encryption VI, with applications: 5 and 7 August
2003, San Diego, California, USA}",
title = "{Mathematics of data\slash image coding, compression,
and encryption VI, with applications: 5 and 7 August
2003, San Diego, California, USA}",
volume = "5208",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "viii + 236",
year = "2004",
ISBN = "0-8194-5081-2",
ISBN-13 = "978-0-8194-5081-4",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TA1637 .M375 2005",
bibdate = "Wed Sep 28 08:28:22 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = "SPIE proceedings series",
acknowledgement = ack-nhfb,
subject = "Image processing; Mathematics; Congresses; Image
processing; Digital techniques; Congresses; Image
compression; Congresses; Data encryption (Computer
science); Congresses",
}
@Proceedings{Schmalz:2004:MDIb,
editor = "Mark S. Schmalz",
booktitle = "{Mathematics of data\slash image coding, compression,
and encryption VII, with applications: 4--5 August,
2004, Denver, Colorado, USA}",
title = "{Mathematics of data\slash image coding, compression,
and encryption VII, with applications: 4--5 August,
2004, Denver, Colorado, USA}",
volume = "5561",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "viii + 176",
year = "2004",
ISBN = "0-8194-5499-0",
ISBN-13 = "978-0-8194-5499-7",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TA1637 .M375 2004",
bibdate = "Sat Dec 24 08:47:41 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = "SPIE proceedings series",
URL = "http://uclibs.org/PID/57292",
acknowledgement = ack-nhfb,
subject = "Image processing; Digital techniques; Congresses; Data
encryption (Computer science); Image compression",
}
@Proceedings{Zhang:2004:BAF,
editor = "David Zhang and Anil K. Jain",
booktitle = "{Biometric Authentication: First International
Conference, ICBA 2004, Hong Kong, China, July 15--17,
2004, Proceedings}",
title = "{Biometric Authentication: First International
Conference, ICBA 2004, Hong Kong, China, July 15--17,
2004, Proceedings}",
volume = "3072",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xvii + 800",
year = "2004",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b98225",
ISBN = "3-540-22146-8",
ISBN-13 = "978-3-540-22146-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76 A1 L43 3072 (LC)",
bibdate = "Tue Nov 16 08:18:03 2004",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t3072.htm;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3072;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b98225",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2005:MPI,
editor = "{ACM}",
booktitle = "{MGC'05: Proceedings of the 3rd International Workshop
on Middleware for Grid Computing, Grenoble, France,
November 28--December 02, 2005}",
title = "{MGC'05: Proceedings of the 3rd International Workshop
on Middleware for Grid Computing, Grenoble, France,
November 28--December 02, 2005}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "????",
year = "2005",
ISBN = "1-59593-269-0",
ISBN-13 = "978-1-59593-269-3",
LCCN = "????",
bibdate = "Sat Oct 14 13:52:46 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2005:PTF,
editor = "{ACM}",
booktitle = "{Proceedings of the Twenty-Fourth ACM
SIGMOD-SIGACT-SIGART Symposium on Principles of
Database Systems: PODS 2005: Baltimore, Maryland, June
13-15, 2005}",
title = "{Proceedings of the Twenty-Fourth ACM
SIGMOD-SIGACT-SIGART Symposium on Principles of
Database Systems: PODS 2005: Baltimore, Maryland, June
13-15, 2005}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "x + 380",
year = "2005",
ISBN = "1-59593-062-0",
ISBN-13 = "978-1-59593-062-0",
LCCN = "QA76.9.D3 A296 2005",
bibdate = "Wed Aug 23 12:13:46 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "ACM order number 475050.",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2005:SPA,
editor = "{ACM}",
booktitle = "{STOC '05: proceedings of the 37th Annual ACM
Symposium on Theory of Computing: Baltimore, Maryland,
USA, May 22--24, 2005}",
title = "{STOC '05: proceedings of the 37th Annual ACM
Symposium on Theory of Computing: Baltimore, Maryland,
USA, May 22--24, 2005}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 770",
year = "2005",
ISBN = "1-58113-960-8",
ISBN-13 = "978-1-58113-960-0",
LCCN = "QA75.5 A22 2005",
bibdate = "Wed Apr 5 05:53:41 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
acknowledgement = ack-nhfb,
meetingname = "ACM Symposium on Theory of Computing (37th: 2005:
Baltimore, MD)",
remark = "ACM order number 508050.",
subject = "Electronic digital computers; Congresses; Electronic
data processing; Computer programming; Computational
complexity",
}
@Proceedings{Barni:2005:DWI,
editor = "Mauro Barni and Ingemar Cox and Ton Kalker and Hyoung
Joong Kim",
booktitle = "{Digital watermarking: 4th international workshop,
IWDW 2005, Siena, Italy, September 15--17, 2005:
proceedings}",
title = "{Digital watermarking: 4th international workshop,
IWDW 2005, Siena, Italy, September 15--17, 2005:
proceedings}",
volume = "3710",
publisher = pub-SV,
address = pub-SV:adr,
pages = "483",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11551492",
ISBN = "3-540-28768-X",
ISBN-13 = "978-3-540-28768-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Blundo:2005:SCN,
editor = "Carlo Blundo and Stelvio Cimato",
booktitle = "{Security in communication networks: 4th international
conference, SCN 2004, Amalfi, Italy, September 8--10,
2004: Revised selected papers}",
title = "{Security in communication networks: 4th international
conference, SCN 2004, Amalfi, Italy, September 8--10,
2004: Revised selected papers}",
volume = "3352",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 379",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b105083",
ISBN = "3-540-24301-1",
ISBN-13 = "978-3-540-24301-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK5105.59 .S385 2004",
bibdate = "Thu Jun 2 09:14:04 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3352;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3352;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b105083",
acknowledgement = ack-nhfb,
meetingname = "SCN 2004 (2004: Amalfi, Italy)",
subject = "Computer networks; Security measures; Congresses;
Computer security; Congresses; Cryptography;
Congresses",
}
@Proceedings{Chadwick:2005:PKI,
editor = "David Chadwick and Gansen Zhao",
booktitle = "{Public key infrastructure: Second European PKI
Workshop: Research and Applications, EuroPKI 2005,
Canterbury, UK, June 30--July 1, 2005: revised selected
papers}",
title = "{Public key infrastructure: Second European PKI
Workshop: Research and Applications, EuroPKI 2005,
Canterbury, UK, June 30--July 1, 2005: revised selected
papers}",
volume = "3545",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 270",
year = "2005",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-28062-6",
ISBN-13 = "978-3-540-28062-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 E976 2005",
bibdate = "Wed Apr 5 16:52:24 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3545",
acknowledgement = ack-nhfb,
meetingname = "European PKI Workshop: Research and Applications (2nd:
2005: Canterbury, England)",
subject = "Public key cryptography; Congresses; Data encryption
(Computer science); Computer security; Computer
networks; Security measures",
}
@Proceedings{Christianson:2005:SPI,
editor = "Bruce Christianson and Bruno Crispo and James A.
Malcolm and Michael Roe",
booktitle = "{Security Protocols: 11th International Workshop,
Cambridge, UK, April 2--4, 2003, Revised Selected
Papers}",
title = "{Security Protocols: 11th International Workshop,
Cambridge, UK, April 2--4, 2003, Revised Selected
Papers}",
volume = "3364",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 349",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11542322",
ISBN = "3-540-28389-7",
ISBN-13 = "978-3-540-28389-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Sep 28 13:34:31 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3364",
acknowledgement = ack-nhfb,
}
@Book{Copeland:2005:CSB,
editor = "B. Jack Copeland",
booktitle = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
title = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "344 (est.)",
year = "2005",
ISBN = "0-19-284055-X",
ISBN-13 = "978-0-19-284055-4",
LCCN = "D810.C88 C66 2006",
bibdate = "Mon Nov 07 18:29:47 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
remark = "From the cover: ``At last --- the secrets of Bletchley
Parks' codebreaking computers''",
subject = "Lorenz cipher system; World War, 1939-1945;
Cryptography; Electronic intelligence; Great Britain;
Germany; History",
tableofcontents = "A brief history of cryptography from Caesar to
Bletchley Park / Simon Singh\par
How it began: Bletchley Park goes to war / Michael
Smith\par
The German Tunny machine / Jack Copeland\par
Colossus, codebreaking, and the digital age / Stephen
Budiansky \par
Machine against machine / Jack Copeland\par
D-Day at Bletchley Park / Thomas H.
Flowers\par
Intercept! / Jack Copeland\par
Colossus / Thomas H. Flowers\par
Colossus and the rise of the modern computer / Jack
Copeland\par
The PC-user's guide to Colossus / Benjamin Wells\par
Of men and machines / Brian Randell\par
The Colossus rebuild / Tony Sale\par
Mr. Newman's section / Jack Copeland, with Catherine
Caughey \ldots{} [et al.]\par
Max Newman: mathematician, codebreaker, and computer
pioneer / William Newman\par
Living with Fish: breaking Tunny in the Newmanry and
the Testery / Peter Hilton\par
From Hut 8 to the Newmanry / Jack Good\par
Codebreaking and Colossus / Donald Michie\par
Major Tester's section / Jerry Roberts\par
Setter and breaker / Roy Jenkins\par
An ATS girl in the Testery / Helen Currie\par
The Testery and the breaking of Fish / Peter
Edgerley\par
Dollis Hill at war / Jack Copeland, with David Bolam
\ldots{} [et al.]\par
The British Tunny machine / Gil Hayward\par
How Colossus was built and operated: one of its
engineers reveals its secrets / Harry
Fensom\par
Bletchley Park's Sturgeon: the Fish that laid no eggs /
Frode Weierud\par
German teleprinter traffic and Swedish wartime
intelligence / Craig McKay.",
xxbooktitle = "{Colossus}: The First Electronic Computer",
xxtitle = "{Colossus}: The First Electronic Computer",
}
@Proceedings{Cox:2005:DWT,
editor = "I. J. (Ingemar J.) Cox and Ton Kalker and Heung-Kyu
Lee",
booktitle = "{Digital watermarking: third international workshop,
IWDW 2004, Seoul, Korea, October 30--November 1, 2004:
revised selected papers}",
title = "{Digital watermarking: third international workshop,
IWDW 2004, Seoul, Korea, October 30--November 1, 2004:
revised selected papers}",
volume = "3304",
publisher = pub-SV,
address = pub-SV:adr,
pages = "ix + 306",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b106346",
ISBN = "3-540-24839-0 (softcover)",
ISBN-13 = "978-3-540-24839-2 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I89 2004",
bibdate = "Sat Jun 4 05:55:40 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3304",
acknowledgement = ack-nhfb,
meetingname = "IWDW 2004 (2004: Seoul, Korea)",
subject = "Computer security; Congresses; Data protection;
Congresses; Digital watermarking; Congresses",
}
@Proceedings{Cramer:2005:ACE,
editor = "Ronald Cramer",
booktitle = "{Advances in cryptology: EUROCRYPT 2005: 24th Annual
International Conference on the Theory and Applications
of Cryptographic Techniques, Aarhus, Denmark, May
22--26, 2005, proceedings}",
title = "{Advances in cryptology: EUROCRYPT 2005: 24th Annual
International Conference on the Theory and Applications
of Cryptographic Techniques, Aarhus, Denmark, May
22--26, 2005, proceedings}",
volume = "3494",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 576",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b136415",
ISBN = "3-540-25910-4 (softcover)",
ISBN-13 = "978-3-540-25910-7 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Jun 2 09:15:53 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3494;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b136415",
acknowledgement = ack-nhfb,
}
@Proceedings{Dawson:2005:PCM,
editor = "Ed Dawson and Serge Vaudenay",
booktitle = "{Progress in cryptology --- MYCRYPT 2005: first
international conference on cryptology in Malaysia,
Kuala Lumpur, Malaysia, September 28--30, 2005,
proceedings}",
title = "{Progress in cryptology --- MYCRYPT 2005: first
international conference on cryptology in Malaysia,
Kuala Lumpur, Malaysia, September 28--30, 2005,
proceedings}",
volume = "3715",
publisher = pub-SV,
address = pub-SV:adr,
pages = "327",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11554868",
ISBN = "3-540-28938-0",
ISBN-13 = "978-3-540-28938-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Desmedt:2005:CNS,
editor = "Yvo G. Desmedt and Huaxiong Wang and Yi Mu and
Yongqing Li",
booktitle = "{Cryptology and network security: 4th international
conference, CANS 2005, Xiamen, China, December 14--16,
2005: proceedings}",
title = "{Cryptology and network security: 4th international
conference, CANS 2005, Xiamen, China, December 14--16,
2005: proceedings}",
volume = "3810",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 348",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11599371",
ISBN = "3-540-30849-0",
ISBN-13 = "978-3-540-30849-2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I5534 2004",
bibdate = "Wed Apr 5 09:42:14 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3810",
acknowledgement = ack-nhfb,
meetingname = "International Conference on Cryptology and Network
Security (4th: 2005: Xiamen, Xiamen Shi, China)",
subject = "Computer security; Congresses; Cryptography",
}
@Proceedings{Dittmann:2005:CMS,
editor = "Jana Dittmann and Stefan Katzenbeisser and Andreas
Uhl",
booktitle = "{Communications and multimedia security: 9th IFIP TC-6
TC-11 International Conference, CMS 2005, Salzburg,
Austria, September 19--21, 2005: proceedings}",
title = "{Communications and multimedia security: 9th IFIP TC-6
TC-11 International Conference, CMS 2005, Salzburg,
Austria, September 19--21, 2005: proceedings}",
volume = "3677",
publisher = pub-SV,
address = pub-SV:adr,
pages = "357",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11552055",
ISBN = "3-540-28791-4",
ISBN-13 = "978-3-540-28791-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{diVimercati:2005:CSE,
editor = "Sabrina de Capitani di Vimercati and Paul Syverson and
Dieter Gollmann",
booktitle = "{Computer security --- ESORICS 2005: 10th European
symposium on research in computer security, Milan,
Italy, September 12--14, 2005: proceedings}",
title = "{Computer security --- ESORICS 2005: 10th European
symposium on research in computer security, Milan,
Italy, September 12--14, 2005: proceedings}",
volume = "3679",
publisher = pub-SV,
address = pub-SV:adr,
pages = "508",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11555827",
ISBN = "3-540-28963-1",
ISBN-13 = "978-3-540-28963-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Dobbertin:2005:AES,
editor = "Hans Dobbertin and Vincent Rijmen and Aleksandra
Sowa",
booktitle = "{Advanced encryption standard --- AES: 4th
international conference, AES 2004, Bonn, Germany, May
10--12, 2004, revised selected and invited papers}",
title = "{Advanced encryption standard --- AES: 4th
international conference, AES 2004, Bonn, Germany, May
10--12, 2004, revised selected and invited papers}",
volume = "3373",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 188",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b137765",
ISBN = "3-540-26557-0",
ISBN-13 = "978-3-540-26557-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Sat Jun 04 09:11:08 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3373",
acknowledgement = ack-nhfb,
}
@Proceedings{Garrett:2005:PKC,
editor = "Paul Garrett and Daniel Lieman",
booktitle = "{Public-key cryptography: American Mathematical
Society short course, January 13--14, 2003, Baltimore,
Maryland}",
title = "{Public-key cryptography: American Mathematical
Society short course, January 13--14, 2003, Baltimore,
Maryland}",
volume = "62",
publisher = pub-AMS,
address = pub-AMS:adr,
pages = "vii + 183",
year = "2005",
ISBN = "0-8218-3365-0",
ISBN-13 = "978-0-8218-3365-0",
LCCN = "QA76.9.A25 P82 2005",
bibdate = "Fri Sep 17 08:55:23 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Proceedings of symposia in applied mathematics [AMS
short course lecture notes]",
URL = "http://www.loc.gov/catdir/toc/fy0612/2005048178.html",
acknowledgement = ack-nhfb,
subject = "computers; access control; congresses; public key
cryptography",
tableofcontents = "Cryptographic primitives / Paul Garrett \\
Cryptography in the real world today / Daniel Lieman
\\
Public-key cryptography and proofs of security / Nick
Howgrave-Graham \\
Elliptic curves and cryptography / Joseph H. Silverman
\\
Towards faster cryptosystems, I / William Whyte \\
Towards faster cryptosystems, II / William D. Banks \\
Playing ``hide-and-seek'' with numbers : the hidden
number problem, lattices, and exponential sums / Igor
E. Shparlinski",
}
@Proceedings{Gilbert:2005:FSE,
editor = "Henri Gilbert and Helena Handschuh",
booktitle = "{Fast Software Encryption: 12th International
Workshop, FSE 2005, Paris, France, February 21--23,
2005, Revised Selected Papers}",
title = "{Fast Software Encryption: 12th International
Workshop, FSE 2005, Paris, France, February 21--23,
2005, Revised Selected Papers}",
volume = "3557",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 441",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11502760_25",
ISBN = "3-540-26541-4",
ISBN-13 = "978-3-540-26541-2",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 F77 2005",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3557",
acknowledgement = ack-nhfb,
}
@Proceedings{Gorodetsky:2005:CNS,
editor = "Vladimir Gorodetsky and Igor Kotenko and Victor
Skormin",
booktitle = "{Computer network security: third international
workshop on mathematical methods, models, and
architectures for computer network security, MMM-ACNS
2005, St. Petersburg, Russia, September 24--28, 2005,
proceedings}",
title = "{Computer network security: third international
workshop on mathematical methods, models, and
architectures for computer network security, MMM-ACNS
2005, St. Petersburg, Russia, September 24--28, 2005,
proceedings}",
volume = "3685",
publisher = pub-SV,
address = pub-SV:adr,
pages = "477",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11560326",
ISBN = "3-540-29113-X",
ISBN-13 = "978-3-540-29113-8",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Han:2005:PJI,
editor = "Yiliang Han and Xiaoyuan Yang and Jian Zhang",
booktitle = "{Proceedings of the 11th Joint International Computer
Conference --- JICC 2005}",
title = "{Proceedings of the 11th Joint International Computer
Conference --- JICC 2005}",
publisher = pub-WORLD-SCI,
address = pub-WORLD-SCI:adr,
pages = "980 (est.)",
year = "2005",
ISBN = "981-270-153-2",
ISBN-13 = "978-981-270-153-4",
LCCN = "????",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://eproceedings.worldscinet.com/9812701532/9812701532.0031.html",
abstract = "The known solutions to achieve confidentiality and
authentication simultaneously fail to provide
verifiability using standard elliptic curve signature
[10][1]. An elliptic curve based signcryption scheme
SC-ECDSA was proposed. A one time padding cipher with a
session key generated by respective secret knowledge
was constructed to encrypt messages. The standardized
signature scheme ECDSA was used to sign and verify.
Proof shows that SC-ECDSA matches the three security
notions: unforgeability, non-repudiation and
confidentiality (provable CUF-CPA). For typical
security parameters, SC-ECDSA saves 80\% computation
time and 4.7\% message expansion than other schemes. It
presents a 29.2\% reduction in computation time and a
6.9\% reduction in message expansion than traditional
Sign-then-Encrypt.",
acknowledgement = ack-nhfb,
}
@Proceedings{Handschuh:2005:SAC,
editor = "Helena Handschuh and M. Anwar Hasan",
booktitle = "{Selected areas in cryptography: 11th international
workshop, SAC 2004, Waterloo, Canada, August 9--10,
2004: Revised selected papers}",
title = "{Selected areas in cryptography: 11th international
workshop, SAC 2004, Waterloo, Canada, August 9--10,
2004: Revised selected papers}",
volume = "3357",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 353",
year = "2005",
CODEN = "LNCSD9",
ISBN = "3-540-24327-5",
ISBN-13 = "978-3-540-24327-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 S22 2004",
bibdate = "Thu Jun 2 09:13:50 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3357;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3357",
acknowledgement = ack-nhfb,
meetingname = "SAC 2004 (2004: Waterloo, Canada)",
subject = "Computer security; Congresses; Data encryption
(Computer science); Congresses; Cryptography;
Congresses",
}
@Proceedings{IEEE:2005:AIS,
editor = "{IEEE}",
booktitle = "{46th Annual IEEE Symposium on Foundations of Computer
Science: FOCS 2005: 23--25 October, 2005, Pittsburgh,
Pennsylvania, USA}",
title = "{46th Annual IEEE Symposium on Foundations of Computer
Science: FOCS 2005: 23--25 October, 2005, Pittsburgh,
Pennsylvania, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiii + 668",
year = "2005",
ISBN = "0-7695-2468-0, 0-7695-2362-5",
ISBN-13 = "978-0-7695-2468-9, 978-0-7695-2362-0",
ISSN = "0272-5428",
LCCN = "QA76 .S979 2005",
bibdate = "Thu May 6 08:31:47 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "IEEE Computer Society order number P2468.",
acknowledgement = ack-nhfb,
meetingname = "Symposium on Foundations of Computer Science (46th:
2005: Pittsburgh, PA)",
subject = "electronic data processing; congresses; machine
theory",
}
@Proceedings{IEEE:2005:PIS,
editor = "{IEEE}",
booktitle = "{Proceedings of the 17th IEEE Symposium on Computer
Arithmetic, ARITH-17, June 27--29, 2005, Cape Cod,
Massachusetts, USA}",
title = "{Proceedings of the 17th IEEE Symposium on Computer
Arithmetic, ARITH-17, June 27--29, 2005, Cape Cod,
Massachusetts, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2005",
ISBN = "????",
ISBN-13 = "????",
LCCN = "????",
bibdate = "Tue Jun 21 19:02:16 2005",
bibsource = "http://arith17.polito.it/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
xxnote = "Not yet published: check editor??",
}
@Proceedings{Ioannidis:2005:ACN,
editor = "John Ioannidis and Angelos Keromytis and Moti Yung",
booktitle = "{Applied Cryptography and Network Security: Third
International Conference, ACNS 2005, New York, NY, USA,
June 7--10, 2005, proceedings}",
title = "{Applied Cryptography and Network Security: Third
International Conference, ACNS 2005, New York, NY, USA,
June 7--10, 2005, proceedings}",
volume = "3531",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 530",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b137093",
ISBN = "3-540-26223-7 (softcover)",
ISBN-13 = "978-3-540-26223-7 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK5102.85 .A26 2005",
bibdate = "Thu Jun 2 09:16:22 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3531;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b137093",
acknowledgement = ack-nhfb,
subject = "Telecommunication; Security measures; Congresses; Data
encryption (Computer science); Cryptography",
}
@Proceedings{Kanade:2005:AVB,
editor = "Takeo Kanade and Anil Jain and Nalini K. Ratha",
booktitle = "{Audio- and Video-Based Biometric Person
Authentication: 5th International Conference, AVBPA
2005, Hilton Rye Town, NY, USA, July 20--22, 2005.
Proceedings}",
title = "{Audio- and Video-Based Biometric Person
Authentication: 5th International Conference, AVBPA
2005, Hilton Rye Town, NY, USA, July 20--22, 2005.
Proceedings}",
volume = "3546",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xx + 1134",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11527923_25",
ISBN = "3-540-27887-7",
ISBN-13 = "978-3-540-27887-0",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.S65 I565 2005",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Kilian:2005:TCS,
editor = "Joe Kilian",
booktitle = "{Theory of cryptography: Second theory of cryptography
conference, TCC 2005, Cambridge, MA, USA, February
10--12, 2005, proceedings}",
title = "{Theory of cryptography: Second theory of cryptography
conference, TCC 2005, Cambridge, MA, USA, February
10--12, 2005, proceedings}",
volume = "3378",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 619",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b106171",
ISBN = "3-540-24573-1 (softcover)",
ISBN-13 = "978-3-540-24573-5 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 T44 2005",
bibdate = "Thu Jun 2 09:14:25 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3378;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b106171",
acknowledgement = ack-nhfb,
}
@Proceedings{Li:2005:ABPa,
editor = "S. Z. Li",
booktitle = "{Advances in biometric person authentication: 5th
Chinese conference on biometric recognition,
SINOBIOMETRICS 2004, Guangzhou, China, December 13--14,
2004, proceedings}",
title = "{Advances in biometric person authentication: 5th
Chinese conference on biometric recognition,
SINOBIOMETRICS 2004, Guangzhou, China, December 13--14,
2004, proceedings}",
volume = "3338",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xviii + 699",
year = "2005",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-24029-2 (softcover)",
ISBN-13 = "978-3-540-24029-7 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.B56 C4 2004",
bibdate = "Thu Jun 2 09:13:42 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3338",
acknowledgement = ack-nhfb,
}
@Proceedings{Li:2005:ABPb,
editor = "Stan Z. Li and Zhenan Sun and Tieniu Tan and Sharath
Pankanti and G{\'e}rard Chollet and David Zhang",
booktitle = "{Advances in biometric person authentication:
International Workshop on Biometric Recognition
Systems, IWBRS 2005, Beijing, China, October 22--23,
2005: proceedings}",
title = "{Advances in biometric person authentication:
International Workshop on Biometric Recognition
Systems, IWBRS 2005, Beijing, China, October 22--23,
2005: proceedings}",
volume = "3781",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 250",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11569947",
ISBN = "3-540-29431-7",
ISBN-13 = "978-3-540-29431-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "TK7882.B56 I58 2005",
bibdate = "Wed Apr 5 09:41:52 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3781",
acknowledgement = ack-nhfb,
meetingname = "International Workshop on Biometric Recognition
Systems (2005: Beijing, China)",
subject = "Biometric identification; Congresses; Optical pattern
recognition; Face perception; Identification;
Automation; Image processing; Digital techniques",
}
@Proceedings{Martin:2005:PET,
editor = "David Martin and Andrei Serjantov",
booktitle = "{Privacy Enhancing Technologies: 4th International
Workshop, PET 2004, Toronto, Canada, May 26--28, 2004.
Revised Selected Papers}",
title = "{Privacy Enhancing Technologies: 4th International
Workshop, PET 2004, Toronto, Canada, May 26--28, 2004.
Revised Selected Papers}",
volume = "3424",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 343",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11423409_22",
ISBN = "3-540-26203-2",
ISBN-13 = "978-3-540-26203-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 P49 2004",
bibdate = "Thu Sep 29 06:46:02 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Meadows:2005:CPA,
editor = "Catherine Meadows and Paul Syverson",
booktitle = "{CCS '05: proceedings of the 12th ACM Conference on
Computer and Communications Security: November 7--11,
2005, Alexandria, Virginia, USA}",
title = "{CCS '05: proceedings of the 12th ACM Conference on
Computer and Communications Security: November 7--11,
2005, Alexandria, Virginia, USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "x + 408",
year = "2005",
ISBN = "1-59593-226-7",
ISBN-13 = "978-1-59593-226-6",
LCCN = "QA76.9.A25",
bibdate = "Mon Apr 3 08:02:50 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "ACM order number 459050.",
acknowledgement = ack-nhfb,
meetingname = "ACM Conference on Computer and Communications Security
(12th: 2005: Alexandria, VA)",
subject = "Computer security; Congresses; Telecommunication
systems; Security measures",
}
@Proceedings{Menezes:2005:TCC,
editor = "Alfred Menezes",
booktitle = "{Topics in cryptology CT-RSA 2005: The cryptographers'
track at the RSA Conference 2005, San Francisco, CA,
USA, February 14--18, 2005. Proceedings}",
title = "{Topics in cryptology CT-RSA 2005: The cryptographers'
track at the RSA Conference 2005, San Francisco, CA,
USA, February 14--18, 2005. Proceedings}",
volume = "3376",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 383",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b105222",
ISBN = "3-540-24399-2 (softcover)",
ISBN-13 = "978-3-540-24399-1 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 R753 2005",
bibdate = "Thu Jun 2 09:14:23 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3376;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b105222",
acknowledgement = ack-nhfb,
}
@Proceedings{Park:2005:ISC,
editor = "Choonsik Park and Seongtaek Chee",
booktitle = "{Information security and cryptology: ICISC 2004: 7th
international conference, Seoul, Korea, December 2--3,
2004. Revised selected papers}",
title = "{Information security and cryptology: ICISC 2004: 7th
international conference, Seoul, Korea, December 2--3,
2004. Revised selected papers}",
volume = "3506",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 490",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b137120",
ISBN = "3-540-26226-1 (softcover)",
ISBN-13 = "978-3-540-26226-8 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Thu Jun 2 09:16:03 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3506;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b137120",
acknowledgement = ack-nhfb,
}
@Proceedings{Patrick:2005:FCD,
editor = "Andrew S. Patrick and Moti Yung",
booktitle = "{Financial cryptography and data security: 9th
international conference, FC 2005, Roseau, The
Commonwealth of Dominica, February 28--March 3, 2005:
revised papers}",
title = "{Financial cryptography and data security: 9th
international conference, FC 2005, Roseau, The
Commonwealth of Dominica, February 28--March 3, 2005:
revised papers}",
volume = "3570",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xii + 376",
year = "2005",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-26656-9",
ISBN-13 = "978-3-540-26656-3",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "HG1710 .F35 2005; HG1710 .F35 2005eb; HG1710;
Internet",
bibdate = "Wed Apr 5 16:55:11 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3570",
acknowledgement = ack-nhfb,
meetingname = "FC 2005 (2005 : Roseau, Dominica)",
subject = "Electronic funds transfers; Security measures;
Congresses; Data encryption (Computer science);
Electronic commerce; Internet; Computer networks",
}
@Proceedings{Rao:2005:CHE,
editor = "Josyula R. Rao and Berk Sunar",
booktitle = "{Cryptographic Hardware and Embedded Systems --- CHES
2005: 7th International Workshop, Edinburgh, UK, August
29--September 1, 2005. Proceedings}",
title = "{Cryptographic Hardware and Embedded Systems --- CHES
2005: 7th International Workshop, Edinburgh, UK, August
29--September 1, 2005. Proceedings}",
volume = "3659",
publisher = pub-SV,
address = pub-SV:adr,
pages = "455",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11545262",
ISBN = "3-540-28474-5",
ISBN-13 = "978-3-540-28474-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 11:51:26 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3659",
acknowledgement = ack-nhfb,
}
@Proceedings{Roy:2005:ACA,
editor = "Bimal Roy",
booktitle = "{Advances in cryptology: ASIACRYPT 2005: 11th
International Conference on the Theory and Application
of Cryptology and Information Security, Chennai, India,
December 4--8, 2005}",
title = "{Advances in cryptology: ASIACRYPT 2005: 11th
International Conference on the Theory and Application
of Cryptology and Information Security, Chennai, India,
December 4--8, 2005}",
volume = "3788",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 701",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11593447",
ISBN = "3-540-30684-6",
ISBN-13 = "978-3-540-30684-9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I555 2005",
bibdate = "Wed Apr 5 09:42:09 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3788",
acknowledgement = ack-nhfb,
meetingname = "International Conference on the Theory and Application
of Cryptology and Information Security (11th: 2005:
Chennai, India)",
remark = "Association for Cryptologic Research, IACR.",
subject = "Computer security; Congresses; Cryptography",
}
@Proceedings{Schmalz:2005:MDI,
editor = "Mark S. Schmalz",
booktitle = "Mathematics of data\slash image coding, compression,
and encryption {VIII}, with applications: 1--3 August,
2005, San Diego, California, {USA}",
title = "Mathematics of data\slash image coding, compression,
and encryption {VIII}, with applications: 1--3 August,
2005, San Diego, California, {USA}",
volume = "5915",
publisher = pub-SPIE,
address = pub-SPIE:adr,
pages = "????",
year = "2005",
ISBN = "0-8194-5920-8",
ISBN-13 = "978-0-8194-5920-6",
ISSN = "0277-786X (print), 1996-756X (electronic)",
LCCN = "TA1637 .M375 2005; TA1637; Internet",
bibdate = "Sat Dec 24 08:47:41 MST 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = "Proceedings of SPIE",
URL = "http://uclibs.org/PID/98054",
acknowledgement = ack-nhfb,
subject = "Image processing; Mathematics; Congresses; Digital
techniques; Image compression; Data encryption
(Computer science)",
}
@Proceedings{Shoup:2005:ACC,
editor = "Victor Shoup",
booktitle = "{Advances in cryptology: CRYPTO 2005: 25th Annual
International Cryptology Conference, Santa Barbara,
California, USA, August 14--18, 2005: proceedings}",
title = "{Advances in cryptology: CRYPTO 2005: 25th Annual
International Cryptology Conference, Santa Barbara,
California, USA, August 14--18, 2005: proceedings}",
volume = "3621",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 568",
year = "2005",
ISBN = "3-540-28114-2",
ISBN-13 = "978-3-540-28114-6",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "QA76.9.A25 C79 2005; QA76.9 .A25; QA76.9 C79 2005;
QA76.9 C794 2005; QA76.9; Internet",
bibdate = "Mon Apr 3 08:16:05 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
melvyl.cdlib.org:210/CDL90",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3621",
acknowledgement = ack-nhfb,
meetingname = "CRYPTO (Conference) (25th: 2005: Santa Barbara, CA)",
subject = "Computers; Access control; Congresses; Cryptography;
Data transmission systems; Security measures",
}
@Proceedings{Smart:2005:CCI,
editor = "Nigel P. Smart",
booktitle = "{Cryptography and Coding: 10th IMA international
Conference, Cirencester, UK, December 19--21, 2005.
Proceedings}",
title = "{Cryptography and Coding: 10th IMA international
Conference, Cirencester, UK, December 19--21, 2005.
Proceedings}",
volume = "3796",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11586821",
ISBN = "3-540-30276-X (softcover)",
ISBN-13 = "978-3-540-30276-6 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 19:46:53 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3796",
acknowledgement = ack-nhfb,
}
@Proceedings{Vaudenay:2005:PKC,
editor = "Serge Vaudenay",
booktitle = "{Public key cryptography --- PKC 2005: 8th
International Workshop on Theory and Practice in Public
Key Cryptography, Les Diablerets, Switzerland, January
23--26, 2005: Proceedings}",
title = "{Public key cryptography --- PKC 2005: 8th
International Workshop on Theory and Practice in Public
Key Cryptography, Les Diablerets, Switzerland, January
23--26, 2005: Proceedings}",
volume = "3386",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiii + 431",
year = "2005",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/b105124",
ISBN = "3-540-24454-9 (paperback)",
ISBN-13 = "978-3-540-24454-7 (paperback)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "QA76.9.A25 I567 2005",
bibdate = "Thu Jun 2 09:14:32 MDT 2005",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0302-9743&volume=3386;
http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3386;
http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b105124",
acknowledgement = ack-nhfb,
meetingname = "International Workshop on Theory and Practice in
Public Key Cryptography (8th: 2005: Les Diablerets,
Switzerland)",
subject = "Computer security; Congresses; Computers; Access
control; Congresses; Data encryption (Computer
science); Congresses; Public key cryptology;
Congresses",
}
@Proceedings{ACM:2006:PTE,
editor = "{ACM}",
booktitle = "{Proceedings of the Thirty-Eighth Annual ACM Symposium
on Theory of Computing 2006, Seattle, WA, USA, May
21--23, 2006}",
title = "{Proceedings of the Thirty-Eighth Annual ACM Symposium
on Theory of Computing 2006, Seattle, WA, USA, May
21--23, 2006}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 768",
year = "2006",
ISBN = "1-59593-134-1",
ISBN-13 = "978-1-59593-134-4",
LCCN = "QA75.5 .A22 2006",
bibdate = "Thu May 25 06:13:58 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
note = "ACM order number 508060.",
URL = "http://portal.acm.org/citation.cfm?id=1132516",
acknowledgement = ack-nhfb,
}
@Proceedings{Atzeni:2006:PKI,
editor = "Andrea S. Atzeni and Antonio Lioy",
booktitle = "{Public Key Infrastructure: Third European PKI
Workshop: Theory and Practice, EUROPKI 2006, Turin,
Italy, June 19--20, 2006. Proceedings}",
title = "{Public Key Infrastructure: Third European PKI
Workshop: Theory and Practice, EUROPKI 2006, Turin,
Italy, June 19--20, 2006. Proceedings}",
volume = "4043",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2006",
ISBN = "3-540-35151-5 (softcover)",
ISBN-13 = "978-3-540-35151-1 (softcover)",
LCCN = "????",
bibdate = "Tue Jun 13 16:14:38 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Book{Cohen:2006:HEH,
editor = "Henri Cohen and Gerhard Frey and Roberto Avanzi and
others",
booktitle = "Handbook of Elliptic and Hyperelliptic Curve
Cryptography",
title = "Handbook of Elliptic and Hyperelliptic Curve
Cryptography",
publisher = pub-CHAPMAN-HALL-CRC,
address = pub-CHAPMAN-HALL-CRC:adr,
pages = "xxxiv + 808",
year = "2006",
ISBN = "1-58488-518-1",
ISBN-13 = "978-1-58488-518-4",
LCCN = "QA567.2.E44 H36 2006",
bibdate = "Thu Mar 22 12:20:50 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/sigact.bib;
z3950.loc.gov:7090/Voyager",
series = "Discrete mathematics and its applications",
URL = "http://www.loc.gov/catdir/enhancements/fy0647/2005041841-d.html",
acknowledgement = ack-nhfb,
subject = "Curves, Elliptic; Handbooks, manuals, etc;
Cryptography; Mathematics; Machine theory",
}
@Book{Copeland:2006:CSB,
editor = "B. Jack Copeland",
booktitle = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
title = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "xvi + 462 + 16",
year = "2006",
ISBN = "0-19-284055-X (hardcover), 0-19-957814-1 (paperback)",
ISBN-13 = "978-0-19-284055-4 (hardcover), 978-0-19-957814-6
(paperback)",
LCCN = "D810.C88 C66 2006",
bibdate = "Tue Jun 26 07:56:07 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/annhistcomput.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
URL = "http://www.colossus-computer.com/",
acknowledgement = ack-nhfb,
subject = "Lorenz cipher system; World War, 1939--1945;
Cryptography; Electronic intelligence; Great Britain;
History; Germany; Computers",
tableofcontents = "A brief history of cryptography from Caesar to
Bletchley Park / Simon Singh \\
How it began: Bletchley Park goes to war / Michael
Smith \\
The German Tunny machine / Jack Copeland \\
Colossus, codebreaking, and the digital age / Stephen
Budiansky \\
Machine against machine / Jack Copeland \\
D-Day at Bletchley Park / Thomas H. Flowers \\
Intercept! / Jack Copeland \\
Colossus / Thomas H. Flowers \\
Colossus and the rise of the modern computer / Jack
Copeland \\
The PC user's guide to Colossus / Benjamin Wells \\
Of men and machines / Brian Randell \\
The Colossus rebuild / Tony Sale \\
Mr. Newman's section / Jack Copeland, with Catherine
Caughey \ldots{} [et al.] \\
Max Newman: mathematician, codebreaker, and computer
pioneer / William Newman \\
Living with Fish: breaking Tunny in the Newmanry and
the Testery / Peter Hilton \\
From Hut 8 to the Newmanry / Irving John ``Jack'' Good
\\
Codebreaking and Colossus / Donald Michie \\
Major Tester's section / Jerry Roberts \\
Setter and breaker / Roy Jenkins \\
An ATS girl in the Testery / Helen Currie \\
The Testery and the breaking of Fish / Peter Edgerley
\\
Dollis Hill at war / Jack Copeland, with David Bolam
\ldots{} [et al.] \\
The British Tunny machine / Gil Hayward \\
How Colossus was built and operated: one of its
engineers reveals its secrets / Harry Fensom \\
Bletchley Park's Sturgeon: the Fish that laid no eggs /
Frode Weierud \\
German teleprinter traffic and Swedish wartime
intelligence / Craig McKay",
}
@Proceedings{Domingo-Ferrer:2006:SCR,
editor = "Josep Domingo-Ferrer and Joachim Posegga and Daniel
Schreckling",
booktitle = "{Smart Card Research and Advanced Applications: 7th
IFIP WG 8.8/11.2 International Conference, CARDIS 2006,
Tarragona, Spain, April 19--21, 2006. Proceedings}",
title = "{Smart Card Research and Advanced Applications: 7th
IFIP WG 8.8/11.2 International Conference, CARDIS 2006,
Tarragona, Spain, April 19--21, 2006. Proceedings}",
volume = "3928",
publisher = pub-SV,
address = pub-SV:adr,
pages = "358 (est.)",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11733447",
ISBN = "3-540-33311-8",
ISBN-13 = "978-3-540-33311-1",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 09:35:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3928",
acknowledgement = ack-nhfb,
}
@Proceedings{Feng:2006:ISC,
editor = "Dengguo Feng and Dongdai Lin and Moti Yung",
booktitle = "{Information Security and Cryptology: First SKLOIS
Conference, CISC 2005, Beijing, China, December 15--17,
2005. Proceedings}",
title = "{Information Security and Cryptology: First SKLOIS
Conference, CISC 2005, Beijing, China, December 15--17,
2005. Proceedings}",
volume = "3822",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11599548",
ISBN = "3-540-30855-5 (softcover)",
ISBN-13 = "978-3-540-30855-3 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 19:52:37 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3822",
acknowledgement = ack-nhfb,
}
@Proceedings{Halevi:2006:TCT,
editor = "Shai Halevi and Tal Rabin",
booktitle = "{Theory of Cryptography: Third Theory of Cryptography
Conference, TCC 2006, New York, NY, USA, March 4--7,
2006. Proceedings}",
title = "{Theory of Cryptography: Third Theory of Cryptography
Conference, TCC 2006, New York, NY, USA, March 4--7,
2006. Proceedings}",
volume = "3876",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11681878",
ISBN = "3-540-32731-2 (softcover)",
ISBN-13 = "978-3-540-32731-8 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 20:03:23 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3876",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2006:AIS,
editor = "{IEEE}",
booktitle = "{47th Annual IEEE Symposium on Foundations of Computer
Science: FOCS 2006: 21--24 October, 2006, Berkeley,
California}",
title = "{47th Annual IEEE Symposium on Foundations of Computer
Science: FOCS 2006: 21--24 October, 2006, Berkeley,
California}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 750",
year = "2006",
ISBN = "0-7695-2720-5, 0-7695-2362-5",
ISBN-13 = "978-0-7695-2720-8, 978-0-7695-2362-0",
ISSN = "0272-5428",
LCCN = "QA76 .S974 2006",
bibdate = "Thu May 6 08:30:22 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "IEEE Computer Society Order Number P2720.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=4031329",
acknowledgement = ack-nhfb,
meetingname = "Symposium on Foundations of Computer Science (47th:
2006: Berkeley, California)",
subject = "electronic data processing; congresses; machine
theory",
}
@Proceedings{Maitra:2006:PCI,
editor = "Subhamoy Maitra and C. E. Veni Madhavan and
Ramarathnam Venkatesan",
booktitle = "{Progress in Cryptology --- INDOCRYPT 2005: 6th
International Conference on Cryptology in India,
Bangalore, India, December 10--12, 2005. Proceedings}",
title = "{Progress in Cryptology --- INDOCRYPT 2005: 6th
International Conference on Cryptology in India,
Bangalore, India, December 10--12, 2005. Proceedings}",
volume = "3797",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11596219",
ISBN = "3-540-30805-9 (softcover)",
ISBN-13 = "978-3-540-30805-8 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 19:47:13 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3797",
acknowledgement = ack-nhfb,
}
@Proceedings{Pointcheval:2006:TCC,
editor = "David Pointcheval",
booktitle = "{Topics in Cryptology --- CT-RSA 2006: The
Cryptographers' Track at the RSA Conference 2006, San
Jose, CA, USA, February 13--17, 2006, proceedings}",
title = "{Topics in Cryptology --- CT-RSA 2006: The
Cryptographers' Track at the RSA Conference 2006, San
Jose, CA, USA, February 13--17, 2006, proceedings}",
volume = "3860",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 364",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11605805",
ISBN = "3-540-31033-9",
ISBN-13 = "978-3-540-31033-4",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 09:35:58 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3860",
acknowledgement = ack-nhfb,
}
@Proceedings{Preneel:2006:SAC,
editor = "Bart Preneel and Stafford Tavares",
booktitle = "{Selected Areas in Cryptography: 12th International
Workshop, SAC 2005, Kingston, ON, Canada, August
11--12, 2005, Revised Selected Papers}",
title = "{Selected Areas in Cryptography: 12th International
Workshop, SAC 2005, Kingston, ON, Canada, August
11--12, 2005, Revised Selected Papers}",
volume = "3897",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2006",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/11693383",
ISBN = "3-540-33108-5 (softcover)",
ISBN-13 = "978-3-540-33108-7 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 20:10:26 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3897",
acknowledgement = ack-nhfb,
}
@Book{Schroeder:2006:NTS,
author = "Manfred Robert Schroeder",
booktitle = "Number Theory in Science and Communication: With
Applications in Cryptography, Physics, Digital
Information, Computing, and Self-Similarity",
title = "Number Theory in Science and Communication: With
Applications in Cryptography, Physics, Digital
Information, Computing, and Self-Similarity",
volume = "7",
publisher = pub-SV,
address = pub-SV:adr,
edition = "Fourth",
pages = "xxvi + 367",
year = "2006",
DOI = "https://doi.org/10.1007/3-540-26598-8",
ISBN = "3-540-26598-8, 3-540-26596-1",
ISBN-13 = "978-3-540-26598-6, 978-3-540-26596-2",
ISSN = "0720-678X",
LCCN = "QA241",
bibdate = "Fri Mar 9 08:36:40 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/prng.bib;
z3950.bibsys.no:2100/BIBSYS",
series = "Springer Series in Information Sciences",
acknowledgement = ack-nhfb,
subject = "physics; coding theory; number theory; mathematical
physics; coding and information theory; mathematical
methods in physics; distribution (probability theory);
numerical and computational methods; probability theory
and stochastic processes",
}
@Proceedings{Turner:2006:SIS,
editor = "Stephen John Turner and Bu Sung Lee and Wientong Cai",
booktitle = "{Sixth International Symposium on Cluster Computing
and the Grid CCGrid 06: 16--19 May, 2006, Singapore}",
title = "{Sixth International Symposium on Cluster Computing
and the Grid CCGrid 06: 16--19 May, 2006, Singapore}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xxiii + 662",
year = "2006",
ISBN = "0-7695-2585-7",
ISBN-13 = "978-0-7695-2585-3",
LCCN = "QA76.9.C58",
bibdate = "Sat Oct 14 15:36:24 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib;
z3950.loc.gov:7090/Voyager",
note = "IEEE Computer Society Order Number P2585.",
acknowledgement = ack-nhfb,
}
@Proceedings{Won:2006:ISC,
editor = "Dongho Won and Seungjoo Kim",
booktitle = "{Information security and cryptology --- ICISC 2005:
8th international conference, Seoul, Korea, December
1--2, 2005, revised selected papers}",
title = "{Information security and cryptology --- ICISC 2005:
8th international conference, Seoul, Korea, December
1--2, 2005, revised selected papers}",
volume = "3935",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 458",
year = "2006",
CODEN = "LNCSD9",
DOI = "????",
ISBN = "3-540-33354-1 (softcover)",
ISBN-13 = "978-3-540-33354-8 (softcover)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
LCCN = "????",
bibdate = "Wed Apr 5 20:15:09 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3935",
acknowledgement = ack-nhfb,
}
@Proceedings{Ytrehus:2006:CCI,
editor = "{\O}yvind Ytrehus",
booktitle = "Coding and Cryptography: {International Workshop, WCC
2005, Bergen, Norway, March 14--18, 2005}. Revised
Selected Papers",
title = "Coding and Cryptography: {International Workshop, WCC
2005, Bergen, Norway, March 14--18, 2005}. Revised
Selected Papers",
volume = "3969",
publisher = pub-SV,
address = pub-SV:adr,
year = "2006",
DOI = "https://doi.org/10.1007/11779360",
ISBN = "3-540-35481-6",
ISBN-13 = "978-3-540-35481-9",
LCCN = "QA76.9.A25 I557 2005",
bibdate = "Mon Jun 27 22:43:21 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
subject = "computers; access control; congresses; coding theory;
cryptography",
}
@Proceedings{Yung:2006:PKC,
editor = "Moti Yung and Yevgeniy Dodis and Aggelos Kiayias and
Tal Malkin",
booktitle = "{Public Key Cryptography: PPK 2006: 9th International
Conference on Theory and Practice in Public-Key
Cryptography, New York, NY, USA, April 24--26, 2006.
Proceedings}",
title = "{Public Key Cryptography: PPK 2006: 9th International
Conference on Theory and Practice in Public-Key
Cryptography, New York, NY, USA, April 24--26, 2006.
Proceedings}",
volume = "3958",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 543",
year = "2006",
ISBN = "3-540-33851-9 (softcover)",
ISBN-13 = "978-3-540-33851-2 (softcover)",
LCCN = "????",
bibdate = "Tue Jun 13 10:22:42 MDT 2006",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = ser-LNCS,
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3958",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2007:SPA,
editor = "{ACM}",
booktitle = "{STOC '07: proceedings of the 39th Annual ACM
Symposium on Theory of Computing, San Diego,
California, USA, June 11--13, 2007}",
title = "{STOC '07: proceedings of the 39th Annual ACM
Symposium on Theory of Computing, San Diego,
California, USA, June 11--13, 2007}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xv + 718",
year = "2007",
ISBN = "1-59593-631-9",
ISBN-13 = "978-1-59593-631-8",
LCCN = "QA75.5 .A22 2007",
bibdate = "Fri Jun 20 18:35:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
}
@Proceedings{Adams:2007:SAC,
editor = "Carlisle Adams and Ali Miri and Michael Wiener",
booktitle = "{Selected areas in cryptography: 14th international
workshop, SAC 2007, Ottawa, Canada, August 16--17,
2007; revised selected papers}",
title = "{Selected areas in cryptography: 14th international
workshop, SAC 2007, Ottawa, Canada, August 16--17,
2007; revised selected papers}",
volume = "4876",
publisher = pub-SV,
address = pub-SV:adr,
year = "2007",
DOI = "https://doi.org/10.1007/978-3-540-77360-3",
ISBN = "3-540-77360-6",
ISBN-13 = "978-3-540-77360-3",
LCCN = "????",
bibdate = "Mon Jun 27 22:48:38 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = ser-LNCS,
acknowledgement = ack-nhfb,
}
@Proceedings{Biryukov:2007:FSE,
editor = "Alex Biryukov",
booktitle = "{Fast software encryption: 14th international
workshop, FSE 2007, Luxembourg, Luxembourg, March
26--28, 2007, revised selected papers}",
title = "{Fast software encryption: 14th international
workshop, FSE 2007, Luxembourg, Luxembourg, March
26--28, 2007, revised selected papers}",
volume = "4593",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xi + 465",
year = "2007",
ISBN = "3-540-74617-X (softcover)",
ISBN-13 = "978-3-540-74617-1 (softcover)",
LCCN = "QA76.9.A25 F77 2007",
bibdate = "Sat Dec 15 11:14:00 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/hash.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib;
z3950.loc.gov:7090/Voyager",
series = "Lecture notes in computer science",
URL = "http://www.springerlink.com/openurl.asp?genre=book\%26isbn=978-3-540-74617-1",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2007:PAI,
editor = "{IEEE}",
booktitle = "{Proceedings of the 48th Annual IEEE Symposium on
Foundations of Computer Science: [FOCS 2007]: October
20--23, 2007, Providence, Rhode Island}",
title = "{Proceedings of the 48th Annual IEEE Symposium on
Foundations of Computer Science: [FOCS 2007]: October
20--23, 2007, Providence, Rhode Island}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xiv + 736",
year = "2007",
ISBN = "0-7695-3010-9",
ISBN-13 = "978-0-7695-3010-9",
ISSN = "0272-5428",
LCCN = "QA76 .S974 2007",
bibdate = "Thu May 6 08:33:34 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "IEEE Computer Society order number P3010.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=4389466",
acknowledgement = ack-nhfb,
meetingname = "Symposium on Foundations of Computer Science (48th:
2007: Providence, RI)",
subject = "Electronic data processing; Congresses; Machine
theory",
}
@Proceedings{Kornerup:2007:PIS,
editor = "Peter Kornerup and Jean-Michel Muller",
booktitle = "{Proceedings of the 18th IEEE Symposium on Computer
Arithmetic, June 25--27, 2007, Montpellier, France}",
title = "{Proceedings of the 18th IEEE Symposium on Computer
Arithmetic, June 25--27, 2007, Montpellier, France}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xii + 269",
year = "2007",
ISBN = "0-7695-2854-6",
ISBN-13 = "978-0-7695-2854-0",
ISSN = "1063-6889",
LCCN = "????",
bibdate = "Tue Jun 27 10:26:43 2006",
bibsource = "http://www.lirmm.fr/arith18/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
odin2.bib.sdu.dk:210/Horizon",
URL = "http://www.lirmm.fr/arith18/",
acknowledgement = ack-nhfb,
}
@Proceedings{Menezes:2007:ACC,
editor = "A. J. (Alfred J.) Menezes",
booktitle = "{Advances in cryptology --- CRYPTO 2007: 27th Annual
International Cryptology Conference, Santa Barbara, CA,
USA, August 19--23, 2007: proceedings}",
title = "{Advances in cryptology --- CRYPTO 2007: 27th Annual
International Cryptology Conference, Santa Barbara, CA,
USA, August 19--23, 2007: proceedings}",
volume = "4622",
publisher = pub-SV,
address = pub-SV:adr,
pages = "xiv + 630",
year = "2007",
ISBN = "3-540-74142-9 (paperback)",
ISBN-13 = "978-3-540-74142-8 (paperback)",
LCCN = "QA76.9.A25 C79 2007",
bibdate = "Thu Apr 21 10:08:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
series = "Lecture notes in computer science, 0302-9743",
URL = "http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4622",
acknowledgement = ack-nhfb,
meetingname = "CRYPTO (Conference) (27th : 2007 : Santa Barbara,
Calif.)",
subject = "International conference proceedings. International
Association for Cryptologic Research; computers; access
control; congresses; cryptography",
tableofcontents = "I: Cryptanalysis I \\
Practical Cryptanalysis of SFLASH \\
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
\\
II: Secure Searching \\
How Should We Solve Search Problems Privately? \\
Public Key Encryption That Allows PIR Queries \\
III: Invited Talk \\
Information Security Economics - and Beyond \\
IV: Theory I \\
Cryptography with Constant Input Locality \\
Universally-Composable Two-Party Computation in Two
Rounds \\
Indistinguishability Amplification \\
V: Lattices \\
A Hybrid Lattice-Reduction and Meet-in-the-Middle
Attack Against NTRU \\
Improved Analysis of Kannan's Shortest Lattice Vector
Algorithm (Extended Abstract) \\
VI: Random Oracles \\
Domain Extension of Public Random Functions: Beyond the
Birthday Barrier \\
Random Oracles and Auxiliary Input \\
VII: Hash Functions \\
Security-Amplifying Combiners for Collision-Resistant
Hash Functions \\
Hash Functions and the (Amplified) Boomerang Attack \\
Amplifying Collision Resistance: A Complexity-Theoretic
Treatment \\
VIII: Theory II \\
How Many Oblivious Transfers Are Needed for Secure
Multiparty Computation? \\
Simulatable VRFs with Applications to Multi-theorem
NIZK \\
Cryptography in the Multi-string Model \\
IX: Quantum Cryptography \\
Secure Identification and QKD in the
Bounded-Quantum-Storage Model \\
A Tight High-Order Entropic Quantum Uncertainty
Relation with Applications \\
X: Cryptanalysis II \\
Finding Small Roots of Bivariate Integer Polynomial
Equations: A Direct Approach \\
A Polynomial Time Attack on RSA with Private
CRT-Exponents Smaller Than N<sup>0.073</sup> \\
XI: Encryption \\
Invertible Universal Hashing and the TET Encryption
Mode \\
Reducing Trust in the PKG in Identity Based
Cryptosystems \\
Pirate Evolution: How to Make the Most of Your Traitor
Keys \\
XII: Protocol Analysis \\
A Security Analysis of the NIST SP 800-90 Elliptic
Curve Random Number Generator \\
A Generalization of DDH with Applications to Protocol
Analysis and Computational Soundness \\
Chernoff-Type Direct Product Theorems \\
XIII: Public-Key Encryption \\
Rerandomizable RCCA Encryption \\
Deterministic and Efficiently Searchable Encryption \\
Secure Hybrid Encryption from Weakened Key
Encapsulation \\
XIV: Multi-party Computation \\
Scalable and Unconditionally Secure Multiparty
Computation \\
On Secure Multi-party Computation in Black-Box Groups
\\
A Note on Secure Computation of the Moore-Penrose
Pseudoinverse and Its Application to Secure Linear
Algebra \\
Author Index",
}
@Proceedings{Simos:2007:CMS,
editor = "Theodore E. Simos and George Maroulis",
booktitle = "{Computation in Modern Science and Engineering:
Proceedings of the [Fifth] International Conference on
Computational Methods in Science and Engineering 2007
(ICCMSE 2007), Corfu, Greece, 25--30 September 2007}",
title = "{Computation in Modern Science and Engineering:
Proceedings of the [Fifth] International Conference on
Computational Methods in Science and Engineering 2007
(ICCMSE 2007), Corfu, Greece, 25--30 September 2007}",
volume = "2A, 2B",
publisher = pub-AIP,
address = pub-AIP:adr,
bookpages = "xxvi + 730 + 10 (vol. 2A)",
pages = "xxvi + 730 + 10 (vol. 2A)",
year = "2007",
ISBN = "0-7354-0476-3 (set), 0-7354-0477-1 (vol. 1),
0-7354-0478-X (vol. 2)",
ISBN-13 = "978-0-7354-0476-2 (set), 978-0-7354-0477-9 (vol. 1),
978-0-7354-0478-6 (vol. 2)",
ISSN = "0094-243X (print), 1551-7616 (electronic), 1935-0465",
LCCN = "Q183.9 .I524 2007",
bibdate = "Thu Feb 21 14:15:15 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
series = "AIP Conference Proceedings (\#963)",
URL = "http://www.springer.com/physics/atoms/book/978-0-7354-0478-6",
abstract = "All papers have been peer-reviewed. The aim of ICCMSE
2007 is to bring together computational scientists and
engineers from several disciplines in order to share
methods, methodologies and ideas. The potential readers
of these proceedings are all the scientists with
interest in the following fields: Computational
Mathematics, Theoretical Physics, Computational
Physics, Theoretical Chemistry, Computational
Chemistry, Mathematical Chemistry, Computational
Engineering, Computational Mechanics, Computational
Biology and Medicine, Scientific Computation, High
Performance Computing, Parallel and Distributed
Computing, Visualization, Problem Solving Environments,
Software Tools, Advanced Numerical Algorithms, Modeling
and Simulation of Complex Systems, Web-based Simulation
and Computing, Grid-based Simulation and Computing,
Computational Grids, and Computer Science.",
acknowledgement = ack-nhfb,
remark = "Two volumes.",
}
@Proceedings{ACM:2008:SPA,
editor = "{ACM}",
booktitle = "{STOC '08: proceedings of the 40th Annual ACM
Symposium on Theory of Computing, Victoria, British
Columbia, Canada, May 17--20, 2008}",
title = "{STOC '08: proceedings of the 40th Annual ACM
Symposium on Theory of Computing, Victoria, British
Columbia, Canada, May 17--20, 2008}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xv + 798",
year = "2008",
ISBN = "1-60558-047-3",
ISBN-13 = "978-1-60558-047-0",
LCCN = "QA76.6 .A152 2008",
bibdate = "Fri Jun 20 18:35:01 MDT 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
}
@Proceedings{Buchmann:2008:PQC,
editor = "Johannes Buchmann and Jintai Ding",
booktitle = "{Post-Quantum Cryptography: Second International
Workshop, PQCrypto 2008 Cincinnati, OH, USA, October
17--19, 2008 Proceedings}",
title = "{Post-Quantum Cryptography: Second International
Workshop, PQCrypto 2008 Cincinnati, OH, USA, October
17--19, 2008 Proceedings}",
volume = "5299",
publisher = pub-SV,
address = pub-SV:adr,
pages = "x + 231",
year = "2008",
DOI = "https://doi.org/10.1007/978-3-540-88403-3",
ISBN = "3-540-88402-5 (paperback), 3-540-88403-3 (pdf),
3-540-88701-6",
ISBN-13 = "978-3-540-88402-6 (paperback), 978-3-540-88403-3
(pdf), 978-3-540-88701-0",
LCCN = "QA76.9.A25 P63 2008",
bibdate = "Thu Apr 21 17:24:28 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
series = ser-LNCS,
URL = "http://www.springer.com/computer/security+and+cryptology/book/978-3-540-88402-6",
abstract = "This book constitutes the refereed proceedings of the
Second International Workshop on Post-Quantum
Cryptography, PQCrypto 2008, held in Cincinnati, OH,
USA, in October 2008. The 15 revised full papers
presented were carefully reviewed and selected from
numerous submissions. Quantum computers are predicted
to break existing public key cryptosystems within the
next decade. Post-quantum cryptography is a new fast
developing area, where public key schemes are studied
that could resist these emerging attacks. The papers
present four families of public key cryptosystems that
have the potential to resist quantum computers: the
code-based public key cryptosystems, the hash-based
public key cryptosystems, the lattice-based public key
cryptosystems and the multivariate public key
cryptosystems.",
acknowledgement = ack-nhfb,
keywords = "access control; AES; authentication; code-based
cryptography; cryptanalysis; cryptographic attacks;
cryptographic protocols; cryptography; cryptology;
cryptosystems; digital signatures; elliptic curves;
hash functions; map decomposition; McEliece
cryptosystem; Merkle signatures; multivariate
cryptography; pairing computation; post quantum
cryptography; provable security; public key
cryptography; quantum cryptography; rational
polynomials; ring signatures; RSA cryptosystems;
security analysis; side channel attacks; signature
schemes; stream ciphers; symmetric key cryptosystems",
subject = "Algorithm Analysis and Problem Complexity; Computer
Communication Networks; Computer Science; Computer
software; Data Encryption; Data encryption (Computer
science); Data protection; Information Systems;
Information Systems Applications; Management of
Computing and Information Systems; Systems and Data
Security",
tableofcontents = "A New Efficient Threshold Ring Signature Scheme
Based on Coding Theory \\
Square-Vinegar Signature Scheme \\
Attacking and Defending the McEliece Cryptosystem \\
McEliece Cryptosystem Implementation: Theory and
Practice \\
Merkle Tree Traversal Revisited \\
Explicit Hard Instances of the Shortest Vector Problem
\\
Practical-Sized Instances of Multivariate PKCs:
Rainbow, TTS, and?IC-Derivatives \\
Digital Signatures Out of Second-Preimage Resistant
Hash Functions \\
Cryptanalysis of Rational Multivariate Public Key
Cryptosystems \\
Syndrome Based Collision Resistant Hashing \\
Nonlinear Piece In Hand Perturbation Vector Method for
Enhancing Security of Multivariate Public Key
Cryptosystems \\
On the Power of Quantum Encryption Keys \\
Secure PRNGs from Specialized Polynomial Maps over Any
\\
MXL2: Solving Polynomial Equations over GF(2) Using an
Improved Mutant Strategy \\
Side Channels in the McEliece PKC",
xxeditor = "David Hutchison and Moni Naor and Doug Tygar and
Jintai Ding and Madhu Sudan and Takeo Kanade and Josef
Kittler and Moshe Y Vardi and C {Pandu Rangan} and
Gerhard Weikum and Jon M Kleinberg and John C Mitchell
and Oscar Nierstrasz and Bernhard Steffen and Johannes
Buchmann and Friedemann Mattern and Demetri
Terzopoulos",
}
@Proceedings{IEEE:2008:PAI,
editor = "{IEEE}",
booktitle = "{Proceedings of the 49th Annual IEEE Symposium on
Foundations of Computer Science: October 25--23, 2008,
Philadelphia, Pennsylvania, USA}",
title = "{Proceedings of the 49th Annual IEEE Symposium on
Foundations of Computer Science: October 25--23, 2008,
Philadelphia, Pennsylvania, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xvi + 835",
year = "2008",
ISBN = "0-7695-3436-8",
ISBN-13 = "978-0-7695-3436-7",
ISSN = "0272-5428",
LCCN = "QA76 .S95 2008",
bibdate = "Thu May 6 08:34:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/focs2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "IEEE Computer Society order number P3436.",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=4690923",
acknowledgement = ack-nhfb,
meetingname = "Symposium on Foundations of Computer Science (49th:
2008: Philadelphia, Pa.)",
subject = "electronic data processing; congresses; machine
theory",
}
@Proceedings{Jeffrey:2008:PAM,
editor = "David Jeffrey",
booktitle = "{Proceedings of the 21st annual meeting of the
International Symposium on Symbolic Computation, ISSAC
2008, July 20--23, 2008, Hagenberg, Austria}",
title = "{Proceedings of the 21st annual meeting of the
International Symposium on Symbolic Computation, ISSAC
2008, July 20--23, 2008, Hagenberg, Austria}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "x + 338",
year = "2008",
ISBN = "1-59593-904-0",
ISBN-13 = "978-1-59593-904-3",
LCCN = "????",
bibdate = "Fri Jun 20 08:53:37 2008",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Proceedings{ACM:2009:SPA,
editor = "{ACM}",
booktitle = "{STOC '09: proceedings of the 2009 ACM International
Symposium on Theory of Computing, Bethesda, Maryland,
USA, May 31--June 2, 2009}",
title = "{STOC '09: proceedings of the 2009 ACM International
Symposium on Theory of Computing, Bethesda, Maryland,
USA, May 31--June 2, 2009}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiii + 736",
year = "2009",
ISBN = "1-60558-613-7",
ISBN-13 = "978-1-60558-613-7",
LCCN = "QA75.5 .A22 2009",
bibdate = "Wed Sep 1 10:36:45 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.bibsys.no:2100/BIBSYS",
acknowledgement = ack-nhfb,
remark = "41st annual STOC meeting.",
}
@Proceedings{Bernstein:2009:PQC,
editor = "Daniel J. (Daniel Julius) Bernstein and Johannes
Buchmann and Erik Dahm{\'e}n",
booktitle = "{Post-quantum cryptography: [First International
Workshop on Post-Quantum Cryptography \ldots{} at the
Katholieke Universiteit Leuven in 2006]}",
title = "{Post-quantum cryptography: [First International
Workshop on Post-Quantum Cryptography \ldots{} at the
Katholieke Universiteit Leuven in 2006]}",
publisher = pub-SV,
address = pub-SV:adr,
pages = "viii + 245",
year = "2009",
ISBN = "3-540-88701-6 (hardcover), 3-642-10019-8 (softcover)",
ISBN-13 = "978-3-540-88701-0 (hardcover), 978-3-642-10019-2
(softcover)",
LCCN = "QA76.9.A25 P67 2009",
bibdate = "Thu Apr 21 17:10:30 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
acknowledgement = ack-nhfb,
subject = "data encryption (computer science); cryptography;
chiffrement (informatique); cryptographie",
tableofcontents = "Introduction to post-quantum cryptography / Daniel
J. Bernstein \\
Quantum computing / Sean Hallgren, Ulrich Vollmer \\
Hash-based digital signature schemes / Johannes
Buchmann, Erik Dahmen, Michael Szydlo \\
Code-based cryptography / Raphael Overbeck, Nicolas
Sendrier \\
Lattice-based cryptography / Daniele Micciancio, Oded
Regev \\
Multivariate public key cryptography / Jintai Ding,
Bo-Yin Yang",
}
@Proceedings{Bruguera:2009:PIS,
editor = "Javier D. Bruguera and Marius Cornea and Debjit
DasSarma and John Harrison",
booktitle = "{Proceedings of the 19th IEEE Symposium on Computer
Arithmetic, June 8--10, 2009, Portland, Oregon, USA}",
title = "{Proceedings of the 19th IEEE Symposium on Computer
Arithmetic, June 8--10, 2009, Portland, Oregon, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xi + 235",
year = "2009",
ISBN = "0-7695-3670-0, 1-4244-4329-6",
ISBN-13 = "978-0-7695-3670-5, 978-1-4244-4329-1",
ISSN = "1063-6889",
LCCN = "QA76.6 .S887 2009",
bibdate = "Fri Jun 12 12:24:37 2009",
bibsource = "http://www.ac.usc.es/arith19/;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
https://www.math.utah.edu/pub/tex/bib/fparith.bib;
https://www.math.utah.edu/pub/tex/bib/master.bib;
https://www.math.utah.edu/pub/tex/bib/mathcw.bib",
URL = "http://www.ac.usc.es/arith19/",
acknowledgement = ack-nhfb,
keywords = "ARITH-19",
tableofcontents = "Keynote Talk \\
Anton: A Specialized Machine for Millisecond-Scale
Molecular Dynamics Simulations of Proteins / David E.
Shaw / 3 \\
Session 1: Algorithms and Number Systems \\
Efficient Data Structure and Algorithms for Sparse
Integers, Sets and Predicates / Jean E. Vuillemin / 7
\\
A Dual-Purpose Real/Complex Logarithmic Number System
ALU / Mark G. Arnold and Sylvain Collange / 15 \\
Selected RNS Bases for Modular Multiplication / J. C.
Bajard, M. Kaihara, and T. Plantard / 25 \\
Invited Talk \\
A Historical Perspective on Computer Arithmetic /
Stanley Mazor / 35 \\
Session 2: Arithmetic Hardware \\
Higher Radix Squaring Operations Employing
Left-to-Right Dual Recoding / David W. Matula / 39 \\
Advanced Clockgating Schemes for
Fused-Multiply-Add-Type Floating-Point Units / Jochen
Preiss, Maarten Boersma, and Silvia Melitta Mueller /
48 \\
Unified Approach to the Design of Modulo-(2^n \pm 1)$
Adders Based on Signed-LSB Representation of Residues /
Ghassem Jaberipur and Behrooz Parhami / 57 \\
Session 3: Finite Fields and Cryptography \\
Subquadratic Space Complexity Multiplier for a Class of
Binary Fields Using Toeplitz Matrix Approach / M. A.
Hasan and C. Negre / 67 \\
Hybrid Binary-Ternary Joint Form and Its Application in
Elliptic Curve / Cryptography / Jithra Adikari, Vassil
Dimitrov, and Laurent Imbert / 76 \\
Polynomial Multiplication over Finite Fields Using
Field Extensions and Interpolation / Murat Cenk, Cetin
Kaya Koc, and Ferruh Ozbudak / 84 \\
Session 4: Mathematical Software \\
A New Binary Floating-Point Division Algorithm and Its
Software Implementation on the ST231 Processor /
Claude-Pierre Jeannerod, Herve Knochel, Christophe
Monat, Guillaume Revy, and Gilles Villard / 95 \\
Fast and Accurate Bessel Function Computation / John
Harrison / 104 \\
Implementation Specific Verification of Divide and
Square Root Instructions / Elena Guralnik, Ariel J.
Birnbaum, Anatoly Koyfinan, and Avi Kaplan / 114 \\
Session 5: Decimal Hardware \\
A Decimal Floating-Point Adder with Decoded Operands
and a Decimal Leading-Zero Anticipator / Liang-Kai Wang
and Michael J. Schulte / 125 \\
A High-Performance Significand BCD Adder with IEEE
754-2008 Decimal Rounding / Alvaro Vazquez and Elisardo
Antelo / 135 \\
Fully Redundant Decimal Arithmetic / Saeid Gorgin and
Ghassem Jaberipur / 145 \\
Session 6: Floating-Point Techniques \\
On the Computation of Correctly-Rounded Sums / P.
Kornerup, V. Lefevre, N. Louvet, and J. M. Muller / 155
\\
Multi-operand Floating-Point Addition / Alexandre F.
Tenca / 161 \\
Certified and Fast Computation of Supremum Norms of
Approximation Errors / Sylvain Chevillard, Mioara
Jolde{\c{s}}, and Christoph Lauter / 169 \\
Session 7: Decimal Transcendentals \\
Computation of Decimal Transcendental Functions Using
the CORDIC Algorithm / {\'A}lvaro V{\'a}zquez, Julio
Villalba, and Elisardo Antelo / 179 \\
Decimal Transcendentals via Binary / John Harrison /
187 \\
A 32-bit Decimal Floating-Point Logarithmic Converter /
Dongdong Chen, Yu Zhang, Younhee Choi, Moon Ho Lee, and
Seok-Bum Ko / 195 \\
Special Session on Automated Synthesis of Arithmetic
Operations \\
Datapath Synthesis for Standard-Cell Design / Reto
Zimmermann / 207 \\
Design Space Exploration for Power-Efficient
Mixed-Radix Ling Adders / Chung-Kuan Cheng / 212 \\
Challenges in Automatic Optimization of Arithmetic
Circuits / Ajay K. Verma, Philip Brisk, and Paolo Ienne
/ 213 \\
Panel on Decimal Arithmetic in Industry \\
Energy and Delay Improvement via Decimal Floating Point
Units / Hossam A. H. Fahmy, Ramy Raafat, Amira M.
Abdel-Majeed, Rodina Samy, Torek ElDeeb, and Yasmin
Farouk / 221 \\
IEEE 754-2008 Decimal Floating-Point for Intel
Architecture Processors / Marius Cornea / 225 \\
Special Session on Interval Arithmetic \\
IEEE Interval Standard Working Group --- P1788: Current
Status / William Edmonson and Guillaume Melquiond / 231
\\
Author Index",
}
@Proceedings{Chung:2009:ISA,
editor = "Kyo-Il Chung and Kiwook Sohn and Moti Yung",
booktitle = "{Information Security Applications: 9th International
Workshop, WISA 2008, Jeju Island, Korea, September
23--25, 2008, Revised Selected Papers}",
title = "{Information Security Applications: 9th International
Workshop, WISA 2008, Jeju Island, Korea, September
23--25, 2008, Revised Selected Papers}",
volume = "5379",
publisher = pub-SV,
address = pub-SV:adr,
pages = "277 (est.)",
year = "2009",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-00306-6",
ISBN = "3-642-00305-2 (print), 3-642-00306-0 (e-book)",
ISBN-13 = "978-3-642-00305-9 (print), 978-3-642-00306-6
(e-book)",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
LCCN = "????",
bibdate = "Wed Dec 19 15:21:30 MST 2012",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/lncs.bib",
series = ser-LNCS,
URL = "http://www.springerlink.com/content/978-3-642-00306-6",
acknowledgement = ack-nhfb,
}
@Proceedings{IEEE:2009:ISI,
editor = "IEEE",
booktitle = "{ICM '09: 21th [sic] International Conference on
Microelectronics (ICM 2009): took place from Dec 19,
2009 to Dec 22, 2009 in Marrakech, Morocco}",
title = "{ICM '09: 21th [sic] International Conference on
Microelectronics (ICM 2009): took place from Dec 19,
2009 to Dec 22, 2009 in Marrakech, Morocco}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "????",
year = "2009",
ISBN = "1-4244-5814-5, 1-4244-5816-1",
ISBN-13 = "978-1-4244-5814-1, 978-1-4244-5816-5",
LCCN = "TK7870 2009",
bibdate = "Thu Apr 21 10:34:45 MDT 2011",
bibsource = "fsz3950.oclc.org:210/WorldCat;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5412667",
acknowledgement = ack-nhfb,
meetingname = "International Conference on Microelectronics (1988- )
(21st : 2009 : Marrakech, Morocco)",
subject = "printed circuits; congresses; integrated circuits;
microelectronics",
}
@Proceedings{IEEE:2009:PAI,
editor = "{IEEE}",
booktitle = "{Proceedings of the 50th Annual IEEE Symposium on
Foundations of Computer Science: October 25--27, 2009,
Atlanta, Georgia, USA}",
title = "{Proceedings of the 50th Annual IEEE Symposium on
Foundations of Computer Science: October 25--27, 2009,
Atlanta, Georgia, USA}",
publisher = pub-IEEE,
address = pub-IEEE:adr,
pages = "xvi + 835",
year = "2009",
ISBN = "0-7695-3850-9",
ISBN-13 = "978-0-7695-3850-1",
LCCN = "QA76 .S95 2009",
bibdate = "Thu May 6 08:34:02 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
melvyl.cdlib.org:210/CDL90",
note = "IEEE Computer Society order number P3850.",
acknowledgement = ack-nhfb,
subject = "electronic data processing; congresses; machine
theory",
}
@Book{Maas:2009:SRW,
author = "Ad Maas and Hans Hooijmaijers",
booktitle = "Scientific research in {World War II}: what scientists
did in the war",
title = "Scientific research in {World War II}: what scientists
did in the war",
publisher = "Routledge/Taylor and Francis",
address = "New York, NY",
pages = "xii + 240",
year = "2009",
ISBN = "0-203-88318-7 (e-book), 0-7103-1340-3 (hardcover)",
ISBN-13 = "978-0-203-88318-1 (e-book), 978-0-7103-1340-9
(hardcover)",
LCCN = "Q141 .H195 2009",
bibdate = "Sat May 14 10:03:20 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.loc.gov:7090/Voyager",
series = "Routledge studies in modern history",
URL = "http://www.loc.gov/catdir/toc/ecip0824/2008033118.html",
acknowledgement = ack-nhfb,
subject = "Scientists; History; 20th century; Congresses; World
War, 1939-1945; Science; Research",
tableofcontents = "Introduction : Ordinary scientists in extraordinary
circumstances / Ad Maas \\
The mobilization of science and science-based
technology during the Second World War : a comparative
history / Mark Walker \\
To work or not to work in war research? The case of the
Italian physicist G. P. S. Occhialini during World War
II / Leonardo Gariboldi \\
Scientific research in the Second World War : the case
for Bacinol, Dutch penicillin / Marlene Burns \\
Preventing theft : the Kamerlingh Onnes Laboratory in
wartime / Dirk van Delft \\
Electron microscopy in Second World War Delft / Marian
Fournier \\
`Splendid isolation`? Aviation medicine in World War II
/ Alexander von L{\"u}nen \\
National Socialism, human genetics and eugenics in the
Netherlands, 1940--1945 / Stephen Snelders \\
The birth of a modern instrument and its development
during World War II : electron microscopy in Germany
from the 1930s to 1945 / Falk M{\"u}ller \\
Aerodynamic research at the Nationaal
Luchtvaartlaboratorium (NLL) in Amsterdam under German
occupation during World War II / Florian Schmaltz \\
Masa Takeuchi and his involvement in the Japanese
nuclear weapons research programme / Masakatsu Yamazaki
\\
The cyclotron and the war : construction of the 60-inch
cyclotron in Japan / Keiko Nagase-Reimer \\
Forging a new discipline : reflections on the wartime
infrastructure for research and development in feedback
control in the US, the UK, Germany and the USSR / Chris
C. Bissell \\
British cryptanalysis : the breaking of `Fish' traffic
/ J. V. Field",
}
@Proceedings{May:2009:PIS,
editor = "John P. May",
booktitle = "{Proceedings of the 2009 international symposium on
Symbolic and algebraic computation, KIAS, Seoul, Korea,
July 28--31, 2009}",
title = "{Proceedings of the 2009 international symposium on
Symbolic and algebraic computation, KIAS, Seoul, Korea,
July 28--31, 2009}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xi + 389",
year = "2009",
ISBN = "1-60558-609-9",
ISBN-13 = "978-1-60558-609-0",
LCCN = "????",
bibdate = "Fri Jun 20 08:53:37 2009",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib",
acknowledgement = ack-nhfb,
}
@Book{Rousseau:2009:MT,
editor = "Christiane Rousseau and Yvan Saint-Aubin",
booktitle = "Math{\'e}matiques et Technologie",
title = "Math{\'e}matiques et Technologie",
publisher = pub-SV,
address = pub-SV:adr,
pages = "????",
year = "2009",
DOI = "https://doi.org/10.1007/978-0-387-69213-5",
ISBN = "0-387-69213-4",
ISBN-13 = "978-0-387-69213-5",
LCCN = "????",
bibdate = "Tue Jul 20 16:39:29 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
series = "Springer Undergraduate Texts in Mathematics and
Technology",
URL = "http://d-nb.info/997902213/34;
http://nbn-resolving.de/urn:nbn:de:1111-20091103138;
http://www.springerlink.com/content/r61844",
acknowledgement = ack-nhfb,
language = "French",
subject = "Computer science; Distribution (Probability theory);
Mathematics; PageRank",
}
@Proceedings{Seamons:2009:IPS,
editor = "Kent Seamons and Neal McBurnett and Tim Polk and
others",
booktitle = "{IDtrust2009: proceedings of the 8th Symposium on
Identity and Trust on the Internet: April 14--16, 2009,
Gaitherburg, Maryland, USA}",
title = "{IDtrust2009: proceedings of the 8th Symposium on
Identity and Trust on the Internet: April 14--16, 2009,
Gaitherburg, Maryland, USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 117",
year = "2009",
ISBN = "1-60558-474-6",
ISBN-13 = "978-1-60558-474-4",
LCCN = "QA76.9.A25 S954 2009",
bibdate = "Thu Apr 21 10:08:58 MDT 2011",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
library.mit.edu:9909/mit01",
URL = "http://portal.acm.org/toc.cfm?id=1527017&coll=portal&dl=ACM",
acknowledgement = ack-nhfb,
meetingname = "Symposium on Identity and Trust on the Internet (8th:
2009: Gaithersburg, MD)",
subject = "Computer security; Congresses; Computer networks;
Security measures; Access control; Public key
infrastructure (Computer security)",
}
@Proceedings{ACM:2010:PAI,
editor = "{ACM}",
booktitle = "{Proceedings of the 2010 ACM International Symposium
on Theory of Computing: June 5--8, 2010, Cambridge, MA,
USA}",
title = "{Proceedings of the 2010 ACM International Symposium
on Theory of Computing: June 5--8, 2010, Cambridge, MA,
USA}",
publisher = pub-ACM,
address = pub-ACM:adr,
pages = "xiv + 797",
year = "2010",
ISBN = "1-60558-817-2",
ISBN-13 = "978-1-60558-817-9",
LCCN = "QA 76.6 .A152 2010",
bibdate = "Wed Sep 1 10:37:53 MDT 2010",
bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
z3950.gbv.de:20011/gvk",
URL = "http://www.gbv.de/dms/tib-ub-hannover/63314455x.",
acknowledgement = ack-nhfb,
remark = "42nd annual STOC meeting.",
}
@Book{Copeland:2010:CSB,
editor = "B. Jack Copeland",
booktitle = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
title = "{Colossus}: the secrets of {Bletchley Park}'s
codebreaking computers",
publisher = pub-OXFORD,
address = pub-OXFORD:adr,
pages = "xvi + 462 + 16",
year = "2010",
ISBN = "0-19-284055-X (hardcover), 0-19-957814-1 (paperback)",
ISBN-13 = "978-0-19-284055-4 (hardcover), 978-0-19-957814-6
(paperback)",
LCCN = "D810.C88 C66 2010",
bibdate = "Mon Mar 12 13:35:02 MDT 2012",
bibsource = "https://www.math.utah.edu/pub/bibnet/authors/t/turing-alan-mathison.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib;
https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib;
library.ox.ac.uk:210/ADVANCE",
URL = "http://www.colossus-computer.com/",
acknowledgement = ack-nhfb,
remark = "Originally published: 2006.",
subject = "Lorenz cipher system; World War, 1939--1945;
Cryptography; Electronic intelligence; Great Britain;
History; Germany; Computers",
tableofcontents = "A brief history of cryptography from Caesar to
Bletchley Park / Simon Singh \\
How it began: Bletchley Park goes to war / Michael
Smith \\
The German Tunny machine / Jack Copeland \\
Colossus, codebreaking, and the digital age / Stephen
Budiansky \\
Machine against machine / Jack Copeland \\
D-Day at Bletchley Park / Thomas H. Flowers \\
Intercept! / Jack Copeland \\
Colossus / Thomas H. Flowers \\
Colossus and the rise of the modern computer / Jack
Copeland \\
The PC user's guide to Colossus / Benjamin Wells \\
Of men and machines / Brian Randell \\
The Colossus rebuild / Tony Sale \\
Mr. Newman's section / Jack Copeland, with Catherine
Caughey \ldots{} [et al.] \\
Max Newman: mathematician, codebreaker, and computer
pioneer / William Newman \\
Living with Fish: breaking Tunny in the Newmanry and
the Testery / Peter Hilton \\
From Hut 8 to the Newmanry / Irving John ``Jack'' Good
\\
Codebreaking and Colossus / Donald Michie \\
Major Tester's section / Jerry Roberts \\
Setter and breaker / Roy Jenkins \\
An ATS girl in the Testery / Helen Currie \\
The Testery and the breaking of Fish / Peter Edgerley
\\
Dollis Hill at war / Jack Copeland, with David Bolam
\ldots{} [et al.] \\
The British Tunny machine / Gil Hayward \\
How Colossus was built and operated: one of its
engineers reveals its secrets / Harry Fensom \\
Bletchley Park's Sturgeon: the Fish that laid no eggs /
Frode Weierud \\
German teleprinter traffic and Swedish wartime
intelligence / Craig McKay",
}
