A fast and simple partially oblivious PRF, with applications

DOI10.1007/978-3-031-07085-3_23zbMath1496.94067OpenAlexW3186747044MaRDI QIDQ2170066

Nirvan Tyagi, Thomas Ristenpart, Stefano Tessaro, Nick Sullivan, Sofía Celi, Christopher A. Wood

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_23

zbMATH Keywords

blind signaturesanonymous tokensDiffie-Hellman inversionverifiable oblivious pseudorandom functions

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Anonymous tokens with public metadata and applications to private contact tracing

Uses Software

• GitHub
• CIRCL

Cites Work

• Unnamed Item
• Unnamed Item
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• The algebraic group model and its applications
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• Handling adaptive compromise for practical encryption schemes
• Anonymous tokens with private metadata bit
• A classification of computational assumptions in the algebraic group model
• Two-sided malicious security for private intersection-sum with cardinality
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Security Analysis of the Strong Diffie-Hellman Problem
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Progress in Cryptology - INDOCRYPT 2003
• Equivocal Blind Signatures and Adaptive UC-Security
• Public Key Cryptography - PKC 2005
• Theory of Cryptography
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Cryptography and Coding
• Public Key Cryptography – PKC 2004
• On the (in)security of ROS

This page was built for publication: A fast and simple partially oblivious PRF, with applications