Information Security: 4th International Conference, ISC 2001 Malaga, Spain, October 1–3, 2001 Proceedings

Information Security
Preface
Conference Chair
Table of Contents
	Key Distribution
	Protocols
	Enhancing Technologies
	Privacy
	Software Protection
	Message Hiding I
	PKI Issues and Protocols
	Hardware Implementations
	Cryptanalysis and Prevention
	Implementations
	Non-repudiation Techniques
	Contracts and Auctions
	Message Hiding II
	Payments
	Security Applications
	Network and OS Security
	Author Index	 553
Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures
	Introduction
	Secret Sharing Schemes
	The Model
	Lower Bounds
	Protocols: Designing DKDSs from LSSSs
	Conclusion and Open Problems
	Information Theory Elements
Privacy Amplification Theorem for Noisy Main Channel
	Introduction
	Enhanced Privacy Amplification Theorem
	Discussion of the Main Results and Concluding Remarks
	References
Efficient Kerberized Multicast in a Practical Distributed Setting
	Introduction
	Overview of Kerberos
	Overview of Crossrealm Authentication in Kerberos
	Multicast Encryption with a Single Server
		Minimal Storage Schemes
		Basic Tree Schemes
	Efficient Crossrealm Authentication Protocol
		Comparison of Protocols
	Multicast Encryption with Many Servers
		A Simple Construction
		A Second Construction, Extending Tree-Based Schemes
		A Third Construction, Based on Coding Theory Algorithms
	Integrating Kerberos with Multicast Encryption Schemes
		Kerberized Multicast with Fake Tickets
		Integration with Original Crossrealm
		Discussion
	Conclusion
	References
Suitability of a Classical Analysis Method for E-commerce Protocols
	Introduction
	The Communication and Attack Model
	Formalization of Protocol Instantiations
	Known and New Attacks
	The Extended Model and Its Formalization
	The Internet Billing Server Protocol
		Our Assumptions and Formalization
	Our Analysis of the IBS Protocol
	Conclusions
	References
Hyppocrates
	Introduction
		Password Choice: The Issue of Security
		Previous Work
	Classification with Decision Trees
		Decision Trees
		Pruning Techniques
		The First Example of Proactive Password Checking with a Decision Tree
	{sc Hyppocrates}: The Decision Tree
		Minimum Description Length Principle
		Attributes Used for Classification
	Tests and Comparisons
		Testing the Predictive Power
		The Dictionaries
		Fixed Length Attributes
		Comparing Hyppocrates with Other Checkers
		Dynamic Length Attributes
	Conclusions
	References
Lenient/Strict Batch Verification in Several Groups
	Introduction
	Preliminaries
		Separate Verification of DL-Based Items
		Lenient/Strict Batch Verification
		Overlap Factor
	Summary of Our Results
	Basic Concepts for Analysis
		Gain and Loss
		Generic Evaluation of the Gain
	Detailed Analysis
		Subgroup of ${mathchoice {hbox {$@mathsf textstyle Zkern -0.4em Z$}} {hbox {$@mathsf textstyle Zkern -0.4em Z$}} {hbox {$@mathsf scriptstyle Zkern -0.3em Z$}} {hbox {$@mathsf scriptscriptstyle Zkern -0.2em Z$}}}_p^*$ for Random Prime $p$
		Subgroup of ${mathchoice {hbox {$@mathsf textstyle Zkern -0.4em Z$}} {hbox {$@mathsf textstyle Zkern -0.4em Z$}} {hbox {$@mathsf scriptstyle Zkern -0.3em Z$}} {hbox {$@mathsf scriptscriptstyle Zkern -0.2em Z$}}}_p^*$ for Special Prime $p$
		${rm Imskip -thinmuskip F}_{{p}}$-Rational Points on $E/{rm Imskip -thinmuskip F}_{{p}}$ ($3 < {rm char}mskip thickmuskip {rm Imskip -thinmuskip F}_{{p}}$)
		Subgroup of ${rm Imskip -thinmuskip F}_{2^m}$-Rational Points on $E/{rm Imskip -thinmuskip F}_{2^m}$
		Subgroup of ${rm Imskip -thinmuskip F}_{{p}^m}$-Rational Points on $E/{rm Imskip -thinmuskip F}_{{p}}$ ($ 1 < m $)
		References
Absolute Privacy in Voting
	Introduction
		Preliminaries and Assumptions
		Our Results
		Voting Function
		Private Voting Function
	Deterministic Voting Functions
	Probabilistic Voting Functions
		Voting Function
		Private Voting Function
	Related Work
		Secure Multi-party Computation
		Electronic Elections
		Statistical Disclosure Control
		One-Way Hash Functions
		Theories of Voting
		No Voting -- No Problem
	Discussion
		The Absolutely Private Voting Scheme Proposed
		The Definition of Voting Function
	Future Work
	Conclusion
	References
A Logical Model for Privacy Protection
	Introduction
		The Privacy Protection Problem
	Logical Model for Level-Based Generalization
		The Generalization Operations
		The Logical Model
	Logical Model for Set-Based Generalization
		The Generalization Operations
		The Logical Model
		On the Efficiency of Search
	Conclusion
	References
DISSECT: DIStribution for SECurity Tool
	Introduction
	Related Work
	DISSECT Overview
		Object-Oriented Systems
		Selection Criteria
		Processing
		Organizing Distribution and Execution
	DISSECT: Architecture and Implementation
		Processing
		Initialization
	DISSECT: Performance
		Applications
		Results
	DISSECT: Programming Style and Assumptions
	Conclusions
	References
An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs
	Introduction
	Flattening Program Control-Flow
	The Acceptance Problem for LBTMs
	The Reachability Problem for Dispatchers
	Redundancy-Checking for Cloaked Programs
	PSPACE-Hardness of Cloaked Program Analysis
	Conclusions
	References
A Practical and Effective Approach to Large-Scale Automated Linguistic Steganography
	Introduction
	The NiceText Approach
	Synonyms and Contextual Templates
	Remarks
	``Real'' Remarks
	References
Robust New Method in Frequency Domain Watermarking
	1 Introduction
	2 Our Algorithm
		2.1 Marking Process
		2.2 Detection Process
		2.3 Marking Algorithm Revisited
		2.4 Tag Extraction Algorithm
	3 Results
		3.1 Invisibility of the Watermarking
		3.2 Mark Uniqueness
		3.3 Multiple Watermark Detection
		3.4 JPEG Compression
		3.5 Strength against Filters
		3.6 Rotation, Scaled and Rescaled
		3.7 Watermark Collision
		3.8 Stirmark
	References
On the Complexity of Public-Key Certificate Validation
	Introduction
	The Verisign-Microsoft Case
	Architectures for Certificate Path Processing
	General Requirements of Certificate Validation Process
	Certificate Chains: Still a Problem to Construct Them
	Certificate Status Retrieval
	Standardization Efforts
		Basic Path Validation
		Remote Path Processing Services
	Commercial Products and Services
		Network Security Services (NSS)
		Personal Security Manager (PSM)
		Microsoft
		VeriSign
		Thawte
		Entrust
		ValiCert
	Conclusions
	References
Liability of Certification Authorities: A Juridical Point of View
	1   Liability of Certification Authorities: General Considerations
	2   Situations of Liability of the Certification Authority
		2.1   Liability of the Certification Authority Once Certificate Has Been Issued
		2.2   Liability in Case of Revocation
	3   Limits and Extension of Liability
		3.1   Qualitative Limitations
		3.2   Quantitative Limitations
	4   Conclusions
	References
Experimental Testing of the Gigabit IPSec-Compliant Implementations of Rijndael and Triple DES Using SLAAC-1V FPGA Accelerator Board
	Introduction
	FPGA Board
	3   Implementation of Rijndael
		Component Operations
		General Architecture of the Encryption/Decryption Unit
		Round Key Module
	Implementation of Triple DES
		Basic Architecture
		Round Key Module
		Extended Architecture
	5   Testing Procedure
	6   Results
	Related Work
	Summary and Possible Extensions
	References
Elliptic Curve Arithmetic Using SIMD
	Introduction
	Parallel Elliptic Curve Arithmetic
		SIMD
		Elliptic Curve Arithmetic over ${{rm Imskip -thinmuskip F}}_q, mathop {rm char}{{rm Imskip -thinmuskip F}}_q>3$
		Elliptic Curve Arithmetic with Parallel Multiplication
	Bitslice Implementation
		Data Structure
		Conditional Move
		The Window Method for Bitslice Implementation
		Efficiency
		Comparison Based on an Ideal Model
		Comparison by Implementation
	Conclusion
	References
On the Hardware Implementation of the 3GPP Confidentiality and Integrity Algorithms
	1   Introduction
	2   The KASUMI Algorithm
		2.1   Function FL
		2.2   Function FO
		2.3   Function FI
		2.4   S-BOX
	3   Implementation of KASUMI on Various Hardware Platforms
		3.1   Implementations for Xilinx Virtex-E
		3.2   Implementations for Altera APEX 20KE
		3.3  Implementations for ATMEL 0.25 µm
		3.4   Analysis of Results
	4   Design of the Confidentiality (f8) and Integrity (f9) Algorithms
		4.1   Confidentiality Function f8
		4.2   The Integrity Function f9
		4.3   Implementation of the f8 and f9 Functions
		4.4  Discussion and Analysis of the Results
	5   Conclusions
	References
Efficient Implementation of Elliptic Curve Cryptosystems on an ARM7 with Hardware Accelerator
	Introduction
	Previous Work
	32-Bit Platform: PCC-ISES
	Elliptic Curves over $GF(p)$
		Group Law
		The Hessian Form of an Elliptic Curve
	EC Arithmetic and Modular Arithmetic in $GF(p)$
		EC Arithmetic
		Modular Arithmetic in $GF(p)$
	Implementations
		EC Domain Parameters
		Three Different Implementations of EC Arithmetic
	Results and Timings
		Time Costs of Multiplication and Inversion in $GF(p)$
		Time Costs of Scalar Multiplication
		Time Costs of ECDH and ECDSA Protocols
	Security Remarks
	Future Work
	Conclusions
	References
A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH
	Introduction
	Description of SFLASH
		Parameters of the Algorithm
		The Signing Algorithm
	Attacking SFLASH
		DPA Technique
		Revealing $Delta $
		Revealing the Affine Bijections $s$ and $t$
	Adapting the Attack to FLASH
		Revealing $Delta $
		Revealing the Affine Bijections $s$ and $t$
	Conclusion
	References
Quadratic Relations for S-Boxes: Their Minimum Representations and Bounds
	Introduction
	Basic Definitions and Results for Any Order
	Quadratic Relations and Approximations
	Quadratic Relations
	Quadratic Boolean Functions and Graphs
	Minimum Forms of Quadratic Functions
	Bounds for the Quadratic Terms (Edges)
	Bounds for the Number of Variables (Vertices)
	Bounds for the Structure
	SERPENT
	CRYPTON
	Conclusions
	References
Approximate Power Roots in Zm*
	Introduction
	Power Residues Near a Modulus Fraction
	Approximation of Power Roots
		Generalization of Montgomery Polynomials
		Approximation of Quadratic Residues
	Application to Low Exponent RSA Cryptanalysis
	Conclusions
	References
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
	1 Introduction
	2 Security against Side-Channel Attacks
		2.1 Elliptic Curve Point Operations
		2.2 Field Operations
	3 Multiplier Recoding Providing Resistance against Side-Channel Attacks
		3.1 Recoding Algorithm
		3.2 Point Multiplication Algorithm
		3.3 Uniformity of the Point Multiplication Algorithm
	4 Efficiency Comparison
	5 Conclusion
	References
A Flexible Role-Based Access Control Model for Multimedia Medical Image Database Systems
	1   Introduction
	2   Related Work
	3   The Underlying Medical Image Data Model
	An Extended Role-Based Access Control Model for Multimedia Medical Image Databases
		4.1   Constraints
	5   Access Control
	System Architecture
	7   Summary
	References
A Secure Publishing Service for Digital Libraries of XML Documents
	Introduction
	A Brief Introduction to XML
	Architecture of the Publishing Service
	Formal Definitions
	Key Distribution
	Pull and Notify Package Distribution Modes
	Push Package Distribution Mode
	An Example of Package Delivery
	Related Work
	Concluding Remarks
	References
An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party
	Introduction
	Basic Definitions and Properties
		Communication Channels
		Requirements on Non-repudiation Protocols
	A Non-repudiation Protocol with Offline TTP
		Introduction
		Notations and Evidences
		Main Protocol
		Recovery Protocol
		Abort Protocol
		Dispute Resolution
		Fairness and Timeliness
	A Non-repudiation Protocol with Offline Transparent TTP
		The Signature Scheme
		Evidences and Notations
		Main Protocol
		Recovery Protocol
		Abort Protocol
		Error Protocol
		Disputes Resolutions
		Fairness and Timeliness
	Conclusion
	References
Persistent Authenticated Dictionaries and Their Applications
	Introduction
		Problem Definition and Applications
		Previous and Related Work
		Summary of Results
	Making Authenticated Dictionaries Persistent
		PADs Based on Red-Black Trees
		PADs Based on Skip Lists
		Security
		Extensions
	Experimental Results
	Conclusions
	References
Efficient Optimistic N-Party Contract Signing Protocol
	1   Introduction
	2   An Efficient Protocol
		2.1   Protocol
		2.2   Dispute Resolution
		2.3   A Three-Steps Asynchronous Protocol
	3   Multi-party Version
		3.1   A Three-Party Version
		3.2   A N-Party Version
	4   Conclusion
	References
	Appendix 1: Verifiability of TTP in the Two-Party Protocol
	Appendix 2: Analysis of Three-Party Protocol
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
	Introduction
	Notation
	Previous Works
		cite {sako}
		cite {cachin}
	Our Scheme
		Bidding Phase
		Opening Phase
	Security
	Computational Complexity
	Conclusion
	Value-Comparing
		Previous Work
		Our Solution
Oblivious Image Watermarking Robust against Scaling and Geometric Distortions
	Introduction
		Plan of This Paper
	Background on Oblivious Watermarking
		Systems That Require Knowledge of the Embedded Sequence
		Scaling and Geometric Distortion Attacks
	Our Contribution
	Mark Embedding
	Mark Recovery
	Parameter Choice
		On the Size of Tiles
		On the Width of Color Level Subintervals
	Imperceptibility Assessment
		Multiple Marking
	Robustness Assessment
	Conclusions and Future Research
	References
Fingerprinting Text in Logical Markup Languages
	Introduction
	Fingerprinting Digital Documents
		Document Model
		Related Work
	Synonym Substitution
		Overview
		Semantics Preserving Transformations
		Hash Function Properties
		Keys
		Fingerprinting Documents
	Evaluation
		Example of Synonym Substitution
		Security Analysis
		Limits of Synonym Substitution
		Information Hiding with Synonym Substitution
	Conclusions
	References
SPEED Protocol: Smartcard-Based Payment with Encrypted Electronic Delivery
	Introduction
	Smart Card with E-Purse as a Basic Component of SPEED
	SPEED Overview
		Players
		Registration
		SPEED Purchase Overview
	SPEED Protocol Specification
		Notation
		Normal Mode
		Aggressive Mode
	Security Analysis of the SPEED Protocol
		Assumptions about Cryptography
		General Objectives: Confidentiality and Authentication
		Replay Attacks
		Impersonation
		Visibility
		Product Delivery Attack
		Customer Complaints
	Using SPEED in a Real Environment: The PISCIS Project
		SPEED Performance Analysis
	Conclusions
	Future Work
	References
Efficient Transferable Cash with Group Signatures
	Introduction
	Model of Transferable Cash
	Primitives
	Transferable Cash Using Group Signatures
	Extension
	Conclusion
	References
An Auditable Metering Scheme for Web Advertisement Applications
	Introduction
		Motivation
		Previous Work
		Our Work
		Organisation
	An Auditable Metering Scheme
		The Timing Algorithm
		The Auditing Algorithm
		Analysis of the Scheme
	Web-Based Advertisement with Auditable Metering
		The Model
		Requirements
		The Scheme
		Security Analysis
	Conclusions
	References
Broker-Based Secure Negotiation of Intellectual Property Rights
	1 	IPR Business Models
	2 	IPR Information Representation
	3 	Negotiation of IPR Conditions
	4 	IPR Contracts
		4.1 	An Electronic IPR Contract
	5 	Electronic Contract Signature
	6 	Conclusions
	References
Design of the Decision Support System for Network Security Management to Secure Enterprise Network
	1   Introduction
		1.1   Introduction of the Decision Support System for Network Security Management
		1.2   Necessity of the Research on the DSS/ NSM
	2   Related Works
		2.1   Network-Based Scanners and Host-Based Scanners
		2.2   Commercial Vulnerability Assessment Tools
	3   Design of the DSS/ NSM
		3.1   Requirements of the DSS/NSM
		3.2   Architecture of the DSS/NSM
			3.2.1   Agent
			3.2.2   Subnet Analyzer
			3.2.3   Domain Analyzer
			3.2.4   Security Evaluation Rule Manager
			3.2.5   Manager Tool
			3.2.6   Etc
			3.2.7   Features of the System Design
		3.3   Detailed Architecture and Processing Flow of DSS/NSM
			Fig. 2. Architecture of the Security Evaluation Rule Manager
			3.3.2   Security Evaluation of a Host Using Agent
			3.3.3   Security Evaluation of a Subnet Using Subnet Analyzer
			Decision-Making about Security Management of the Network Domain
			Using Domain Analyzer
			3.3.5   Report View and System Management Using Manager Tool
	4   Implementation
	5   Conclusions
	References
Measuring False-Positive by Automated Real-Time Correlated Hacking Behavior Analysis
	1   Introduction
		1.1   What Is False Positive
		1.2   Challenges
		1.3   Related Work on IDS
	2   New Solution
		2.1   Overall Architecture
		2.2   What's New
			2.2.1   Heterogeneous Open Subscription Architecture
			2.2.2   Real Time Reaction
			2.2.3   Centralized Extensive Correlation Analysis Model
			2.2.4   Efficient Knowledge Rules PushBack
		2.3   How It Works
			2.3.1   An Example in Detail
	3   Hacking Behavior Analysis
		3.1   Correlated Hacking Behavior Algorithms
			3.1.0   Basic Definitions
			3.1.1   Attack Count from Same Location
			3.1.2   Victim Vulnerability Abuse Rate
			3.1.3   Attacking Method Frequent Use Rate
			3.1.4   Concurrent Hacking Frequency
			3.1.5   Hacking Behaviors over Timing Regularity
			3.1.6   Possible Order Correlation Analysis of Hacking Actions
			3.1.7   Concurrency of Organized Attacking Locations
		3.2   True Attack Confidence Value
			3.2.1   Brute-Force Method for Weight
			3.2.2   One-Rule and Bagging Method
			3.2.3   Native Bayer Method
	4   Prototype Development
		4.1   Testing Environment
			4.1.1   Background
			4.1.2   Simulation
		4.2   Testing Results
			4.2.1   Brute-Force for Weight
			4.2.2   One-Rule and Bagging Method
			4.2.3   Native Bayer Method
		4.3   Conclusion and Future Research
	References
Design of UNIX System for the Prevention of Damage Propagation by Intrusion and Its Implementation Based on 4.4BSD
	Introduction
	Policy of Protection
		An Intrusion into a UNIX System
		Network Users
		A Way to Weaken Root Privilege
	Introduction of Restriction on User Substitution
		Introduction of RSU
		Suid Bit
	Protection of Information for Authentication
		Protection of Configuration Files
		Protection of Information Inside the Kernel
	Programs Authenticated by the Kernel
	Compatibility with Usual Authentication Method
		Modification of Password Functions
	Protection of the Kernel
	Treatments for Non-interactive Programs
	Summary of Modifications
	Comparison with Other Systems
		Security Level Mechanism on 4.4BSD
		Plan9
		Result of Comparison
		Relations to Chroot and Jail
	Implementation
	Conclusion
	References
Author Index