| Descript. |
v.: digital |
| Series |
Lecture Notes in Computer Science,
0302-9743 ; 5443
|
| Contents |
Number Theory -- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint -- The Security of All Bits Using List Decoding -- A New Lattice Construction for Partial Key Exposure Attack for RSA -- Subset-Restricted Random Walks for Pollard rho Method on -- Applications and Protocols -- Signing a Linear Subspace: Signature Schemes for Network Coding -- Improving the Boneh-Franklin Traitor Tracing Scheme -- Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols -- Zero-Knowledge Proofs with Witness Elimination -- Multi-Party Protocols -- Distributed Public-Key Cryptography from Weak Secrets -- Asynchronous Multiparty Computation: Theory and Implementation -- Multi-Party Computation with Omnipresent Adversary -- Identity-Based Encryption -- Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data -- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts -- Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys -- Removing Escrow from Identity-Based Encryption -- Signatures -- On the Theory and Practice of Personal Digital Signatures -- Security of Blind Signatures under Aborts -- Security of Sanitizable Signatures Revisited -- Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures -- Encryption -- CCA-Secure Proxy Re-encryption without Pairings -- Compact CCA-Secure Encryption for Messages of Arbitrary Length -- Verifiable Rotation of Homomorphic Encryptions -- New Cryptosystems and Optimizations -- A Practical Key Recovery Attack on Basic TCHo -- An Algebraic Surface Cryptosystem -- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication -- Group Signatures and Anonymous Credentials -- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying -- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials -- Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials. |
| Summary |
This book constitutes the refereed proceedings of the 12th International Conference on Practice and Theory in Public-Key Cryptography, PKC 2009, held in Irvine, CA, USA, in March 2009. The 28 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers are organized in topical sections on number theory, applications and protocols, multi-party protocols, identity-based encryption, signatures, encryption, new cryptosystems and optimizations, as well as group signatures and anonymous credentials. |
| Sys Details |
eBook access requires you to log in as a Federation University Australia library user. |
| Notes |
Springer eBooks |
| Subject |
Public key cryptography -- Congresses.
|
|
Computer security -- Congresses.
|
|
Computer science
|
|
Computer communication networks
|
|
Data encryption (Computer science) -- Congresses.
|
|
Computer software
|
| Other Author |
Jarecki, Stanislaw.
|
|
Tsudik, Gene.
|
|
SpringerLink (Online service)
|
| ISBN |
9783642004681 |
|
