Last update:
Sat Oct 14 16:18:15 MDT 2017
Ralph-Johan Back SFI: A Refinement Based Layered Software
Architecture . . . . . . . . . . . . . . 1
Shaoying Liu Developing Quality Software Systems
Using the SOFL Formal Engineering Method 3
Mark A. Hale Maintaining Referential Integrity on the
Web . . . . . . . . . . . . . . . . . . 20
Richard Jüllig Formal Methods in Enterprise Computing 22
Jim Woodcock and
Arthur Hughes Unifying Theories of Parallel
Programming . . . . . . . . . . . . . . 24
Hong Mei and
Feng Chen and
Qianxiang Wang and
Yao-Dong Feng ABC/ADL: An ADL Supporting Component
Composition . . . . . . . . . . . . . . 38
Hong Zheng and
Shi-xian Li The Description of CORBA Objects Based
on Petri Nets . . . . . . . . . . . . . 48
Maritta Heisel and
Thomas Santen and
Jeanine Souqui\`eres Toward a Formal Model of Software
Components . . . . . . . . . . . . . . . 57
Jing Liu and
Huaikou Miao and
Xiaolei Gao A Specification-Based Software
Construction Framework for Reuse . . . . 69
Xuejun Chen Specifying a Component Model for
Building Dynamically Reconfigurable
Distributed Systems . . . . . . . . . . 80
Vasu Alagar and
Ralf Lämmel Three-Tiered Specification of
Micro-architectures . . . . . . . . . . 92
Jiayue Chang and
Huadong Ma Modeling the Architecture for
Component-Based E-commerce System . . . 98
Fei Cao and
Barrett R. Bryant and
Rajeev R. Raje and
Mikhail Auguston and
Andrew M. Olson and
Carol C. Burt Component Specification and Wrapper/Glue
Code Generation with Two-Level Grammar
Using Domain Specific Knowledge . . . . 103
Graeme Smith and
John Derrick Abstract Specification in Object-Z and
CSP . . . . . . . . . . . . . . . . . . 108
J. Christian Attiogbé Mechanization of an Integrated Approach:
Shallow Embedding into SAL/PVS . . . . . 120
David R. Musser and
Zhiqing Shao Concept Use or Concept Refinement: An
Important Distinction in Building
Generic Specifications . . . . . . . . . 132
Kenji Taguchi and
Jin Song Dong An Overview of Mobile Object-Z . . . . . 144
Jin Song Dong and
Jing Sun and
Hai Wang Z Approach to Semantic Web . . . . . . . 156
Shengchao Qin and
Jifeng He and
Zongyan Qiu and
Naixiao Zhang Hardware/Software Partitioning in
Verilog . . . . . . . . . . . . . . . . 168
Adriano Pereira and
Mark Song and
Gustavo Gorgulho and
Wagner Meira Jr. and
Sérgio Campos A Formal Methodology to Specify
E-commerce Systems . . . . . . . . . . . 180
Tim Miller and
Paul Strooper Model-Based Specification Animation
Using Testgraphs . . . . . . . . . . . . 192
Alvaro E. Arenas An Abstract Model for Scheduling
Real-Time Programs . . . . . . . . . . . 204
Olfa Mosbahi and
Leila Jemni and
Samir Ben Ahmed and
Jacques Jaray A Specification and Validation Technique
Based on STATEMATE and FNLOG . . . . . . 216
Yuyue Du and
Changjun Jiang Formal Representation and Analysis of
Batch Stock Trading Systems by Logical
Petri Net Workflows . . . . . . . . . . 221
Jinfeng Huang and
Ad Verschueren and
Henri Aalderink and
Johan Lukkien A Calculus for Mobile Network Systems 226
Guangyuan Li and
Zhisong Tang Modelling Real-Time Systems with
Continuous-Time Temporal Logic . . . . . 231
Ying Liu and
Naixiao Zhang On Concept-Based Definition of
Domain-Specific Languages . . . . . . . 237
Hong Zhu Formal Specification of Evolutionary
Software Agents . . . . . . . . . . . . 249
Yuan Liu and
Baowen Xu and
Zhenqiang Chen Detecting Deadlock in Ada Rendezvous
Flow Structure Based on Process Algebra 262
Huiqun Yu and
Xudong He and
Yi Deng and
Lian Mo Formal Analysis of Real-Time Systems
with SAM . . . . . . . . . . . . . . . . 275
Muan Yong Ng and
Michael Butler Tool Support for Visualizing CSP in UML 287
Orieta Celiku and
Joakim von Wright Theorem Prover Support for Precondition
and Correctness Calculation . . . . . . 299
Jin Song Dong and
Yuan Fang Li and
Jing Sun and
Jun Sun and
Hai Wang XML-Based Static Type Checking and
Dynamic Visualization for TCOZ . . . . . 311
Doug Goldson and
Greg Reeve and
Steve Reeves $ \mu $-Chart-Based Specification and
Refinement . . . . . . . . . . . . . . . 323
Sibylle Peuker and
Ian Hayes Towards a Refinement Calculus for
Concurrent Real-Time Programs . . . . . 335
Adolfo Duran and
Ana Cavalcanti and
Augusto Sampaio Refinement Algebra for Formal Bytecode
Generation . . . . . . . . . . . . . . . 347
Jessica Chen Formal Modelling of Java GUI Event
Handling . . . . . . . . . . . . . . . . 359
Ana Cavalli and
Stéphane Maag A New Algorithm for Service Interaction
Detection . . . . . . . . . . . . . . . 371
Juha Plosila and
Tiberiu Seceleanu Specification of an Asynchronous On-chip
Bus . . . . . . . . . . . . . . . . . . 383
Jun Pang Analysis of a Security Protocol in $ \mu
$CRL . . . . . . . . . . . . . . . . . . 396
Gafurov Davrondjon and
Tomasz Janowski Developing a Spell-Checker for Tajik
Using RAISE . . . . . . . . . . . . . . 401
Zarina Shukur and
Abdullah Md. Zin and
Ainita Ban M2Z: A Tool for Translating a Natural
Language Software Specification into Z 406
Hugh Anderson Abstract Interpretation with a Theorem
Prover . . . . . . . . . . . . . . . . . 411
Abhik Roychoudhury Formal Reasoning about Hardware and
Software Memory Models . . . . . . . . . 423
Ji Wang and
Wei Dong and
Zhi-Chang Qi Slicing Hierarchical Automata for Model
Checking UML Statecharts . . . . . . . . 435
M. Hasan Zobair and
Sofi\`ene Tahar Formal Verification of a SONET Telecom
System Block . . . . . . . . . . . . . . 447
Amr T. Abdel-Hamid and
Sofi\`ene Tahar and
John Harrison Enabling Hardware Verification through
Design Changes . . . . . . . . . . . . . 459
Guido Wimmel and
Jan Jürjens Specification-Based Test Generation for
Security-Critical Systems Using
Mutations . . . . . . . . . . . . . . . 471
Hassan Diab and
Marc Frappier and
Richard St-Denis A Formal Definition of Function Points
for Automated Measurement of B
Specifications . . . . . . . . . . . . . 483
Fan Guo and
YiYun Chen and
RongGui Hu Machine Code Type Safety . . . . . . . . 495
Yan-Bing Jiang and
Wei-Zhong Shao and
Zhi-Yi Ma and
Yao-Dong Feng On the Formalized Semantics of Static
Modeling Elements in UML . . . . . . . . 500
Ahmed Hammad and
Bruno Tatibouët and
Jean-Christophe Voisinet and
Weiping Wu From a B Specification to UML StateChart
Diagrams . . . . . . . . . . . . . . . . 511
Huaikou Miao and
Ling Liu and
Li Li Formalizing UML Models with Object-Z . . 523
Zhiming Liu and
Xiaoshan Li and
Jifeng He Using Transition Systems to Unify UML
Models . . . . . . . . . . . . . . . . . 535
Soon-Kyeong Kim and
David Carrington A Formal Metamodeling Approach to a
Transformation between the UML State
Machine and Object-Z . . . . . . . . . . 548
Behzad Bordbar and
John Derrick and
Gill Waters A UML Approach to the Design of Open
Distributed Systems . . . . . . . . . . 561
Subash Shankar A Semantic Model of Real-Time UML . . . 573
Zhong Ming and
Shi-xian Li and
Xiu-rong Fang Research on Ontology-Oriented Domain
Analysis on MIS . . . . . . . . . . . . 578
Zaobin Gan and
Chuanbo Chen and
Xiandeng Pei A Requirements Description Model Based
on Conditional Directed Graphs . . . . . 583
Graeme Smith Introducing Reference Semantics via
Refinement . . . . . . . . . . . . . . . 588
Huibiao Zhu and
Jonathan P. Bowen and
Jifeng He Soundness, Completeness and
Non-redundancy of Operational Semantics
for Verilog Based on Denotational
Semantics . . . . . . . . . . . . . . . 600
Adnan Sherif and
Jifeng He Towards a Time Model for \em Circus . . 613
Anonymous Author Index . . . . . . . . . . . . . . 625
Mihir Bellare and
Bennet Yee Forward-Security in Private-Key
Cryptography . . . . . . . . . . . . . . 1--18
Yevgeniy Dodis and
Matt Franklin and
Jonathan Katz and
Atsuko Miyaji and
Moti Yung Intrusion-Resilient Public-Key
Encryption . . . . . . . . . . . . . . . 19--32
Kaoru Kurosawa and
Tetsu Iwata TMAC: Two-Key CBC MAC . . . . . . . . . 33--49
Douglas L. Whiting and
Michael J. Sabin Montgomery Prime Hashing for Message
Authentication . . . . . . . . . . . . . 50--67
Jung-Yeun Lee and
Jung Hee Cheon and
Seungjoo Kim An Analysis of Proxy Signatures: Is a
Secure Channel Necessary? . . . . . . . 68--79
Steven D. Galbraith and
Wenbo Mao Invisibility and Anonymity of Undeniable
and Confirmer Signatures . . . . . . . . 80--97
Dan Boneh and
Ilya Mironov and
Victor Shoup A Secure Signature Scheme from Bilinear
Maps . . . . . . . . . . . . . . . . . . 98--110
Nigel P. Smart Access Control Using Pairing Based
Cryptography . . . . . . . . . . . . . . 111--121
Jeffrey Hoffstein and
Nick Howgrave-Graham and
Jill Pipher and
Joseph H. Silverman and
William Whyte NTRUSIGN: Digital Signatures Using the
NTRU Lattice . . . . . . . . . . . . . . 122--140
Nicolas T. Courtois and
Jacques Patarin About the XL Algorithm over $ {GF}(2) $ 141--157
Guido Bertoni and
Jorge Guajardo and
Sandeep Kumar and
Gerardo Orlando and
Christof Paar and
Thomas Wollinger Efficient $ {GF}(p^m) $ Arithmetic
Architectures for Cryptographic
Applications . . . . . . . . . . . . . . 158--175
Lu Xiao and
Howard M. Heys Hardware Performance Characterization of
Block Cipher Structures . . . . . . . . 176--192
Xuhua Ding and
Gene Tsudik Simple Identity-Based Cryptography with
Mediated RSA . . . . . . . . . . . . . . 193--210
John Malone-Lee and
Wenbo Mao Two Birds One Stone: Signcryption Using
RSA . . . . . . . . . . . . . . . . . . 211--225
Tom Berson Cryptography after the Bubble: How to
Make an Impact on the World . . . . . . 226--226
Seungjoo Kim and
Masahiro Mambo and
Yuliang Zheng Rethinking Chosen-Ciphertext Security
under Kerckhoffs' Assumption . . . . . . 227--243
Bodo Möller Provably Secure Public-Key Encryption
for Length-Preserving Chaumian Mixes . . 244--262
Paolo D'Arco and
Douglas R. Stinson Fault Tolerant and Distributed Broadcast
Encryption . . . . . . . . . . . . . . . 263--280
Huaxiong Wang and
Josef Pieprzyk Shared Generation of Pseudo-Random
Functions with Cumulative Maps . . . . . 281--294
Michael T. Goodrich and
Roberto Tamassia and
Nikos Triandopoulos and
Robert Cohen Authenticated Data Structures for Graph
and Geometric Searching . . . . . . . . 295--313
Markus Jakobsson and
Tom Leighton and
Silvio Micali and
Michael Szydlo Fractal Merkle Tree Representation and
Traversal . . . . . . . . . . . . . . . 314--326
Adi Shamir RSA Shortcuts . . . . . . . . . . . . . 327--327
Katsuyuki Okeya and
Tsuyoshi Takagi The Width-$w$ NAF Method Provides Small
Memory and Fast Elliptic Scalar
Multiplications Secure against Side
Channel Attacks . . . . . . . . . . . . 328--342
Peter L. Montgomery and
Kirsten Eisenträger and
Kristin Lauter Fast Elliptic Curve Arithmetic and
Improved Weil Pairing Evaluation . . . . 343--354
Shouhuai Xu and
Ravi Sandhu Two Efficient and Provably Secure
Schemes for Server-Assisted Threshold
Signatures . . . . . . . . . . . . . . . 355--372
Rosario Gennaro and
Stanislaw Jarecki and
Hugo Krawczyk and
Tal Rabin Secure Applications of Pedersen's
Distributed Key Generation Protocol . . 373--390
Colin D. Walter Seeing through MIST Given a Small
Fraction of an RSA Private Key . . . . . 391--402
Claude Crépeau and
Alain Slakmon Simple Backdoors for RSA Key Generation 403--416
Anonymous Front Matter . . . . . . . . . . . . . . i--xiv
Antoine Joux Cryptanalysis of the EMD Mode of
Operation . . . . . . . . . . . . . . . 1--16
Pascal Junod On the Optimality of Linear,
Differential, and Sequential
Distinguishers . . . . . . . . . . . . . 17--32
Alex Biryukov and
Christophe De Canni\`ere and
An Braeken and
Bart Preneel A Toolbox for Cryptanalysis: Linear and
Affine Equivalence Algorithms . . . . . 33--50
Matthias Fitzi and
Martin Hirt and
Thomas Holenstein and
Jürg Wullschleger Two-Threshold Broadcast and Detectable
Multi-party Computation . . . . . . . . 51--67
Ran Canetti and
Eyal Kushilevitz and
Yehuda Lindell On the Limitations of Universally
Composable Two-Party Computation without
Set-up Assumptions . . . . . . . . . . . 68--86
Benny Pinkas Fair Secure Two-Party Computation . . . 87--105
Kris Gaj and
Arkadiusz Or\lowski Facts and Myths of Enigma: Breaking
Stereotypes . . . . . . . . . . . . . . 106--122
Yunlei Zhao and
Xiaotie Deng and
C. H. Lee and
Hong Zhu Resettable Zero-Knowledge in the Weak
Public-Key Model . . . . . . . . . . . . 123--139
Daniele Micciancio and
Erez Petrank Simulatable Commitments and Efficient
Concurrent Zero-Knowledge . . . . . . . 140--159
Rafael Pass Simulation in Quasi-Polynomial Time, and
Its Application to Protocol Composition 160--176
Juan A. Garay and
Philip MacKenzie and
Ke Yang Strengthening Zero-Knowledge Protocols
Using Signatures . . . . . . . . . . . . 177--194
Gustav Hast Nearly One-Sided Tests and the
Goldreich--Levin Predicate . . . . . . . 195--210
Jonathan Katz Efficient and Non-malleable Proofs of
Plaintext Knowledge and Applications . . 211--228
Daniel Augot and
Matthieu Finiasz A Public Key Encryption Scheme Based on
the Polynomial Reconstruction Problem 229--240
Yehuda Lindell A Simpler Construction of CCA2-Secure
Public-Key Encryption under General
Assumptions . . . . . . . . . . . . . . 241--254
Ran Canetti and
Shai Halevi and
Jonathan Katz A Forward-Secure Public-Key Encryption
Scheme . . . . . . . . . . . . . . . . . 255--271
Craig Gentry Certificate-Based Encryption and the
Certificate Revocation Problem . . . . . 272--293
Luis von Ahn and
Manuel Blum and
Nicholas J. Hopper and
John Langford CAPTCHA: Using Hard AI Problems for
Security . . . . . . . . . . . . . . . . 294--311
Yevgeniy Dodis and
Jee Hea An Concealment and Its Applications to
Authenticated Encryption . . . . . . . . 312--329
Patrik Ekdahl and
Willi Meier and
Thomas Johansson Predicting the Shrinking Generator with
Fixed Connections . . . . . . . . . . . 330--344
Nicolas T. Courtois and
Willi Meier Algebraic Attacks on Stream Ciphers with
Linear Feedback . . . . . . . . . . . . 345--359
Reynald Lercier and
David Lubicz Counting Points on Elliptic Curves over
Finite Fields of Small Characteristic in
Quasi Quadratic Time . . . . . . . . . . 360--373
Florian Hess The GHS Attack Revisited . . . . . . . . 374--387
Mathieu Ciet and
Tanja Lange and
Francesco Sica and
Jean-Jacques Quisquater Improved Algorithms for Efficient
Arithmetic on Elliptic Curves Using Fast
Endomorphisms . . . . . . . . . . . . . 388--400
Eu-Jin Goh and
Stanis\law Jarecki A Signature Scheme as Secure as the
Diffie--Hellman Problem . . . . . . . . 401--415
Dan Boneh and
Craig Gentry and
Ben Lynn and
Hovav Shacham Aggregate and Verifiably Encrypted
Signatures from Bilinear Maps . . . . . 416--432
Michael Szydlo Hypercubic Lattice Reduction and
Analysis of GGH and NTRU Signatures . . 433--448
Jacques Stern Why Provable Security Matters? . . . . . 449--461
Pierre-Alain Fouque and
Guillaume Poupard On the Security of RDSA . . . . . . . . 462--476
Eonkyung Lee and
Je Hong Park Cryptanalysis of the Public-Key
Encryption Based on Braid Groups . . . . 477--490
Mihir Bellare and
Tadayoshi Kohno A Theoretical Treatment of Related-Key
Attacks: RKA-PRPs, RKA-PRFs, and
Applications . . . . . . . . . . . . . . 491--506
Mario Di Raimondo and
Rosario Gennaro Provably Secure Threshold
Password-Authenticated Key Exchange . . 507--523
Rosario Gennaro and
Yehuda Lindell A Framework for Password-Based
Authenticated Key Exchange . . . . . . . 524--543
Ueli Maurer and
Krzysztof Pietrzak The Security of Many-Round Luby--Rackoff
Pseudo-Random Permutations . . . . . . . 544--561
Renato Renner and
Stefan Wolf New Bounds in Secret-Key Agreement: The
Gap between Formation and Secrecy
Extraction . . . . . . . . . . . . . . . 562--577
Jonathan Katz and
Rafail Ostrovsky and
Adam Smith Round Efficiency of Multi-party
Computation with a Dishonest Majority 578--595
Ronald Cramer and
Serge Fehr and
Yuval Ishai and
Eyal Kushilevitz Efficient Multi-party Computation over
Rings . . . . . . . . . . . . . . . . . 596--613
Mihir Bellare and
Daniele Micciancio and
Bogdan Warinschi Foundations of Group Signatures: Formal
Definitions, Simplified Requirements,
and a Construction Based on General
Assumptions . . . . . . . . . . . . . . 614--629
Aggelos Kiayias and
Moti Yung Extracting Group Signatures from Traitor
Tracing Schemes . . . . . . . . . . . . 630--648
Anonymous Back Matter . . . . . . . . . . . . . . 649--649
Adi Shamir and
Eran Tromer Factoring Large Numbers with the TWIRL
Device . . . . . . . . . . . . . . . . . 1--26
Johannes Blömer and
Alexander May New Partial Key Exposure Attacks on RSA 27--43
Jean-Charles Faug\`ere and
Antoine Joux Algebraic Cryptanalysis of Hidden Field
Equation (HFE) Cryptosystems Using
Gröbner Bases . . . . . . . . . . . . . . 44--60
Salil P. Vadhan On Constructing Locally Computable
Extractors and Cryptosystems in the
Bounded Storage Model . . . . . . . . . 61--77
Renato Renner and
Stefan Wolf Unconditional Authenticity and Privacy
from an Arbitrarily Weak Secret . . . . 78--95
Moni Naor On Cryptographic Assumptions and
Challenges . . . . . . . . . . . . . . . 96--109
Jonathan Katz and
Moti Yung Scalable Protocols for Authenticated
Group Key Exchange . . . . . . . . . . . 110--125
Jan Camenisch and
Victor Shoup Practical Verifiable Encryption and
Decryption of Discrete Logarithms . . . 126--144
Yuval Ishai and
Joe Kilian and
Kobbi Nissim and
Erez Petrank Extending Oblivious Transfers
Efficiently . . . . . . . . . . . . . . 145--161
Frederik Armknecht and
Matthias Krause Algebraic Attacks on Combiners with
Memory . . . . . . . . . . . . . . . . . 162--175
Nicolas T. Courtois Fast Algebraic Attacks on Stream Ciphers
with Linear Feedback . . . . . . . . . . 176--194
Alex Biryukov and
Christophe De Canni\`ere and
Gustaf Dellkrantz Cryptanalysis of Safer++ . . . . . . . . 195--211
Jung Hee Cheon and
Byungheup Jun A Polynomial Time Algorithm for the
Braid Diffie--Hellman Conjugacy Problem 212--225
Nick Howgrave-Graham and
Phong Q. Nguyen and
David Pointcheval and
John Proos and
Joseph H. Silverman and
Ari Singer and
William Whyte The Impact of Decryption Failures on the
Security of NTRU Encryption . . . . . . 226--246
Ivan Damgård and
Jesper Buus Nielsen Universally Composable Efficient
Multiparty Computation from Threshold
Homomorphic Encryption . . . . . . . . . 247--264
Ran Canetti and
Tal Rabin Universal Composition with Joint State 265--281
Daniele Micciancio and
Salil P. Vadhan Statistical Zero-Knowledge Proofs with
Efficient Provers: Lattice Problems and
More . . . . . . . . . . . . . . . . . . 282--298
Boaz Barak and
Shien Jin Ong and
Salil Vadhan Derandomization in Cryptography . . . . 299--315
Rafael Pass On Deniability in the Common Reference
String and Random Oracle Model . . . . . 316--337
Qi Cheng Primality Proving via One Round in ECPP
and One Iteration in AKS . . . . . . . . 338--348
Karl Rubin and
Alice Silverberg Torus-Based Cryptography . . . . . . . . 349--365
Yuichi Komano and
Kazuo Ohta Efficient Universal Padding Techniques
for Multiplicative Trapdoor One-Way
Permutation . . . . . . . . . . . . . . 366--382
Xavier Boyen Multipurpose Identity-Based
Signcryption: A Swiss Army Knife for
Identity-Based Cryptography . . . . . . 383--399
Hugo Krawczy SIGMA: The ``SIGn-and-MAc'' Approach to
Authenticated Diffie--Hellman and Its
Use in the IKE Protocols . . . . . . . . 400--425
Cynthia Dwork and
Andrew Goldberg and
Moni Naor On Memory-Bound Functions for Fighting
Spam . . . . . . . . . . . . . . . . . . 426--444
Niv Buchbinder and
Erez Petrank Lower and Upper Bounds on Obtaining
History Independence . . . . . . . . . . 445--462
Yuval Ishai and
Amit Sahai and
David Wagner Private Circuits: Securing Hardware
against Probing Attacks . . . . . . . . 463--481
Shai Halevi and
Phillip Rogaway A Tweakable Enciphering Mode . . . . . . 482--499
Matthew Cary and
Ramarathnam Venkatesan A Message Authentication Code Based on
Unimodular Matrix Groups . . . . . . . . 500--512
Jacques Patarin Luby--Rackoff: $7$ Rounds Are Enough for
Security . . . . . . . . . . . . . . . . 513--529
Omer Horvitz and
Virgil Gligor Weak Key Authenticity and the
Computational Completeness of Formal
Encryption . . . . . . . . . . . . . . . 530--547
Jonathan Herzog and
Moses Liskov and
Silvio Micali Plaintext Awareness via Key Registration 548--564
Ran Canetti and
Hugo Krawczyk and
Jesper B. Nielsen Relaxing Chosen-Ciphertext Security . . 565--582
Brice Canvel and
Alain Hiltgen and
Serge Vaudenay and
Martin Vuagnoux Password Interception in a SSL/TLS
Channel . . . . . . . . . . . . . . . . 583--599
Elad Barkan and
Eli Biham and
Nathan Keller Instant Ciphertext-Only Cryptanalysis of
GSM Encrypted Communication . . . . . . 600--616
Philippe Oechslin Making a Faster Cryptanalytic
Time-Memory Trade-Off . . . . . . . . . 617--630
Frank Stajano The Security Challenges of Ubiquitous
Computing . . . . . . . . . . . . . . . 1--1
Dakshi Agrawal and
Josyula R. Rao and
Pankaj Rohatgi Multi-channel Attacks . . . . . . . . . 2--16
Chris Karlof and
David Wagner Hidden Markov Model Cryptanalysis . . . 17--34
Sìddìka Berna Örs and
Elisabeth Oswald and
Bart Preneel Power-Analysis Attacks on an FPGA ---
First Experimental Results . . . . . . . 35--50
Willi Geiselmann and
Rainer Steinwandt Hardware to Solve Sparse Systems of
Linear Equations over $ \mathrm {GF}(2)
$ . . . . . . . . . . . . . . . . . . . 51--61
Yukiyasu Tsunoo and
Teruo Saito and
Tomoyasu Suzaki and
Maki Shigeri and
Hiroshi Miyauchi Cryptanalysis of DES Implemented on
Computers with Cache . . . . . . . . . . 62--76
Gilles Piret and
Jean-Jacques Quisquater A Differential Fault Attack Technique
against SPN Structures, with Application
to the AES and KHAZAD . . . . . . . . . 77--88
Jean-Sébastien Coron and
Alexei Tchulkine A New Algorithm for Switching from
Arithmetic to Boolean Masking . . . . . 89--97
Jovan D. Goli\'c DeKaRT: A New Paradigm for Key-Dependent
Reversible Circuits . . . . . . . . . . 98--112
Ramesh Karri and
Grigori Kuznetsov and
Michael Goessel Parity-Based Concurrent Error Detection
of Substitution-Permutation Network
Block Ciphers . . . . . . . . . . . . . 113--124
Kris Tiri and
Ingrid Verbauwhede Securing Encryption Algorithms against
DPA at the Logic Level: Next Generation
Smart Card Technology . . . . . . . . . 125--136
Jacques J. A. Fournier and
Simon Moore and
Huiyun Li and
Robert Mullins and
George Taylor Security Evaluation of Asynchronous
Circuits . . . . . . . . . . . . . . . . 137--151
Michael Epstein and
Laszlo Hars and
Raymond Krasinski and
Martin Rosner and
Hao Zheng Design and Implementation of a True
Random Number Generator Based on Digital
Circuit Artifacts . . . . . . . . . . . 152--165
Boaz Barak and
Ronen Shaltiel and
Eran Tromer True Random Number Generators Secure in
a Changing Environment . . . . . . . . . 166--180
Markus Dichtl How to Predict the Output of a Hardware
Random Number Generator . . . . . . . . 181--188
Arash Reyhani-Masoleh and
M. Anwar Hasan On Low Complexity Bit Parallel
Polynomial Basis Multipliers . . . . . . 189--202
Jean-François Dhem Efficient Modular Reduction Algorithm in
and Its Application to ``Left to Right''
Modular Multiplication in . . . . . . . 203--213
Beno\^\it Chevallier-Mames and
Marc Joye and
Pascal Paillierinst Faster Double-Size Modular
Multiplication from Euclidean
Multipliers . . . . . . . . . . . . . . 214--227
Soonhak Kwon and
Chang Hoon Kim and
Chun Pyo Hong Efficient Exponentiation for a Class of
Finite Fields $ \mathrm {GF}(2^n) $
Determined by Gauss Periods . . . . . . 228--242
Marc Joye and
Pascal Paillier GCD-Free Algorithms for Computing
Modular Inverses . . . . . . . . . . . . 243--253
Pierre-Alain Fouque and
Gwenaëlle Martinet and
Guillaume Poupard Attacking Unbalanced RSA--CRT Using SPA 254--268
Pierre-Alain Fouque and
Frederic Valette The Doubling Attack --- Why Upwards Is
Better than Downwards . . . . . . . . . 269--280
Nigel P. Smart An Analysis of Goubin's Refined Power
Analysis Attack . . . . . . . . . . . . 281--290
Julien Cathalo and
François Koeune and
Jean-Jacques Quisquater A New Type of Timing Attack: Application
to GPS . . . . . . . . . . . . . . . . . 291--303
Akashi Satoh and
Sumio Morioka Unified Hardware Architecture for
128-Bit Block Ciphers AES and Camellia 304--318
Pawe\l Chodowiec and
Kris Gaj Very Compact FPGA Implementation of the
AES Algorithm . . . . . . . . . . . . . 319--333
Francois-Xavier Standaert and
Gael Rouvroy and
Jean-Jacques Quisquater and
Jean-Didier Legat Efficient Implementation of Rijndael
Encryption in Reconfigurable Hardware:
Improvements and Design Tradeoffs . . . 334--350
Jan Pelzl and
Thomas Wollinger and
Jorge Guajardo and
Christof Paar Hyperelliptic Curve Cryptosystems:
Closing the Performance Gap to Elliptic
Curves . . . . . . . . . . . . . . . . . 351--365
Roberto M. Avanzi Countermeasures against Differential
Power Analysis for Hyperelliptic Curve
Cryptosystems . . . . . . . . . . . . . 366--381
Kouichi Itoh and
Tetsuya Izu and
Masahiko Takenaka A Practical Countermeasure against
Address-Bit Differential Power Analysis 382--396
Katsuyuki Okeya and
Tsuyoshi Takagi A More Flexible Countermeasure against
Side Channel Attacks Using Window Method 397--410
Jolyon Clulow On the Security of PKCS #11 . . . . . . 411--425
Vlastimil Klíma and
Ondrej Pokorný and
Tomá \vs Rosa Attacking RSA-Based Sessions in SSL/TLS 426--440