Composing Protocols with Randomized Actions

被引：4
|
作者：
Bauer, Matthew S. [1 ]
Chadha, Rohit [2 ]
Viswanathan, Mahesh [1 ]
机构：
[1] Univ Illinois, Champaign, IL 61820 USA
[2] Univ Missouri, Columbia, MO 65211 USA
来源：
PRINCIPLES OF SECURITY AND TRUST (POST 2016) | 2016年 / 9635卷
关键词：
SECURITY; AUTHENTICATION;
D O I：
10.1007/978-3-662-49635-0_10
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Recently, several composition results have been established, showing that two cryptographic protocols proven secure against a Dolev-Yao attacker continue to afford the same security guarantees when composed together, provided the protocol messages are tagged with the information of which protocol they belong to. The key technical tool used to establish this guarantee is a separation result which shows that any attack on the composition can be mapped to an attack on one of the composed protocols running in isolation. We consider the composition of protocols which, in addition to using cryptographic primitives, also employ randomization within the protocol to achieve their goals. We show that if the protocols never reveal a secret with a probability greater than a given threshold, then neither does their composition, given that protocol messages are tagged with the information of which protocol they belong to.
引用
收藏
页码：189 / 210
页数：22
相关论文
共 50 条
  • [1] Safely composing security protocols
    Cortier, Veronique
    Delaitre, Jeremie
    Delaune, Stephanie
    [J]. FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 352 - 363
  • [2] Safely composing security protocols
    Véronique Cortier
    Stéphanie Delaune
    [J]. Formal Methods in System Design, 2009, 34 : 1 - 36
  • [3] Safely composing security protocols
    Cortier, Veronique
    Delaune, Stephanie
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2009, 34 (01) : 1 - 36
  • [4] Composing Quantum Protocols in a Classical Environment
    Fehr, Serge
    Schaffner, Christian
    [J]. THEORY OF CRYPTOGRAPHY, 6TH THEORY OF CRYPTOGRAPHY CONFERENCE, TCC 2009, 2009, 5444 : 350 - 367
  • [5] Composing security protocols: From confidentiality to privacy
    School of Informatics, University of Edinburgh, United Kingdom
    不详
    不详
    不详
    [J]. Lect. Notes Comput. Sci., (324-343):
  • [6] A METHOD OF COMPOSING COMMUNICATION PROTOCOLS WITH PRIORITY SERVICE
    HIGUCHI, M
    SEKI, H
    KASAMI, T
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 1992, E75B (10) : 1032 - 1042
  • [7] Positron: Composing Commitment-Based Protocols
    Gerard, Scott N.
    Telang, Pankaj R.
    Kalia, Anup K.
    Singh, Munindar P.
    [J]. SERVICE-ORIENTED COMPUTING, (ICSOC 2015), 2015, 9435 : 19 - 35
  • [8] Composing and Verifying Commitment-Based Multiagent Protocols
    Baldoni, Matteo
    Baroglio, Cristina
    Chopra, Amit K.
    Singh, Munindar P.
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 10 - 17
  • [9] Composing Synergistic Macro Actions for Reinforcement Learning Agents
    Chen, Yu-Ming
    Chang, Kaun-Yu
    Liu, Chien
    Hsiao, Tsu-Ching
    Hong, Zhang-Wei
    Lee, Chun-Yi
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (05) : 7251 - 7258
  • [10] LAYSTREAM: composing standard gossip protocols for live video streaming
    Matos, Miguel
    Schiavoni, Valerio
    Riviere, Etienne
    Felber, Pascal
    Oliveira, Rui
    [J]. 14-TH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P), 2014,
12345