Book ChapterDOI
Unconditionally Secure Encryption Under Strong Attacks
Luke McAven,Reihaneh Safavi-Naini,Moti Yung +2 more
- pp 427-439
Reads0
Chats0
TLDR
A formalism for unconditionally secure single sender single receiver encryption under strong attacks is developed, and bounds on the keysize for systems secure under the various security notions are given.Abstract:
We develop a formalism for unconditionally secure single sender single receiver encryption under strong attacks. We consider coping with adversarial goals assuring secrecy and non–malleability, combined with adversarial power similar to those used in computationally secure systems: ciphertext only, chosen plaintext, and chosen ciphertext. We relate the various security notions described, and give bounds on the keysize for systems secure under the various security notions. In addition to defining systems with perfect secrecy, a la Shannon, we consider weaker e–secure systems.read more
Citations
More filters
Book ChapterDOI
Group law computations on jacobians of hyperelliptic curves
Craig Costello,Kristin E. Lauter +1 more
TL;DR: In this article, the authors derive an explicit method of computing the composition step in Cantor's algorithm for group operations on Jacobians of hyperelliptic curves, inspired by the geometric description of the group law.
Journal ArticleDOI
Unconditionally Secure Steganography Against Active Attacks
Junji Shikata,T. Matsumoto +1 more
TL;DR: An information-theoretic model for steganography in the presence of active adversaries is proposed by extending both Simmons' and Cachin's works and a generic construction of stegosystems secure against active attacks by using authenticated encryption in unconditional setting is shown.
Book ChapterDOI
Symmetric authentication codes with secrecy and unconditionally secure authenticated encryption
TL;DR: This work extends the traditional framework for considering integrity and confidentiality in an unconditionally secure environment is that of authentication codes with secrecy to encompass aspects of recent work on unconditional secure formulations of Authentication codes and encryption systems.
Book ChapterDOI
Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
TL;DR: An information-theoretic definition and constructions of non-malleable encryption and applications of information- theoretically secure tools for enhancing security of computationally secure cryptographic primitives are reviewed.
Book ChapterDOI
Unconditionally secure chaffing-and-winnowing: a relationship between encryption and authentication
TL;DR: It is shown through chaffing-and-winnowing that an A-code with a security level considerably low stands equivalently for anryption scheme with perfect secrecy, and a fully secure authentication scheme implies both perfect secrecy and non-malleability for an encryption scheme in the unconditionally secure setting.
References
More filters
Journal ArticleDOI
A mathematical theory of communication
TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI
Communication theory of secrecy systems
TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
Proceedings ArticleDOI
Public-key cryptosystems provably secure against chosen ciphertext attacks
Moni Naor,Moti Yung +1 more
TL;DR: This work shows how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given aPublic-Key cryptosystern secure against passive eavesdropping and a noninteractive zero-knowledge proof system in the shared string model.
Proceedings ArticleDOI
Non-malleable cryptography
TL;DR: Non-malleable schemes for each of the contexts of string commitment and zero-knowledge proofs of possession of knowledge, where a user need not know anything about the number or identity of other system users are presented.