The meeting businessmen problem: requirements and limitations
type: Item
instance of: scholarly article
title: The meeting businessmen problem: requirements and limitations
zbMATH Open document ID: 1284.94062
author: Khalil Challita
publication date: 2014-04-02T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6277300
MaRDI profile type: Publication
full work available at URL: v10065-012-0003-5
OpenAlex ID: W4241707798
cites work: Q4274294
cites work: New directions in cryptography
cites work: The dining cryptographers problem: Unconditional sender and recipient untraceability
cites work: Q2956948
cites work: Using encryption for authentication in large networks of computers
cites work: Q4341785
cites work: Q4341751
cites work: Q4234051
cites work: Q4542560
cites work: Security and composition of multiparty cryptographic protocols
cites work: Cryptography and cryptographic protocols
cites work: Cryptography and Game Theory: Designing Protocols for Exchanging Information
cites work: Verifying Agents’ Conformance with Multiparty Protocols
cites work: Efficient Two Party and Multi Party Computation Against Covert Adversaries
cites work: Secure multi-party computation made simple
cites work: An attack on the Needham-Schroeder public-key authentication protocol
DOI: 10.2478/V10065-012-0003-5
published in: Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica
description: scientific article