Results 11  20
of
114
Cryptographic Primitives for Information Authentication  State of the Art
, 1998
"... This paper describes the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signature schemes; the first class can be divided into Manipulation Detection Codes (MDCs, also known as oneway and collision ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
This paper describes the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signature schemes; the first class can be divided into Manipulation Detection Codes (MDCs, also known as oneway and collision resistant hash functions) and Message Authentication Codes (or MACs). The theoretical background is sketched, but most attention is paid to overview the large number of practical constructions for hash functions and to the recent developments in their cryptanalysis. It is also explained to what extent the security of these primitives can be reduced in a provable way to realistic assumptions.
A New CryptoWatermarking Method for Medical Images Safe Transfer
 in Proc. 12 th European Signal Processing Conference (EUSIPCO’04
, 2004
"... This work presents a new method that combines image encryption and watermarking technique for safe transmission purpose. This method is based on the combination of publicprivate keys and secret key ciphering, and watermarking. The encryption algorithm with secret key is applied to the image. We enc ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
(Show Context)
This work presents a new method that combines image encryption and watermarking technique for safe transmission purpose. This method is based on the combination of publicprivate keys and secret key ciphering, and watermarking. The encryption algorithm with secret key is applied to the image. We encrypt the secret key with an encryption method based on publicprivate keys. Then, this secret key is embedded in the encrypted image. We have applied and showed the results of our method to medical images. 1.
Perfect Cryptographic Security from Partially Independent Channels
 Proc. 23rd ACM Symposium on Theory of Computing
, 1991
"... Several protocols are presented that allow two parties Alice and Bob not sharing any secret information initially (except possibly a short key to be used for authentication) to generate a long shared secret key such that even an enemy Eve with unlimited computing power is unable to obtain a nonnegl ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
(Show Context)
Several protocols are presented that allow two parties Alice and Bob not sharing any secret information initially (except possibly a short key to be used for authentication) to generate a long shared secret key such that even an enemy Eve with unlimited computing power is unable to obtain a nonnegligible amount of information (in Shannon's sense) about this key. Two different models are considered. In a first model we assume that Alice can send information to Bob over a noisy main channel but that Eve is able to receive the same information over a parallel independent noisy channel from Alice to Eve. In a second, more general model we assume that Alice, Bob and Eve receive the output of a random source (e.g., a satellite broadcasting random bits) over three independent individual channels. The condition that the channels be independent can be replaced by the condition that they be independent only to a known, arbitrarily small degree. We demonstrate that even when Eve's channel is sup...
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
"... This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without rely ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without relying on higherlayer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on informationtheoretic security. We then describe the evolution of secure transmission strategies from pointtopoint channels to multipleantenna systems, followed by generalizations to multiuser broadcast, multipleaccess, interference, and relay networks. Secretkey generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of interdisciplinary approaches based on game theory and stochastic geometry. The associated problem of physical layer message authentication is also briefly introduced. The survey concludes with observations on potential research directions in this area.
Linking classical and quantum key agreement: is there \bound information
 Algorithmica
, 2000
"... Abstract. After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
(Show Context)
Abstract. After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We show that the limits of tolerable noise are identical for classical and quantum protocols in many cases. More specifically, we prove that a quantum state between two parties is entangled if and only if the classical random variables resulting from optimal measurements provide some mutual classical information between the parties. In addition, we present evidence which strongly suggests that the potentials of classical and of quantum protocols are equal in every situation. An important consequence, in the purely classical regime, of such a correspondence would be the existence of a classical counterpart of socalled bound entanglement, namely “bound information” that cannot be used for generating a secret key by any protocol. This stands in sharp contrast to what was previously believed. Keywords. Secretkey agreement, intrinsic information, secretkey rate, quantum privacy amplification, purification, entanglement. 1
Secure assisted quantum computation
 Quantum Information and Computation
, 2005
"... Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
(Show Context)
Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her or if he is introducing errors. 1
AONTRS: Blending security and performance in dispersed storage systems
 in FAST’11
, 2011
"... Dispersing files across multiple sites yields a variety of obvious benefits, such as availability, proximity and reliability. Less obviously, it enables security to be achieved without relying on encryption keys. Standard approaches to dispersal either achieve very high security with correspondingly ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
(Show Context)
Dispersing files across multiple sites yields a variety of obvious benefits, such as availability, proximity and reliability. Less obviously, it enables security to be achieved without relying on encryption keys. Standard approaches to dispersal either achieve very high security with correspondingly high computational and storage costs, or low security with lower costs. In this paper, we describe a new dispersal scheme, called AONTRS, which blends an AllOrNothing Transform with ReedSolomon coding to achieve high security with low computational and storage costs. We evaluate this scheme both theoretically and as implemented with standard open source tools. AONTRS forms the backbone of a commercial dispersed storage system, which we briefly describe and then use as a further experimental testbed. We conclude with details of actual deployments. 1
QUANTUM VERNAM CIPHER
, 2001
"... We discuss aspects of secure quantum communication by proposing and analyzing a quantum analog of the Vernam cipher (onetimepad). The quantum Vernam cipher uses entanglement as the key to encrypt quantum information sent through an insecure quantum channel. First, in sharp contrast with the classi ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
We discuss aspects of secure quantum communication by proposing and analyzing a quantum analog of the Vernam cipher (onetimepad). The quantum Vernam cipher uses entanglement as the key to encrypt quantum information sent through an insecure quantum channel. First, in sharp contrast with the classical Vernam cipher, the quantum key can be recycled securely. We show that key recycling is intrinsic to the quantum ciphertext, rather than using entanglement as the key. Second, the scheme detects and corrects for arbitrary transmission errors, and it does so using only local operations and classical communication (LOCC) between the sender and the receiver. The application to quantum message authentication is discussed. Quantum secret sharing schemes with similar properties are characterized. We also discuss two general issues, the relation between secret communication and secret sharing, the classification of secure communication protocols.
The boundedstorage model in the presence of a quantum adversary
 IEEE Transactions on Information Theory
, 2008
"... Abstract—An extractor is a function that is used to extract randomness. Given an imperfect random sourceX and a uniform seedY, the output (X; Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic a ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
(Show Context)
Abstract—An extractor is a function that is used to extract randomness. Given an imperfect random sourceX and a uniform seedY, the output (X; Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic applications. We prove that certain extractors are suitable for key expansion in the boundedstorage model where the adversary has a limited amount of quantum memory. For extractors with onebit output we show that the extracted bit is essentially equally secure as in the case where the adversary has classical resources. We prove the security of certain constructions that output multiple bits in the boundedstorage model. Index Terms—Boundedstorage model, cryptography, extractors, locking, privacy amplification, quantum information theory, quantum key distribution, quantum memory, security proofs, universal composability. I.