English
Related papers

Related papers: Relaxed Conditions for Secrecy in a Role-Based Spe…

200 papers

Covert communication allows us to transmit messages in such a way that it is not possible to detect that the communication is occurring. This provides protection in situations where knowledge that people are talking to each other may be…

Quantum Physics · Physics 2018-02-28 Juan Miguel Arrazola , Ryan Amiri

In this paper, we present a new formal method to analyze cryptographic protocols statically for the property of secrecy. It consists in inspecting the level of security of every component in the protocol and making sure that it does not…

Cryptography and Security · Computer Science 2018-01-12 Jaouhar Fattahi , Mohamed Mejri , Hanane Houmani

In this paper, we present a new semi-decidable procedure to analyze cryptographic protocols for secrecy based on a new class of functions that we call: the Witness-Functions. A Witness-Function is a reliable function that guarantees the…

Cryptography and Security · Computer Science 2015-07-30 Jaouhar Fattahi , Mohamed Mejri , Hanane Houmani

The guarantees of security and privacy defenses are often strengthened by relaxing the assumptions made about attackers or the context in which defenses are deployed. Such relaxations can be a highly worthwhile topic of exploration---even…

Machine Learning · Computer Science 2020-04-22 Úlfar Erlingsson , Ilya Mironov , Ananth Raghunathan , Shuang Song

Protocol narrations are widely used in security as semi-formal notations to specify conversations between roles. We define a translation from a protocol narration to the sequences of operations to be performed by each role. Unlike previous…

Logic in Computer Science · Computer Science 2009-10-28 Yannick Chevalier , Michael Rusinowitch

It has been found that the signal can be encoded in the choice of the measurement basis of one of the communicating parties, while the outcomes of the measurement are irrelevant for the communication and therefore may be discarded. The…

Quantum Physics · Physics 2015-06-17 Dong Xie , An Min Wang

Proving that a cryptographic protocol is correct for secrecy is a hard task. One of the strongest strategies to reach this goal is to show that it is increasing, which means that the security level of every single atomic message exchanged…

Cryptography and Security · Computer Science 2019-12-03 Jaouhar Fattahi , Mohamed Mejri , Marwa Ziadia , Takwa Omrani , Emil Pricop

Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver share secret key, which they use to encrypt communication and ensure distortion at an adversary. A model is…

Information Theory · Computer Science 2015-04-14 Curt Schieler , Paul Cuff

This paper provides an overview of a problem in information-theoretic privacy mechanism design, addressing two scenarios in which private data is either observable or hidden. In each scenario, different privacy measures are used, including…

Information Theory · Computer Science 2024-10-08 Amirreza Zamani , Mikael Skoglund

In systems design, we generally distinguish the architecture and the protocol levels. In the context of privacy by design, in the first case, we talk about privacy architectures, which define the privacy goals and the main features of the…

Cryptography and Security · Computer Science 2015-01-16 Vinh-Thong Ta , Thibaud Antignac

Inspired by problems in Private Information Retrieval, we consider the setting where two users need to establish a communication protocol to transmit a secret without revealing it to external observers. This is a question of how large a…

Combinatorics · Mathematics 2021-05-20 Ragnar Freij-Hollanti , Olga Kuznetsova

In this paper, we enunciate the theorem of secrecy in tagged protocols using the theory of witness-functions and we run a formal analysis on a new tagged version of the Needham-Schroeder public-key protocol using this theorem. We discuss…

Cryptography and Security · Computer Science 2018-03-23 Jaouhar Fattahi

In this paper, we use the witness-functions to analyze cryptographic protocols for secrecy under nonempty equational theories. The witness-functions are safe metrics used to compute security. An analysis with a witness-function consists in…

Cryptography and Security · Computer Science 2018-01-08 Jaouhar Fattahi , Mohamed Mejri

The secrecy performance in both near-field and far-field communications is analyzed using two fundamental metrics: the secrecy capacity under a power constraint and the minimum power requirement to achieve a specified secrecy rate target.…

Information Theory · Computer Science 2025-04-11 Boqun Zhao , Chongjun Ouyang , Xingqi Zhang , Yuanwei Liu

A secret key can be used to conceal information from an eavesdropper during communication, as in Shannon's cipher system. Most theoretical guarantees of secrecy require the secret key space to grow exponentially with the length of…

Information Theory · Computer Science 2012-05-18 Curt Schieler , Paul Cuff

We consider a cascade network where a sequence of nodes each send a message to their downstream neighbor to enable coordination, the first node having access to an information signal. An adversary also receives all of the communication as…

Information Theory · Computer Science 2014-11-04 Paul Cuff

Communicating anonymously comes at a cost - and large communities have been in a constant tug-of-war between the development of faster protocols, and the improvement of security analyses. Thereby more intricate privacy goals emerged and…

Cryptography and Security · Computer Science 2020-11-18 Christiane Kuhn , Friederike Kitzing , Thorsten Strufe

Learning to communicate through interaction, rather than relying on explicit supervision, is often considered a prerequisite for developing a general AI. We study a setting where two agents engage in playing a referential game and, from…

Machine Learning · Computer Science 2017-11-07 Serhii Havrylov , Ivan Titov

Anonymity has become a significant issue in security field by recent advances in information technology and internet. The main objective of anonymity is hiding and concealing entities privacy inside a system. Many methods and protocols have…

Cryptography and Security · Computer Science 2015-10-06 Morteza Yousefi Kharaji , Fatemeh Salehi Rizi

The classical model of signaling games assumes that the receiver exactly know the type space (private information) of the sender and be able to discriminate each type of the sender distinctly. However, the justification of this assumption…

Computer Science and Game Theory · Computer Science 2010-02-24 Haoyang Wu
‹ Prev 1 2 3 10 Next ›