Distributed pseudo-random functions and KDCs

DOI10.1007/3-540-48910-X_23MaRDI QIDQ4250771zbMATH OpenFDO

Authors Moni Naor, Benny Pinkas, Omer Reingold

Publication date 17 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-48910-X_23

zbMATH Keywords

distributed pseudo-random functionsevaluation of trapdoor functionskey distribution centerprivate key cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Analysis and design of distributed key distribution centers
• scientific article; zbMATH DE number 2044512
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
• A ramp model for distributed key distribution schemes
• A ramp model for distributed key distribution schemes

Cited in

(45)

• Adaptively secure distributed PRFs from LWE
• A ramp model for distributed key distribution schemes
• Shared generation of pseudo-random functions
• Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
• Updatable signatures and message authentication codes
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• Functional encryption for set intersection in the multi-client setting
• Key-homomorphic pseudorandom functions from LWE with small modulus
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
• Adaptively secure threshold symmetric-key encryption
• Secure multiparty computation with free branching
• Improving speed and security in updatable encryption schemes
• Cryptographic group actions and applications
• Oblivious pseudorandom functions from isogenies
• Partitioned searchable encryption
• Distributed pseudorandom functions for general access structures in NP
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
• Pseudorandom functions: three decades later
• McCulloch-Pitts brains and pseudorandom functions
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
• Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
• Efficient and anonymous password-hardened encryption services
• Secure two-party input-size reduction: challenges, solutions and applications
• Encapsulated search index: public-key, sub-linear, distributed, and delegatable
• ParaDiSE: efficient threshold authenticated encryption in fully malicious model
• TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
• Efficient Unique Ring Signature for Blockchain Privacy Protection
• Robust Distributed Pseudorandom Functions for mNP Access Structures
• Anonymous counting tokens
• Time-lock puzzles with efficient batch solving
• \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
• Exponent-VRFs and their applications
• Simplified adaptively secure threshold BLS signatures
• Arctic: lightweight and stateless threshold Schnorr signatures
• Strongly secure universal thresholdizer
• CCA secure updatable encryption from non-mappable group actions
• Pilvi: lattice threshold PKE with small decryption shares and improved security
• Game changer: a modular framework for OPRF security
• Leakage-resilience of Shamir's secret sharing: identifying secure evaluation places
• OneTwoPAKE: two-round strong asymmetric PAKE with ideal security
• Malicious private set union with two-sided output
• Efficient maliciously secure oblivious exponentiations
• Indistinguishability obfuscation from ring key-homomorphic weak PRFs
• HiSE: hierarchical (threshold) symmetric-key encryption
• MATSE: amortized threshold symmetric-key encryption for matrices

This page was built for publication: Distributed pseudo-random functions and KDCs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250771)