Theory of cryptography : Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005 : proceedings
| 000 | 01857camuu2200433 a 4500 | |
| 001 | 000045561484 | |
| 005 | 20091124175901 | |
| 008 | 050105s2005 gw a b 101 0 eng d | |
| 010 | ▼a 2005920136 | |
| 020 | ▼a 3540245731 (pbk. : alk. paper) | |
| 020 | ▼a 9783540245735 (pbk. : alk. paper) | |
| 035 | ▼a (OCoLC)ocm58393058 | |
| 035 | ▼a (OCoLC)58393058 | |
| 035 | ▼a (KERIS)REF000012153268 | |
| 040 | ▼a CUS ▼c CUS ▼d C$Q ▼d IQU ▼d MUQ ▼d OCL ▼d DLC ▼d 211009 | |
| 042 | ▼a lccopycat | |
| 050 | 0 0 | ▼a QA76.9.A25 ▼b T473 2005 |
| 082 | 0 0 | ▼a 005.8 ▼2 22 |
| 090 | ▼a 005.8 ▼b T396t ▼c 2 | |
| 111 | 2 | ▼a Theory of Cryptography Conference ▼n (2nd : ▼d 2005 : ▼c Cambridge, Mass.) |
| 245 | 1 0 | ▼a Theory of cryptography : ▼b Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005 : proceedings / ▼c Joe Kilian (ed.). |
| 246 | 3 0 | ▼a Second Theory of Cryptography Conference |
| 246 | 3 0 | ▼a Theory of Cryptography Conference |
| 246 | 3 0 | ▼a TCC 2005 |
| 260 | ▼a Berlin ; ▼a New York : ▼b Springer, ▼c c2005. | |
| 300 | ▼a xii, 619 p. : ▼b ill. ; ▼c 24 cm. | |
| 490 | 1 | ▼a Lecture notes in computer science, ▼x 0302-9743 ; ▼v 3378 |
| 504 | ▼a Includes bibliographical references and index. | |
| 530 | ▼a Also issued online. | |
| 650 | 0 | ▼a Computer security ▼v Congresses. |
| 650 | 0 | ▼a Cryptography ▼v Congresses. |
| 650 | 6 | ▼a Securite informatique ▼v Congres. |
| 650 | 6 | ▼a Cryptographie ▼v Congres. |
| 700 | 1 | ▼a Kilian, Joe. |
| 830 | 0 | ▼a Lecture notes in computer science ; ▼v 3378. |
| 945 | ▼a KINS |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.8 T396t 2 | 등록번호 121186713 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
목차
Hardness Amplification and Error Correction.- Optimal Error Correction Against Computationally Bounded Noise.- Hardness Amplification of Weakly Verifiable Puzzles.- On Hardness Amplification of One-Way Functions.- Graphs and Groups.- Cryptography in Subgroups of .- Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs.- Simulation and Secure Computation.- Comparing Two Notions of Simulatability.- Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation.- Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.- Security of Encryption.- Adaptively-Secure, Non-interactive Public-Key Encryption.- Adaptive Security of Symbolic Encryption.- Chosen-Ciphertext Security of Multiple Encryption.- Steganography and Zero Knowledge.- Public-Key Steganography with Active Attacks.- Upper and Lower Bounds on Black-Box Steganography.- Fair-Zero Knowledge.- Secure Computation I.- How to Securely Outsource Cryptographic Computations.- Secure Computation of the Mean and Related Statistics.- Keyword Search and Oblivious Pseudorandom Functions.- Secure Computation II.- Evaluating 2-DNF Formulas on Ciphertexts.- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.- Toward Privacy in Public Databases.- Quantum Cryptography and Universal Composability.- The Universal Composable Security of Quantum Key Distribution.- Universally Composable Privacy Amplification Against Quantum Adversaries.- A Universally Composable Secure Channel Based on the KEM-DEM Framework.- Cryptographic Primitives and Security.- Sufficient Conditions for Collision-Resistant Hashing.- The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives.- On the Relationships Between Notions of Simulation-Based Security.- Encryption and Signatures.- A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes.- Further Simplifications in Proactive RSA Signatures.- Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem.- Information Theoretic Cryptography.- Entropic Security and the Encryption of High Entropy Messages.- Error Correction in the Bounded Storage Model.- Characterizing Ideal Weighted Threshold Secret Sharing.
정보제공 :
