Lower bounds and new constructions on secure group communication schemes
DOI10.1016/J.TCS.2008.08.024zbMATH Open1147.94011OpenAlexW1964011210MaRDI QIDQ955028FDOQ955028
Authors: Scott C.-H. Huang, Minming Li, Weili Wu, Frances F. Yao 
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.024
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
- Deniable group communications in the presence of global unlimited adversary
- Lower bounds for robust secret sharing schemes
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network design and communication in computer systems (68M10)
Cites Work
Cited In (6)
- Information Security
- Lower Bounds for Subset Cover Based Broadcast Encryption
- New Lower Bounds for Privacy in Communication Protocols
- On the Minimum Communication Effort for Secure Group Key Exchange
- Title not available (Why is that?)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
Uses Software
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)
