The meeting businessmen problem: requirements and limitations

DOI10.2478/v10065-012-0003-5zbMath1284.94062OpenAlexW4241707798MaRDI QIDQ2443007

Khalil Challita

Publication date: 2 April 2014

Published in: Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10065-012-0003-5

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An attack on the Needham-Schroeder public-key authentication protocol
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Security and composition of multiparty cryptographic protocols
• Secure multi-party computation made simple
• Verifying Agents’ Conformance with Multiparty Protocols
• New directions in cryptography
• Using encryption for authentication in large networks of computers
• Cryptography and cryptographic protocols
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

This page was built for publication: The meeting businessmen problem: requirements and limitations