Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the Price of Concurrency in Group Ratcheting Protocols

Alexander Bienstock, Yevgeniy Dodis, Paul Rösler

Published Jan 1, 2020• 31 citations
Publisher
DOI
10.1007/978-3-030-64378-2_8

Related papers

The Key Lattice Framework for Concurrent Group Messaging

Kelong Cong, Karim Eldefrawy, Nigel Paul Smart +1 more

Lecture notes in computer science•Jan 1, 2024•2 citations

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption.

Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay

Abstract. Membership encryption is a newly developed cryptographic primitive that combines membership proof and encryption into an unified setting. This paper presents a new flexible mem-bership encryption scheme which is provably secure and significantly more efficient than the previous scheme. Further we apply our proposed membership encryption to construct a round optimal 1-out-of-n priced oblivious transfer (POT) protocol which, unlike the existing 1-out-of-n POT schemes, is proven secure under the universally composable (UC) security model and thus preserves secu-rity when it is executed with multiple protocol instances that run concurrently in an adversarily controlled way. Moreover, using our membership encryption, the POT protocol exhibits constant communication complexity on the buyer’s side and O(n) communication cost on the vendor’s side, which is so far the best known in the literature.

•Jan 1, 2014•0 citations

On Concurrent Identification Protocols (Extended Abstract)

Oded Goldreich

Springer eBooks•Feb 28, 2007•0 citations

Anonymous End to End Encryption Group Messaging Protocol Based on Asynchronous Ratchet Tree

Kaiming Chen, Jiageng Chen

Lecture notes in computer science•Jan 1, 2020•6 citations

Exploring the Limits of Multi-Party Computation

Dominik Raub

•Jan 1, 2009•1 citation

Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging

Daniel Jost, Ueli M. Maurer, Marta Mularczyk

Lecture notes in computer science•Jan 1, 2019•79 citations
Abstract. Membership encryption is a newly developed cryptographic primitive that combines membership proof and encryption into an unified setting. This paper presents a new flexible mem-bership encryption scheme which is provably secure and significantly more efficient than the previous scheme. Further we apply our proposed membership encryption to construct a round optimal 1-out-of-n priced oblivious transfer (POT) protocol which, unlike the existing 1-out-of-n POT schemes, is proven secure under the universally composable (UC) security model and thus preserves secu-rity when it is executed with multiple protocol instances that run concurrently in an adversarily controlled way. Moreover, using our membership encryption, the POT protocol exhibits constant communication complexity on the buyer’s side and O(n) communication cost on the vendor’s side, which is so far the best known in the literature.