Cryptography Reference
In-Depth Information
2006, Jeju Island, Korea, November 8-10, 2006, Proceed-
ings
, volume 4283 of
Lecture Notes in Computer Science
.
Springer, 2006.
[SK94]
Kazue Sako and Joe Kilian. Secure voting using partially
compatible homomorphisms. In
CRYPTO '94: Proceed-
ings of the 14th Annual International Cryptology Con-
ference on Advances in Cryptology
, pages 411-424, Lon-
don, UK, 1994. Springer-Verlag.
[SK95]
K Sako and J Kilian. Receipt-free mix-type voting
schemes. In
Advances in Cryptology- Eurocrypt '95
,
pages 393-403. Springer-Verlag, 1995.
[SKE00]
A.P. Petitcolas (Editor) Stefan Katzenbeisser (Editor), Fa-
bien.
Information Hiding Techniques for Steganography
and Digital Watermarking
. Artech House, January 2000.
[Spi05]
Matthew D. Spisak.
An analysis of perturbed quantiza-
tion steganography in the spatial domain
.PhDthesis,
Air Force Institute of Technology, Wright-Patterson Air
Force Base, Ohio, April 2005.
[SRG00]
Paul F. Syverson, Michael G. Reed, and David M. Gold-
schlag. Onion routing access configurations. In
DISCEX
2000: Proceedings of the DARPA Information Survivabil-
ity Conference and Exposition
, volume I, pages 34-40,
Hilton Head, SC, January 2000. IEEE CS Press.
[SSG97]
Paul F. Syverson, Stuart G. Stubblebine, and David M.
Goldschlag. Unlinkable serial transactions. In
Financial
Cryptography
, pages 39-56, 1997.
[Sto88]
James Storer.
Data Compression
. Computer Science
Press, Rockville, MD, 1988.
[STRL00]
Paul F. Syverson, Gene Tsudik, Michael G. Reed, and
Carl E. Landwehr. Towards an analysis of onion rout-
ing security. In
Workshop onDesign Issues in Anonymity
and Unobservability
, Berkeley, CA, July 2000.
[SW63]
Claude E. Shannon andWarrenWeaver.
AMathematical
Theory of Communication
. University of Illinois Press,
Champaign, IL, USA, 1963.
