Upper and Lower Bounds on Black-Box Steganography.
- Published in:
- Journal of Cryptology, 2009, v. 22, n. 3, p. 365, doi. 10.1007/s00145-008-9020-3
- By:
- Publication type:
- Article
Works matching IS 09332790 AND DT 2009 AND VI 22 AND IP 3
Results: 5
1
2
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
- Published in:
- Journal of Cryptology, 2009, v. 22, n. 3, p. 283, doi. 10.1007/s00145-007-9012-8
- By:
- Publication type:
- Article
3
General Composition and Universal Composability in Secure Multiparty Computation.
- Published in:
- Journal of Cryptology, 2009, v. 22, n. 3, p. 395, doi. 10.1007/s00145-008-9021-2
- By:
- Publication type:
- Article
4
Using Abelian Varieties to Improve Pairing-Based Cryptography.
- Published in:
- Journal of Cryptology, 2009, v. 22, n. 3, p. 330, doi. 10.1007/s00145-008-9022-1
- By:
- Publication type:
- Article
5
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions.
- Published in:
- Journal of Cryptology, 2009, v. 22, n. 3, p. 311, doi. 10.1007/s00145-008-9030-1
- By:
- Publication type:
- Article