Search
International Association for Cryptologic Research
What's new
Archive
Paper awards
Videos
Authors
Coauthors
By year
By venue
All Committees
Most Committees
Report errors
About
Publications of Pkc 2006
Preface and frontmatter
Page
Title
1-13
New Attacks on RSA with Small Secret CRT-Exponents
14-26
An Attack on a Modified Niederreiter Encryption Scheme
27-43
Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm
44-57
Efficient Polynomial Operations in the Shared-Coefficients Setting
58-74
Generic On-Line/Off-Line Threshold Signatures
75-90
Linear Integer Secret Sharing and Distributed Exponentiation
91-104
Encoding-Free ElGamal Encryption Without Random Oracles
105-122
Parallel Key-Insulated Public Key Encryption
123-139
Provably Secure Steganography with Imperfect Sampling
140-156
Collision-Resistant No More: Hash-and-Sign Paradigm Revisited
157-173
Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption
174-190
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve
191-206
Efficient Scalar Multiplication by Isogeny Decompositions
207-228
Curve25519: New Diffie-Hellman Speed Records
229-240
Strongly Unforgeable Signatures Based on Computational Diffie-Hellman
241-256
Generalization of the Selective-ID Security Model for HIBE Protocols
257-273
Identity-Based Aggregate Signatures
274-289
On the Limitations of the Spread of an IBE-to-PKE Transformation
290-301
Inoculating Multivariate Schemes Against Differential Attacks
302-314
Random Subgroups of Braid Groups: An Approach to Cryptanalysis of a Braid Group Based Cryptographic Protocol
315-329
High-Order Attacks Against the Exponent Splitting Protection
330-346
New Online/Offline Signature Schemes Without Random Oracles
347-363
Anonymous Signature Schemes
364-377
The Power of Identification Schemes
378-394
Security Analysis of KEA Authenticated Key Exchange Protocol
395-409
SAS-Based Authenticated Key Agreement
410-426
The Twist-AUgmented Technique for Key Exchange
427-442
Password-Based Group Key Exchange in a Constant Number of Rounds
443-457
Conditional Oblivious Cast
458-473
Efficiency Tradeoffs for Malicious Two-Party Computation
474-490
On Constructing Certificateless Cryptosystems from Identity Based Encryption
491-507
Building Better Signcryption Schemes with Tag-KEMs
508-524
Security-Mediated Certificateless Cryptography
525-542
k
-Times Anonymous Authentication with a Constant Proving Cost