TCC
2005
Springer
13 years 10 months ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifi...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
In this work, relations between the security notions standard simulatability and universal simulatability for cryptographic protocols are investigated. A simulatability-based notio...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are ...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We initiate a study of Maurer’s bounded storage model (JoC, 1992) in presence of transmission errors and perhaps other types of errors that cause different parties to have incon...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negati...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...