Practical Schemes for Interactive Data Exchange
نویسندگان
چکیده
Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to communicate losslessly their respective information via several rounds of communication.
منابع مشابه
Practical Schemes for Interactive Data Exchange Giuseppe CAIRE
Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to communicate losslessly their respective information via several rounds of communication.
متن کاملInvestigating the Interactive Effect of Corporate Governance and Corporate Social Responsibility on the Firm Value in the Tehran Stock Exchange
The purpose of this study is to investigate the effect of corporate governance (CG), corporate social responsibility (CSR) and their interactive effect on the value of companies listed on the Tehran Stock Exchange. For this purpose, the data of 194 companies listed on this stock exchange, which was selected using a systematic elimination method, from 2011-2017 were collected and analyzed using ...
متن کاملEfficient and Non-Malleable Proofs of Plaintext
We describe efficient protocols for non-malleable (interactive) proofs of plaintext knowledge for the RSA, Rabin, Paillier, and El Gamal encryption schemes. We also highlight some important applications of these protocols: – Chosen-ciphertext-secure, interactive encryption. In settings where both parties are on-line, an interactive encryption protocol may be used. We construct chosen-ciphertext...
متن کاملA non-interactive deniable authentication scheme in the standard model
the standard model Bin Wang ,Qing Zhao and Ke Dai Information Engineering College of Yangzhou University No.196 West HuaYang Road, Yangzhou City, Jiangsu Province, P.R.China E-mail: [email protected] Abstract: Deniable authentication protocols enable a sender to authenticate a message to a receiver such that the receiver is unable to prove the identity of the sender to a third party. In contrast...
متن کاملThe Construction of Ambiguous Optimistic Fair Exchange from Designated Confirmer Signature without Random Oracles
Ambiguous Optimistic Fair Exchange (AOFE), introduced by Huang et al. in ASIACRYPT 2008, is an extension of OFE that enhances the fairness of the two communicating parties in the exchange of signatures. The first scheme was proven secure without random oracles while its partial signature contains dozens of group elements. Recently, interactive AOFE was introduced and the construction is more pr...
متن کامل