Guarantees Aggelos Kiayias, Yona Raekow, and Alexander Russell University of ...  Home/Search
Context
Related
| uconn.edu/aggelos/papers...krrih10.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uconn.edu/aggelos/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We provide a new provably-secure steganographic encryption protocol that is proven secure in the complexity-theoretic framework of Hopper et al. The fundamental building block of our steganographic encryption protocol is a "one-time stegosystem" that allows two parties to transmit one-time steganographic messages of length shorter than the shared key with information-theoretic security guarantees. The employment of a pseudorandom number generator (PRNG) allows the transmission of longer... (Update)
Active bibliography (related documents): More All
0.2: Public-Key Steganography with Active Attacks - Backes, Cachin (2004) (Correct)
0.2: Public-Key Steganography - von Ahn, Hopper (2004) (Correct)
0.2: Efficient Provably Secure Public Key Steganography - Van Le (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ kiayias-ecient,
author = "Guarantees Aggelos Kiayias",
title = "Ecient Steganography with Provable Security",
url = "citeseer.ist.psu.edu/760410.html" }
Citations (may not include all citations):419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
128 Simple construction of almost kwise independent random varia.. - Alon, Goldreich et al. - 1992
65 Number-theoretic constructions of e#cient pseudo-random func.. - Naor, Reingold - 2004
47 An information-theoretic model for steganography - Cachin - 1998
34 Small-bias probability spaces: E#cient constructions and app.. (context) - Naor, Naor - 1993
31 A simple derivation of the coding theorem and some applicati.. (context) - Gallager - 1965
18 Provably secure steganography - Hopper, Langford et al. - 2002
16 An information-theoretic approach to steganography and water.. (context) - Mittelholzer - 1999
11 Modeling the security of steganographic systems - Zollner, Federrath et al. - 1998
1 Number 86 in Graduate Texts in Mathematics (context) - van Lint - 1998
Documents on the same site (http://cryptodrm.engr.uconn.edu/aggelos/papers/): More
Invited Survey Paper - Directions In Polynomial (Correct)
Asynchronously and Perfectly Secure - Communication Over One-Time (Correct)
Digital Object Identifier (DOI) 10.1007/s00446-004-0120-5 - Distrib Comput Scalable (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC