Identity-based matchmaking encryption without random oracles

DOI10.1007/978-3-030-92518-5_19zbMath1514.94083OpenAlexW4205176191MaRDI QIDQ6157600

Luigi Russo, Daniele Venturi, Alessio Guidi, Danilo Francati

Publication date: 12 May 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-030-92518-5_19

zbMATH Keywords

identity-based encryptionmatchmaking encryptionplain model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Multi-key and multi-input predicate encryption from learning with errors ⋮ Identity-based matchmaking encryption from standard assumptions ⋮ Towards secure asynchronous messaging with forward secrecy and mutual authentication

Cites Work

• Identity-Based Cryptosystems and Signature Schemes
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
• Practical Identity-Based Encryption Without Random Oracles
• On cryptography with auxiliary input
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
• Match me if you can: matchmaking encryption and its applications

This page was built for publication: Identity-based matchmaking encryption without random oracles