You have Guest access.
Log In
Stanislaw Jarecki and Gene Tsudik
Front matter
1-14
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
15-33
The Security of All Bits Using List Decoding
34-53
A New Lattice Construction for Partial Key Exposure Attack for RSA
54-67
Subset-Restricted Random Walks for Pollard rho Method on Fpm{\mathbf{F}_{p^m}}
68-87
Signing a Linear Subspace: Signature Schemes for Network Coding
88-104
Improving the Boneh-Franklin Traitor Tracing Scheme
105-123
Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
124-138
Zero-Knowledge Proofs with Witness Elimination
139-159
Distributed Public-Key Cryptography from Weak Secrets
160-179
Asynchronous Multiparty Computation: Theory and Implementation
180-195
Multi-Party Computation with Omnipresent Adversary
196-214
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
215-234
Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
235-255
Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys
256-276
Removing Escrow from Identity-Based Encryption New Security Notions and Key Management Techniques
277-296
On the Theory and Practice of Personal Digital Signatures
297-316
Security of Blind Signatures under Aborts
317-336
Security of Sanitizable Signatures Revisited
337-356
Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures
357-376
CCA-Secure Proxy Re-encryption without Pairings
377-392
Compact CCA-Secure Encryption for Messages of Arbitrary Length
393-410
Verifiable Rotation of Homomorphic Encryptions
411-424
A Practical Key Recovery Attack on Basic TCHo
425-442
An Algebraic Surface Cryptosystem
443-462
Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
463-480
Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
481-500
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
501-520
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info