Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings. (Q2388712)

From MaRDI portal





scientific article
Language Label Description Also known as
English
Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings.
scientific article

    Statements

    Theory of cryptography. Second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005. Proceedings. (English)
    0 references
    20 September 2005
    0 references
    The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1048.94003). Indexed articles: \textit{Micali, Silvio; Peikert, Chris; Sudan, Madhu; Wilson, David A.}, Optimal error correction against computationally bounded noise, 1-16 [Zbl 1079.94565] \textit{Canetti, Ran; Halevi, Shai; Steiner, Michael}, Hardness amplification of weakly verifiable puzzles, 17-33 [Zbl 1079.94538] \textit{Lin, Henry; Trevisan, Luca; Wee, Hoeteck}, On hardness amplification of one-way functions, 34-49 [Zbl 1079.94559] \textit{Groth, Jens}, Cryptography in subgroups of \(\mathbb Z^*_n\), 50-65 [Zbl 1079.94548] \textit{Naor, Moni; Nussboim, Asaf; Tromer, Eran}, Efficiently constructible huge graphs that preserve first order properties of random graphs, 66-85 [Zbl 1079.05091] \textit{Hofheinz, Dennis; Unruh, Dominique}, Comparing two notions of simulatability, 86-103 [Zbl 1079.94551] \textit{Prabhakaran, Manoj; Sahai, Amit}, Relaxing environmental security: Monitored functionalities and client-server computation, 104-127 [Zbl 1079.94569] \textit{Katz, Jonathan; Lindell, Yehuda}, Handling expected polynomial-time strategies in simulation-based security proofs, 128-149 [Zbl 1079.94555] \textit{Canetti, Ran; Halevi, Shai; Katz, Jonathan}, Adaptively-secure, non-interactive public-key encryption, 150-168 [Zbl 1079.94537] \textit{Micciancio, Daniele; Panjwani, Saurabh}, Adaptive security of symbolic encryption, 169-187 [Zbl 1079.68555] \textit{Dodis, Yevgeniy; Katz, Jonathan}, Chosen-ciphertext security of multiple encryption, 188-209 [Zbl 1079.94545] \textit{Backes, Michael; Cachin, Christian}, Public-key steganography with active attacks, 210-226 [Zbl 1079.94530] \textit{Dedić, Nenad; Itkis, Gene; Reyzin, Leonid; Russell, Scott}, Upper and lower bounds on black-box steganography, 227-244 [Zbl 1079.94544] \textit{Lepinski, Matt; Micali, Silvio; Shelat, Abhi}, Fair-zero knowledge, 245-263 [Zbl 1079.94558] \textit{Hohenberger, Susan; Lysyanskaya, Anna}, How to securely outsource cryptographic computations, 264-282 [Zbl 1079.94552] \textit{Kiltz, Eike; Leander, Gregor; Malone-Lee, John}, Secure computation of the mean and related statistics, 283-302 [Zbl 1079.94556] \textit{Freedman, Michael J.; Ishai, Yuval; Pinkas, Benny; Reingold, Omer}, Keyword search and oblivious pseudorandom functions, 303-324 [Zbl 1079.94546] \textit{Boneh, Dan; Goh, Eu-Jin; Nissim, Kobbi}, Evaluating 2-DNF formulas on ciphertexts, 325-341 [Zbl 1079.94534] \textit{Cramer, Ronald; Damgård, Ivan; Ishai, Yuval}, Share conversion, pseudorandom secret-sharing and applications to secure computation, 342-362 [Zbl 1079.94541] \textit{Chawla, Shuchi; Dwork, Cynthia; McSherry, Frank; Smith, Adam; Wee, Hoeteck}, Toward privacy in public databases, 363-385 [Zbl 1079.94539] \textit{Ben-Or, Michael; Horodecki, Michał; Leung, Debbie W.; Mayers, Dominic; Oppenheim, Jonathan}, The universal composable security of quantum key distribution, 386-406 [Zbl 1079.94532] \textit{Renner, Renato; König, Robert}, Universally composable privacy amplification against quantum adversaries, 407-425 [Zbl 1079.94570] \textit{Nagao, Waka; Manabe, Yoshifumi; Okamoto, Tatsuaki}, A universally composable secure channel based on the KEM-DEM framework, 426-444 [Zbl 1079.94567] \textit{Ishai, Yuval; Kushilevitz, Eyal; Ostrovsky, Rafail}, Sufficient conditions for collision-resistant hashing, 445-456 [Zbl 1079.94554] \textit{Nguyen, Minh-Huyen}, The relationship between password-authenticated key exchange and other cryptographic primitives, 457-475 [Zbl 1081.94534] \textit{Datta, Anupam; Küsters, Ralf; Mitchell, John C.; Ramanathan, Ajith}, On the relationships between notions of simulation-based security, 476-494 [Zbl 1079.94543] \textit{González Vasco, María Isabel; Martínez, Consuelo; Steinwandt, Rainer; Villar, Jorge L.}, A new Cramer-Shoup like methodology for group based provably secure encryption schemes, 495-509 [Zbl 1079.94575] \textit{Jarecki, Stanisław; Saxena, Nitesh}, Further simplifications in proactive RSA signatures, 510-528 [Zbl 1081.94528] \textit{Goldwasser, Shafi; Kharchenko, Dmitriy}, Proof of plaintext knowledge for the ajtai-dwork cryptosystem, 529-555 [Zbl 1079.94547] \textit{Dodis, Yevgeniy; Smith, Adam}, Entropic security and the encryption of high entropy messages, 556-577 [Zbl 1080.94523] \textit{Ding, Yan Zong}, Error correction in the bounded storage model, 578-599 [Zbl 1080.94522] \textit{Beimel, Amos; Tassa, Tamir; Weinreb, Enav}, Characterizing ideal weighted threshold secret sharing, 600-619 [Zbl 1079.94531]
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references