Public Key Cryptography [electronic resource] : 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002 Paris, France, February 12–14, 2002 Proceedings /

Encryption Schemes -- New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive -- Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages -- On Sufficient Randomness for Secure Public-Key Cryptosystems -- Multi-recipient Public-Key Encryption with Shortened Ciphertext -- Signature Schemes -- Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code -- Formal Proofs for the Security of Signcryption -- A Provably Secure Restrictive Partially Blind Signature Scheme -- Protocols I -- M + 1-st Price Auction Using Homomorphic Encryption -- Client/Server Tradeoffs for Online Elections -- Self-tallying Elections and Perfect Ballot Secrecy -- Protocols II -- Efficient 1-Out-n Oblivious Transfer Schemes -- Linear Code Implies Public-Key Traitor Tracing -- Design and Security Analysis of Anonymous Group Identification Protocols -- On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem -- Cryptanalysis -- Solving Underdefined Systems of Multivariate Quadratic Equations -- Selective Forgery of RSA Signatures with Fixed-Pattern Padding -- New Chosen-Plaintext Attacks on the One-Wayness of the Modified McEliece PKC Proposed at Asiacrypt 2000 -- Side Channels -- SPA-Based Adaptive Chosen-Ciphertext Attack on RSA Implementation -- A Combined Timing and Power Attack -- A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks -- Invited Talk -- New European Schemes for Signature, Integrity and Encryption (NESSIE): A Status Report -- ECC Implementations -- An Improved Method of Multiplication on Certain Elliptic Curves -- An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves -- Weierstraß Elliptic Curves and Side-Channel Attacks -- Applications -- One-Way Cross-Trees and Their Applications -- RSA Key Generation with Verifiable Randomness -- New Minimal Modified Radix-r Representation with Applications to Smart Cards.

Saved in:
Bibliographic Details
Main Authors: Naccache, David. editor., Paillier, Pascal. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002
Subjects:Computer science., Computer communication systems., Data encryption (Computer science)., Algorithms., Computer Science., Data Encryption., Algorithm Analysis and Problem Complexity., Computer Communication Networks.,
Online Access:http://dx.doi.org/10.1007/3-540-45664-3
Tags: Add Tag
No Tags, Be the first to tag this record!