Public Key Cryptography - PKC 2005

DOI10.1007/b105124zbMath1081.94521MaRDI QIDQ5711583

Aleksandr Yampolskiy, Yevgeniy Dodis

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105124

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication, Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function, Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption, Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, Discrete logarithm problems with auxiliary inputs, Verifiable random functions: relations to identity-based key encapsulation and new constructions, Provably secure group key management scheme based on proxy re-encryption with constant public bulletin size and key derivation time, Adaptively secure distributed PRFs from LWE, On the impossibility of structure-preserving deterministic primitives, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, Subversion-resilient signatures: definitions, constructions and applications, (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens, Short signatures without random oracles and the SDH assumption in bilinear groups, Verifiable Random Functions from Standard Assumptions, Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys, Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions, Sub-linear Size Traceable Ring Signatures without Random Oracles, Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy, Unforgeability of Re-Encryption Keys against Collusion Attack in Proxy Re-Encryption, Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem, Compact E-Cash and Simulatable VRFs Revisited, Efficient Rational Secret Sharing in Standard Communication Networks, Security Analysis of the Strong Diffie-Hellman Problem, Practical Identity-Based Encryption Without Random Oracles, Efficient Protocols for Set Membership and Range Proofs, Verifiable Random Functions from Identity-Based Key Encapsulation