Masayuki Abe – författare

The RSA Conference, with over 15,000 attendees and 300 exhibitors, is the largest computer security event of the year. The Cryptographers’ Track (CT- RSA) is a research conference within the RSA Conference. Starting in 2001, CT-RSA continues to its seventh year and is now regarded as one of the major regularly staged event for presenting the results of cryptographic research to a wide variety of audiences. The proceedings of CT-RSA 2007 contain 25 papers selected from 73 s- missions which cover all the topics of cryptography. All the submissions were reviewed by at least three reviewers, which was possible by the hard work of 23 Program Committee members and many external reviewers listed in the foll- ing pages. The papers were selected as a result of conscientious discussion. The program includes two invited talks, by Michel Rabin and Andrew Odlyzko. I would like to express my gratitude to the Program Committee members, whowereenthusiasticfromtheverybeginningofthis completedproject.Thanks also to the external reviewers including those who completed urgent reviews during the discussion phase. Special thanks to Shai Halevi for providing and maintaining the Web review system. Finally, I would like to thank Burt Kaliski of RSA Laboratories and the Steering Committee for their suggestions and c- tinuous assistance.

The RSA Conference, with over 15,000 attendees and 300 exhibitors, is the largest computer security event of the year. The Cryptographers’ Track (CT- RSA) is a research conference within the RSA Conference. Starting in 2001, CT-RSA continues to its seventh year and is now regarded as one of the major regularly staged event for presenting the results of cryptographic research to a wide variety of audiences. The proceedings of CT-RSA 2007 contain 25 papers selected from 73 s- missions which cover all the topics of cryptography. All the submissions were reviewed by at least three reviewers, which was possible by the hard work of 23 Program Committee members and many external reviewers listed in the foll- ing pages. The papers were selected as a result of conscientious discussion. The program includes two invited talks, by Michel Rabin and Andrew Odlyzko. I would like to express my gratitude to the Program Committee members, whowereenthusiasticfromtheverybeginningofthis completedproject.Thanks also to the external reviewers including those who completed urgent reviews during the discussion phase. Special thanks to Shai Halevi for providing and maintaining the Web review system. Finally, I would like to thank Burt Kaliski of RSA Laboratories and the Steering Committee for their suggestions and c- tinuous assistance.

ASIACRYPT 2010 was held in the Swiss otel Merchant Court in Singapore, d- ing December 5-9, 2010. The conference was sponsored by the International Association for Cryptologic Research (IACR) in cooperation with the Coding and Cryptography Research Group of Nanyang Technological University. It was also supported by the Singapore Tourism Board, and co-sponsored by the - tional Research Foundation of Singapore, Lee Foundation, IBM Singapore Ltd., O'Connor'sSingaporeLtd.,Pu?ersoftLtd.,PrivylinkLtd.,Hewlett-PackardS- gaporeLtd.,JardineOneSolutionLtd.,andSingaporeMathematicalSociety.San Ling chaired the conference and I served as the Program Chair. There were 216 valid submissions. The Program Committee aided by 221 external reviewers spent 83 days on reviews and discussions. They spared no e?ort to increase the quality of their reviews. Every paper received at least three independent reviews, and papers from the committee members received ?ve reviews. In total, there were more than 730 reviews followed by intensive discussion. This long and tough process, wrapped up with an intensive face-- facemeeting by the committeemembers convenedatUCSanta Barbara,yielded 35 accepted papers.I regret not being able to select more of such high-quality papers due to space limitations. The proceedings include the revised versions of the accepted papers. The authors are fully responsible for their contents.