Verifiable random functions: relations to identity-based key encapsulation and new constructions
type: Item
instance of: scholarly article
title: Verifiable random functions: relations to identity-based key encapsulation and new constructions
zbMATH Open document ID: 1302.94031
author: Michel Abdalla
author: Dario Catalano
author: Dario Fiore
published in: Journal of Cryptology
publication date: 2014-09-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6347561
zbMATH Keywords: verifiable random functions
zbMATH Keywords: identity-based encryption
zbMATH Keywords: pseudo-randomness
MaRDI profile type: Publication
full work available at URL: s00145-013-9153-x
OpenAlex ID: W2075903118
cites work: Verifiable Random Functions from Identity-Based Key Encapsulation
cites work: Leftover Hash Lemma, Revisited
cites work: Generic constructions of identity-based and certificateless kEMs
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Q4783728
cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext
cites work: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
cites work: Weak Verifiable Random Functions
cites work: Q4434880
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Bonsai trees, or how to delegate a lattice basis
cites work: Simulatable VRFs with Applications to Multi-theorem NIZK
cites work: Security Analysis of the Strong Diffie-Hellman Problem
cites work: Bounded CCA2-Secure Encryption
cites work: New directions in cryptography
cites work: Efficient Construction of (Distributed) Verifiable Random Functions
cites work: Theory of Cryptography
cites work: Public Key Cryptography - PKC 2005
cites work: Q4737236
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
cites work: Practical Identity-Based Encryption Without Random Oracles
cites work: Q4318696
cites work: A Pseudorandom Generator from any One-way Function
cites work: Topics in Cryptology – CT-RSA 2004
cites work: Realizing Hash-and-Sign Signatures under Standard Assumptions
cites work: Constructing Verifiable Random Functions with Large Input Spaces
cites work: Q4941882
cites work: Updatable Zero-Knowledge Databases
cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions
cites work: Q4409145
cites work: Q4783744
cites work: Q4472072
cites work: Identity-Based Cryptosystems and Signature Schemes
cites work: Q5316395
cites work: Efficient Identity-Based Encryption Without Random Oracles
DOI: 10.1007/S00145-013-9153-X
description: scientific article; zbMATH DE number 6347561