-
-
[推荐]Indocrypt 2011, 11–14 December 2011, Chennai
-
发表于: 2011-5-29 09:00 13201
-
Call for papers
Original papers on all technical aspects of cryptology are solicited for submission to Indocrypt 2011.
The conference seeks original contributions in cryptology. We welcome submissions about new cryptographic primitive proposals, cryptanalysis, security models, hardware and software implementation aspects, cryptographic protocols, and applications. We also consider submissions about cryptographic aspects of network security, complexity theory, information theory, coding theory, number theory, and quantum computing.
Instructions for authors of papers
Submissions must not substantially duplicate work that any of the authors has published elsewhere or has submitted in parallel to any journal or any other conference or workshop with formally published proceedings. Information about submissions may be shared with program chairs of other conferences for the purpose of detecting duplication. Accepted submissions must not appear in any journal or in any other conference or workshop with proceedings.
Submissions must be anonymous, with no author names, affiliations, acknowledgments, or obvious references. Each submission must begin with a title, a short abstract, a list of key words, and an introduction that summarizes the contributions of the paper at a level appropriate for a non-specialist reader. Submissions not meeting these requirements risk rejection without consideration of their merits.
The final versions of accepted papers will have to follow the LNCS guidelines (http://www.springeronline.com/lncs) using Springer's standard fonts, font sizes, and margins with a total page limit of 20 pages including references and appendices. It is mandatory to submit in the same format. Up to 12 pages of additional supporting information may be provided, but committee members will read this information at their discretion, so the paper should be intelligible and self-contained within the 20 page LNCS limit.
Papers must be submitted electronically. A detailed description of the electronic submission procedure will be available at http://2011.indocrypt.org/submission.html in July 2011. Submissions must conform to this procedure. Late submissions and non-electronic submissions will not be considered. No new submissions will be accepted after 31 July 2011, but it is still possible to modify the submissions until 7 August 2011. Duplication will be checked starting on 7 August 2011. Authors of accepted papers must guarantee that their paper will be presented at the conference.
As usual, we are asking Springer-Verlag to publish accepted papers in a Lecture Notes in Computer Science volume to be available to participants at the conference. Instructions about the preparation of a final proceedings version will be sent to the authors of accepted papers.
Program committee
Roberto Avanzi, Ruhr University Bochum, Germany
Paulo S. L. M. Barreto, University of São Paulo, Brazil
Rana Barua, Indian Statistical Institute, India
Lejla Batina, Radboud University Nijmegen, The Netherlands, and KU Leuven, Belgium
Daniel J. Bernstein (co-chair), University of Illinois at Chicago, USA
Sanjay Burman, Centre for Artificial Intelligence and Robotics, India
Debrup Chakraborty, CINVESTAV-IPN, Mexico
Sanjit Chatterjee (co-chair), Indian Institute of Science, India
Chen-Mou Cheng, National Taiwan University, Taiwan
Ashish Choudhury, Indian Statistical Institute, India
Sherman S. M. Chow, University of Waterloo, Canada
Christophe De Cannière, Google, Switzerland
Yvo Desmedt, University College London, UK
Christophe Doche, Macquarie University, Australia
Matthieu Finiasz, ENSTA, France
Praveen Gauravaram, Technical University of Denmark, Denmark
Vipul Goyal, Microsoft Research, India
Tim Güneysu, Ruhr University Bochum, Germany
Shay Gueron, University of Haifa, Israel, and Intel Corporation, Israel
Kishan Chand Gupta, Indian Statistical Institute, India
Helena Handschuh, Intrinsic-ID, USA, and KU Leuven, Belgium
Thomas Johansson, Lund University, Sweden
Antoine Joux, DGA and Université de Versailles Saint-Quentin-en-Yvelines, France
Koray Karabina, Certicom Research - Research in Motion, Canada
Tanja Lange, Technische Universiteit Eindhoven, The Netherlands
Vadim Lyubashevsky, ENS, France
Subhamoy Maitra, Indian Statistical Institute, India
Keith Martin, Royal Holloway, University of London, UK
David McGrew, Cisco, USA
Payman Mohassel, University of Calgary, Canada
Michele Mosca, University of Waterloo, Canada
Debdeep Mukhopadhyay, Indian Institute of Technology Kharagpur, India
Michael Naehrig, Technische Universiteit Eindhoven, The Netherlands
Mridul Nandi, Indian Statistical Institute, India
Roger Oyono, Université de la Polynesie Française, French Polynesia
Daniel Page, University of Bristol, UK
Kenny Paterson, Royal Holloway, University of London, UK
Josef Pieprzyk, Macquarie University, Australia
Manoj Prabhakaran, University of Illinois at Urbana-Champaign, USA
Bart Preneel, Katholieke Universiteit Leuven, Belgium
Christian Rechberger, ENS Paris, France
Vincent Rijmen, KU Leuven, Belgium, and TU Graz, Austria
Kouichi Sakurai, Kyushu University, Japan
Palash Sarkar, Indian Statistical Institute, India
P. K. Saxena, DRDO, India
Peter Schwabe, National Taiwan University, Taiwan
Mike Scott, Dublin City University, Ireland
Nicolas Sendrier, INRIA, France
Francesco Sica
Martijn Stam, University of Bristol, UK
François-Xavier Standaert, Universite Catholique de Louvain, Belgium
Damien Stehlé, CNRS and ENS de Lyon, France
Christine Swart, University of Cape Town, South Africa
Michael Szydlo, Akamai, USA
Berkant Ustaoglu, Sabanci University, Turkey
C. E. Veni Madhavan, Indian Institute of Science, India
Huaxiong Wang, Nanyang Technological University, Singapore
Michael J. Wiener, Irdeto, Canada
Bo-Yin Yang, Academia Sinica, Taiwan
Version
This is version 2011.05.11 of the call.html web page.
Source from http://2011.indocrypt.org/call.html
Original papers on all technical aspects of cryptology are solicited for submission to Indocrypt 2011.
The conference seeks original contributions in cryptology. We welcome submissions about new cryptographic primitive proposals, cryptanalysis, security models, hardware and software implementation aspects, cryptographic protocols, and applications. We also consider submissions about cryptographic aspects of network security, complexity theory, information theory, coding theory, number theory, and quantum computing.
Instructions for authors of papers
Submissions must not substantially duplicate work that any of the authors has published elsewhere or has submitted in parallel to any journal or any other conference or workshop with formally published proceedings. Information about submissions may be shared with program chairs of other conferences for the purpose of detecting duplication. Accepted submissions must not appear in any journal or in any other conference or workshop with proceedings.
Submissions must be anonymous, with no author names, affiliations, acknowledgments, or obvious references. Each submission must begin with a title, a short abstract, a list of key words, and an introduction that summarizes the contributions of the paper at a level appropriate for a non-specialist reader. Submissions not meeting these requirements risk rejection without consideration of their merits.
The final versions of accepted papers will have to follow the LNCS guidelines (http://www.springeronline.com/lncs) using Springer's standard fonts, font sizes, and margins with a total page limit of 20 pages including references and appendices. It is mandatory to submit in the same format. Up to 12 pages of additional supporting information may be provided, but committee members will read this information at their discretion, so the paper should be intelligible and self-contained within the 20 page LNCS limit.
Papers must be submitted electronically. A detailed description of the electronic submission procedure will be available at http://2011.indocrypt.org/submission.html in July 2011. Submissions must conform to this procedure. Late submissions and non-electronic submissions will not be considered. No new submissions will be accepted after 31 July 2011, but it is still possible to modify the submissions until 7 August 2011. Duplication will be checked starting on 7 August 2011. Authors of accepted papers must guarantee that their paper will be presented at the conference.
As usual, we are asking Springer-Verlag to publish accepted papers in a Lecture Notes in Computer Science volume to be available to participants at the conference. Instructions about the preparation of a final proceedings version will be sent to the authors of accepted papers.
Program committee
Roberto Avanzi, Ruhr University Bochum, Germany
Paulo S. L. M. Barreto, University of São Paulo, Brazil
Rana Barua, Indian Statistical Institute, India
Lejla Batina, Radboud University Nijmegen, The Netherlands, and KU Leuven, Belgium
Daniel J. Bernstein (co-chair), University of Illinois at Chicago, USA
Sanjay Burman, Centre for Artificial Intelligence and Robotics, India
Debrup Chakraborty, CINVESTAV-IPN, Mexico
Sanjit Chatterjee (co-chair), Indian Institute of Science, India
Chen-Mou Cheng, National Taiwan University, Taiwan
Ashish Choudhury, Indian Statistical Institute, India
Sherman S. M. Chow, University of Waterloo, Canada
Christophe De Cannière, Google, Switzerland
Yvo Desmedt, University College London, UK
Christophe Doche, Macquarie University, Australia
Matthieu Finiasz, ENSTA, France
Praveen Gauravaram, Technical University of Denmark, Denmark
Vipul Goyal, Microsoft Research, India
Tim Güneysu, Ruhr University Bochum, Germany
Shay Gueron, University of Haifa, Israel, and Intel Corporation, Israel
Kishan Chand Gupta, Indian Statistical Institute, India
Helena Handschuh, Intrinsic-ID, USA, and KU Leuven, Belgium
Thomas Johansson, Lund University, Sweden
Antoine Joux, DGA and Université de Versailles Saint-Quentin-en-Yvelines, France
Koray Karabina, Certicom Research - Research in Motion, Canada
Tanja Lange, Technische Universiteit Eindhoven, The Netherlands
Vadim Lyubashevsky, ENS, France
Subhamoy Maitra, Indian Statistical Institute, India
Keith Martin, Royal Holloway, University of London, UK
David McGrew, Cisco, USA
Payman Mohassel, University of Calgary, Canada
Michele Mosca, University of Waterloo, Canada
Debdeep Mukhopadhyay, Indian Institute of Technology Kharagpur, India
Michael Naehrig, Technische Universiteit Eindhoven, The Netherlands
Mridul Nandi, Indian Statistical Institute, India
Roger Oyono, Université de la Polynesie Française, French Polynesia
Daniel Page, University of Bristol, UK
Kenny Paterson, Royal Holloway, University of London, UK
Josef Pieprzyk, Macquarie University, Australia
Manoj Prabhakaran, University of Illinois at Urbana-Champaign, USA
Bart Preneel, Katholieke Universiteit Leuven, Belgium
Christian Rechberger, ENS Paris, France
Vincent Rijmen, KU Leuven, Belgium, and TU Graz, Austria
Kouichi Sakurai, Kyushu University, Japan
Palash Sarkar, Indian Statistical Institute, India
P. K. Saxena, DRDO, India
Peter Schwabe, National Taiwan University, Taiwan
Mike Scott, Dublin City University, Ireland
Nicolas Sendrier, INRIA, France
Francesco Sica
Martijn Stam, University of Bristol, UK
François-Xavier Standaert, Universite Catholique de Louvain, Belgium
Damien Stehlé, CNRS and ENS de Lyon, France
Christine Swart, University of Cape Town, South Africa
Michael Szydlo, Akamai, USA
Berkant Ustaoglu, Sabanci University, Turkey
C. E. Veni Madhavan, Indian Institute of Science, India
Huaxiong Wang, Nanyang Technological University, Singapore
Michael J. Wiener, Irdeto, Canada
Bo-Yin Yang, Academia Sinica, Taiwan
Version
This is version 2011.05.11 of the call.html web page.
Source from http://2011.indocrypt.org/call.html
[招生]科锐逆向工程师培训(2024年11月15日实地,远程教学同时开班, 第51期)
赞赏
他的文章
- [转帖][Cado-nfs-discuss] 795-bit factoring and discrete logarithms (RSA-240 于2019年12月2日被破解) 19498
- [转帖]How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits 8162
- [推荐]RSA-220 has 220 decimal digits (729 bits), and was factored 6895
- [推荐]RSA-210 has been factored. 11179
- Lessons Learned From Previous SSL/TLS Attacks - A Brief Chronology Of Attacks... 8923
看原图
赞赏
雪币:
留言: