Advances in Cryptology -- CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010, Proceedings
CRYPTO2010, the30thAnnualInternationalCryptologyConference, wassp- sored by the International Association for Cryptologic Research (IACR) in - operation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department of the University of C- ifornia at Santa Barbara. The conference was held in Santa Barbara, Calif- nia, during August 15-19, 2010, in conjunction with CHES 2010 (Workshop on Cryptographic Hardware and Embedded Systems). Zul?kar Ramzan served as the General Chair. The conference received 203 submissions. The quality of the submissions was very high, and the selection process was a challenging one. The Program C- mittee, aided by a 159 external reviewers, reviewed the submissions and after an intensive review period the committee accepted 41 of these submissions. Three submissions were merged into a single paper and two papers were merged into a single talk, yielding a total of 39 papers in the proceedings and 38 presen- tions at the conference. The revised versions of the 39 papers appearing in the proceedings were not subject to editorial review and the authors bear full - sponsibility for their contents. The best-paper award was awarded to the paper "Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness" by Craig Gentry. The conference featured two invited presentations. This year we celebrated 25 years from the publication of the ground-breaking work of Sha? Goldwasser, Silvio Micali and Charles Racko? "The Knowledge Complexity of Interactive Proof-Systems.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abort adaptive adversary algorithm Alice apply assumption attack bits bound ciphertext circuit client commitment scheme computation construction corrupted CRYPTO cryptographic cryptosystem Cuckoo hashing decryption deﬁned deﬁnition denote diﬀerent diﬀerential distinguisher distribution eﬃcient encryption scheme EUROCRYPT evaluation extractor F F F Feistel network ﬁrst ﬁxed full version fully homomorphic function f hash function Heidelberg Heidelberg 2009 HMAC homomorphic encryption honest parties ideal functionality implement IND-CCA input instantiation integer interactive lattice leakage-resilient Lemma LNCS matrix min-entropy Naor obfuscation oblivious oblivious transfer one-way functions output pair permutation phase polynomial probability proof protocol prove pseudorandom public key quantum queries random oracle require result round sampling secret key secret sharing security parameter semantic security semi-honest sends server shares side-channel attacks simulator speciﬁc Springer STOC string Theorem trapdoor two-party vector veriﬁer zero-knowledge zero-knowledge proofs