Cryptography Reference
In-Depth Information
[BLMO95]
Jack Brassil, Steve Low, Nicholas Maxemchuk, and Larry
O'Gorman. Hiding information in document images.
In
Proceedings of the 1995 Conference on Information
Sciences and Systems
, March 1995.
[Blu82]
M. Blum. Coin flipping by telephone: A protocol for
solving impossible problems.
Proceedings of the 24th
IEEE Computer Conference (CompCon)
, 1982.
[BMS01]
Adam Back, Ulf Moeller, and Anton Stiglic. Traffic anal-
ysis attacks and trade-offs in anonymity providing sys-
tems. In
Fourth Information Hiding Workshop
,pages
257-269, 2001.
[BO96]
Jack Brassil and Larry O'Gorman. Watermarking docu-
ment images withbounding box expansion. In
Informa-
tion Hiding, Lecture Notes of Computer Science (1174)
,
New York, Heidelberg, 1996. Springer-Verlag.
[Boy90]
C. Boyd. A new multiple key cipher and an improved
voting scheme. In
Advances in Cryptology-EUROCRYPT
'89 Proceedings
. Springer-Verlag, 1990.
[Bra93]
S.A. Brands. An efficient off-line electronic cash sys-
tem based on the representation problem. Technical
Report CSR9323, Computer Science Department, CWI,
Mar 1993.
[Bra95a]
Stefan A. Brands.
Rethinking Publike Key Infrastructure
and Digital Certificates- Building in Privacy
.PhDthesis,
Centrum voor Wiskunde en Informatica, Amsterdam,
1995.
[Bra95b]
Stefan A. Brands. Secret-key certificates. Technical Re-
port CS-R9510, Centrum voor Wiskunde en Informat-
ica, Amsterdam, 1995.
[Bri82]
E.F. Brickell. A fast modular multiplication algorithm
with applications to two key cryptography. In
Advances
in Cryptology: Proceedings of Crypto 82
.PlenumPress,
1982.
[BS88]
Michael F. Barnsley and Alan D. Sloan. A better way to
compress images.
Byte Magazine
, pages 215-223, Jan-
uary 1988.
