


default search action
Pairing-Based Cryptography (Pairing)
Pairing 2013: Beijing, China
- Zhenfu Cao, Fangguo Zhang:
Pairing-Based Cryptography - Pairing 2013 - 6th International Conference, Beijing, China, November 22-24, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8365, Springer 2014, ISBN 978-3-319-04872-7 [contents]
Pairing 2012: Cologne, Germany
- Michel Abdalla
, Tanja Lange:
Pairing-Based Cryptography - Pairing 2012 - 5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7708, Springer 2013, ISBN 978-3-642-36333-7 [contents]
Pairing 2010: Yamanaka Hot Spring, Japan
- Marc Joye, Atsuko Miyaji, Akira Otsuka:
Pairing-Based Cryptography - Pairing 2010 - 4th International Conference, Yamanaka Hot Spring, Japan, December 2010. Proceedings. Lecture Notes in Computer Science 6487, Springer 2010, ISBN 978-3-642-17454-4 [contents]
Pairing 2009: Palo Alto, CA, USA
- Hovav Shacham, Brent Waters:
Pairing-Based Cryptography - Pairing 2009, Third International Conference, Palo Alto, CA, USA, August 12-14, 2009, Proceedings. Lecture Notes in Computer Science 5671, Springer 2009, ISBN 978-3-642-03297-4 [contents]
Pairing 2008: Egham, UK
- Steven D. Galbraith, Kenneth G. Paterson:
Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings. Lecture Notes in Computer Science 5209, Springer 2008, ISBN 978-3-540-85503-3 [contents]
Pairing 2007: Tokyo, Japan
- Tsuyoshi Takagi, Tatsuaki Okamoto, Eiji Okamoto, Takeshi Okamoto:
Pairing-Based Cryptography - Pairing 2007, First International Conference, Tokyo, Japan, July 2-4, 2007, Proceedings. Lecture Notes in Computer Science 4575, Springer 2007, ISBN 978-3-540-73488-8 [contents]

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.