Sciweavers

Share
TCC
2005
Springer
90views Cryptology» more  TCC 2005»
10 years 4 months ago
A Universally Composable Secure Channel Based on the KEM-DEM Framework
Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
10 years 4 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
TCC
2005
Springer
94views Cryptology» more  TCC 2005»
10 years 4 months ago
Optimal Error Correction Against Computationally Bounded Noise
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capab...
Silvio Micali, Chris Peikert, Madhu Sudan, David A...
TCC
2005
Springer
96views Cryptology» more  TCC 2005»
10 years 4 months ago
Secure Computation of the Mean and Related Statistics
Eike Kiltz, Gregor Leander, John Malone-Lee
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
10 years 4 months ago
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
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...
Jonathan Katz, Yehuda Lindell
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
10 years 4 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya
TCC
2005
Springer
103views Cryptology» more  TCC 2005»
10 years 4 months ago
Fair-Zero Knowledge
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...
Matt Lepinski, Silvio Micali, Abhi Shelat
TCC
2005
Springer
108views Cryptology» more  TCC 2005»
10 years 4 months ago
Comparing Two Notions of Simulatability
In this work, relations between the security notions standard simulatability and universal simulatability for cryptographic protocols are investigated. A simulatability-based notio...
Dennis Hofheinz, Dominique Unruh
TCC
2005
Springer
95views Cryptology» more  TCC 2005»
10 years 4 months ago
Keyword Search and Oblivious Pseudorandom Functions
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 ...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Om...
TCC
2005
Springer
113views Cryptology» more  TCC 2005»
10 years 4 months ago
Entropic Security and the Encryption of High Entropy Messages
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 ...
Yevgeniy Dodis, Adam Smith
books