Public Key Cryptography - PKC 2005
From MaRDI portal
Publication:5711583
DOI10.1007/b105124zbMath1081.94521OpenAlexW2506201965MaRDI 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
Related Items (48)
Balancing privacy and accountability in blockchain identity management ⋮ 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 ⋮ Implementing secure reporting of sexual misconduct -- revisiting WhoToo ⋮ PoSAT: proof-of-work availability and unpredictability, without the work ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ A fast and simple partially oblivious PRF, with applications ⋮ Explainable arguments ⋮ Anonymous tokens with public metadata and applications to private contact tracing ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Multiparty non-interactive key exchange and more from isogenies on elliptic curves ⋮ Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Encapsulated search index: public-key, sub-linear, distributed, and delegatable ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ Adaptive-Secure VRFs with Shorter Keys from Static Assumptions ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Public-key generation with verifiable randomness ⋮ A combinatorial approach to quantum random functions ⋮ Simulatable verifiable random function from the LWE assumption ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication ⋮ Security Analysis of the Strong Diffie-Hellman Problem ⋮ Practical Identity-Based Encryption Without Random Oracles ⋮ Efficient Protocols for Set Membership and Range Proofs ⋮ Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Discrete logarithm problems with auxiliary inputs ⋮ Sub-linear Size Traceable Ring Signatures without Random Oracles ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Aggregatable distributed key generation ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Unforgeability of Re-Encryption Keys against Collusion Attack in Proxy Re-Encryption ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function
This page was built for publication: Public Key Cryptography - PKC 2005
