Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19--21, 2004. Proceedings. (Q1884586)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19--21, 2004. Proceedings.
scientific article

    Statements

    Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19--21, 2004. Proceedings. (English)
    0 references
    3 November 2004
    0 references
    The articles of this volume will be reviewed individually. Indexed articles: \textit{Reingold, Omer; Trevisan, Luca; Vadhan, Salil}, Notions of reducibility between cryptographic primitives, 1-20 [Zbl 1197.94202] \textit{Maurer, Ueli; Renner, Renato; Holenstein, Clemens}, Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology, 21-39 [Zbl 1197.94196] \textit{Canetti, Ran; Goldreich, Oded; Halevi, Shai}, On the random-oracle methodology as applied to length-restricted signature schemes, 40-57 [Zbl 1197.94215] \textit{Hofheinz, Dennis; Müller-Quade, Jörn}, Universally composable commitments using random oracles, 58-76 [Zbl 1197.94191] \textit{Goldwasser, Shafi; Waisbard, Erez}, Transformation of digital signature schemes into designated confirmer signature schemes, 77-100 [Zbl 1197.94217] \textit{Dwork, Cynthia; Shaltiel, Ronen; Smith, Adam; Trevisan, Luca}, List-decoding of linear functions and analysis of a two-round zero-knowledge argument, 101-120 [Zbl 1197.94185] \textit{Barak, Boaz; Pass, Rafael}, On the possibility of one-message weak zero-knowledge, 121-132 [Zbl 1197.94175] \textit{Micciancio, Daniele; Warinschi, Bogdan}, Soundness of formal encryption in the presence of active adversaries, 133-151 [Zbl 1197.94198] \textit{Groth, Jens}, Rerandomizable and replayable adaptive chosen ciphertext attack secure cryptosystems, 152-170 [Zbl 1197.94188] \textit{MacKenzie, Philip; Reiter, Michael K.; Yang, Ke}, Alternatives to non-malleability: Definitions, constructions, and applications (extended abstract), 171-190 [Zbl 1197.94193] \textit{Rosen, Alon}, A note on constant-round zero-knowledge proofs for NP, 191-202 [Zbl 1197.94204] \textit{Lindell, Yehuda}, Lower bounds for concurrent self composition, 203-222 [Zbl 1176.94069] \textit{Cramer, Ronald; Damgård, Ivan}, Secret-key zero-knowlegde and non-interactive verifiable exponentiation, 223-237 [Zbl 1197.94216] \textit{Beimel, Amos; Malkin, Tal}, A quantitative approach to reductions in secure computation, 238-257 [Zbl 1197.94178] \textit{Gennaro, Rosario; Lysyanskaya, Anna; Malkin, Tal; Micali, Silvio; Rabin, Tal}, Algorithmic tamper-proof (ATP) security: Theoretical foundations for security against hardware tampering, 258-277 [Zbl 1197.94187] \textit{Micali, Silvio; Reyzin, Leonid}, Physically observable cryptography (extended abstract), 278-296 [Zbl 1197.94197] \textit{Garay, Juan A.}, Efficient and universally composable committed oblivious transfer and applications, 297-316 [Zbl 1197.94186] \textit{Wikström, Douglas}, A universally composable mix-net, 317-335 [Zbl 1197.94210] \textit{Backes, Michael; Pfitzmann, Birgit; Waidner, Michael}, A general composition theorem for secure reactive systems, 336-354 [Zbl 1197.94173] \textit{Damgård, Ivan; Fehr, Serge; Morozov, Kirill; Salvail, Louis}, Unfair noisy channels and oblivious transfer, 355-373 [Zbl 1197.94183] \textit{Crépeau, Claude; Dumais, Paul; Mayers, Dominic; Salvail, Louis}, Computational collapse of quantum state with application to oblivious transfer, 374-393 [Zbl 1197.94182] \textit{Haitner, Iftach}, Implementing oblivious transfer using collection of dense trapdoor permutations, 394-409 [Zbl 1197.94189] \textit{Maurer, Ueli; Pietrzak, Krzysztof}, Composition of random systems: When two weak make one strong, 410-427 [Zbl 1197.94195] \textit{Nguyen, Minh-Huyen; Vadhan, Salil}, Simpler session-key generation from short random passwords, 428-445 [Zbl 1197.94200] \textit{Ding, Yan Zong; Harnik, Danny; Rosen, Alon; Shaltiel, Ronen}, Constant-round oblivious transfer in the bounded storage model, 446-472 [Zbl 1197.94184] \textit{Tassa, Tamir}, Hierarchical threshold secret sharing, 473-490 [Zbl 1197.94220] \textit{Johnson, Mark; Wagner, David; Ramchandran, Kannan}, On compressing encrypted data without the encryption key, 491-504 [Zbl 1197.68044] \textit{Rivest, Ronald L.}, On the notion of pseudo-free groups, 505-521 [Zbl 1197.94203]
    0 references

    Identifiers

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