Lower bounds and new constructions on secure group communication schemes
From MaRDI portal
Publication:955028
Recommendations
- On the Minimum Communication Effort for Secure Group Key Exchange
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- New Lower Bounds for Privacy in Communication Protocols
- Cryptanalysis and improved construction of a group key agreement for secure group communication
- Communication and Randomness Lower Bounds for Secure Computation
- Towards provably secure group key agreement building on group theory
- An application of group theory in confidential network communications
- scientific article; zbMATH DE number 5380257
- Deniable group communications in the presence of global unlimited adversary
- Lower bounds for robust secret sharing schemes
Cites work
- scientific article; zbMATH DE number 1088922 (Why is no real title available?)
- scientific article; zbMATH DE number 1942412 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- A conference key distribution system
- New directions in cryptography
Cited in
(6)- New Lower Bounds for Privacy in Communication Protocols
- Lower Bounds for Subset Cover Based Broadcast Encryption
- Information Security
- On the Minimum Communication Effort for Secure Group Key Exchange
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- scientific article; zbMATH DE number 1759651 (Why is no real title available?)
This page was built for publication: Lower bounds and new constructions on secure group communication schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955028)