Result 1 to 20 of 294 total
Efficient modular exponentiation-based puzzles for denial-of-service protection. (English)
Kim, Howon (ed.), Information security and cryptology ‒ ICISC 2011. 14th international conference, Seoul, Korea, November 30‒December 2, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31911-2/pbk). Lecture Notes in Computer Science 7259, 319-331 (2012).
1
Minimizing information leakage of tree-based RFID authentication protocols using alternate tree-walking. (English)
Susilo, Willy (ed.) et al., Information security and privacy. 17th Australasian conference, ACISP 2012, Wollongong, NSW, Australia, July 9‒11, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31447-6/pbk). Lecture Notes in Computer Science 7372, 434-441 (2012).
2
Effort-release public-key encryption from cryptographic puzzles. (English)
Susilo, Willy (ed.) et al., Information security and privacy. 17th Australasian conference, ACISP 2012, Wollongong, NSW, Australia, July 9‒11, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31447-6/pbk). Lecture Notes in Computer Science 7372, 194-207 (2012).
3
Towards a provably secure dos-resilient key exchange protocol with perfect forward secrecy. (English)
Bernstein, Daniel J. (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2011. 12th international conference on cryptology in India, Chennai, India, December 11‒14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25577-9/pbk). Lecture Notes in Computer Science 7107, 379-398 (2011).
4
On forward secrecy in one-round key exchange. (English)
Chen, Liqun (ed.), Cryptography and coding. 13th IMA international conference, IMACC 2011, Oxford, UK, December 12‒15, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25515-1/pbk). Lecture Notes in Computer Science 7089, 451-468 (2011).
5
Tensions in developing a secure collective information practice ‒ the case of agile ridesharing. (English)
Campos, Pedro (ed.) et al., Human-computer interaction ‒ INTERACT 2011. 13th IFIP TC 13 international conference, Lisbon, Portugal, September 5‒9, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-23770-6/pbk). Lecture Notes in Computer Science 6947, 524-532 (2011).
6
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols. (English)
Kiayias, Aggelos (ed.), Topics in cryptology ‒ CT-RSA 2011. The cryptographers’ track at the RSA conference 2011, San Francisco, CA, USA, February 14‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19073-5/pbk). Lecture Notes in Computer Science 6558, 284-301 (2011).
7
Improving student performance in a first-year geography course: examining the importance of computer-assisted formative assessment (English)
Computers & Education 57, No. 2, 1493-1500 (2011).
8
On forward secrecy in one-round key exchange (English)
IMA Int. Conf., 451-468 (2011).
9
Tensions in developing a secure collective information practice - the case of agile ridesharing (English)
INTERACT (2), 524-532 (2011).
10
User-representative feature selection for keystroke dynamics (English)
NSS, 229-233 (2011).
11
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols (English)
CT-RSA, 284-301 (2011).
12
Automated proofs for diffie-hellman-based key exchanges (English)
CSF, 51-65 (2011).
13
Towards a provably secure dos-resilient key exchange protocol with perfect forward secrecy (English)
INDOCRYPT, 379-398 (2011).
14
Attribute-based authenticated key exchange. (English)
Steinfeld, Ron (ed.) et al., Information security and privacy. 15th Australasian conference, ACISP 2010, Sydney, Australia, July 5‒7, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14080-8/pbk). Lecture Notes in Computer Science 6168, 300-317 (2010).
15
Automating computational proofs for public-key-based key exchange. (English)
Heng, Swee-Huay (ed.) et al., Provable security. 4th international conference, ProvSec 2010, Malacca, Malaysia, October 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16279-4/pbk). Lecture Notes in Computer Science 6402, 53-69 (2010).
16
Delaying mismatched field multiplications in pairing computations. (English)
Hasan, M. Anwar (ed.) et al., Arithmetic of finite fields. Third international workshop, WAIFI 2010, Istanbul, Turkey, June 27‒30, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13796-9/pbk). Lecture Notes in Computer Science 6087, 196-214 (2010).
17
Efficient certificateless KEM in the standard model. (English)
Lee, Donghoon (ed.) et al., Information, security and cryptology ‒ ICISC 2009. 12th international conference, Seoul, Korea, December 2‒4, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-14422-6/pbk). Lecture Notes in Computer Science 5984, 34-46 (2010).
18
Generic one round group key exchange in the standard model. (English)
Lee, Donghoon (ed.) et al., Information, security and cryptology ‒ ICISC 2009. 12th international conference, Seoul, Korea, December 2‒4, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-14422-6/pbk). Lecture Notes in Computer Science 5984, 1-15 (2010).
19
Avoiding full extension field arithmetic in pairing computations. (English)
Bernstein, Daniel J. (ed.) et al., Progress in cryptology ‒ AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3‒6, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12677-2/pbk). Lecture Notes in Computer Science 6055, 203-224 (2010).
20
Result 1 to 20 of 294 total
Start
Contact
Print
General Help
