Mobile Application Developers with , Cellcrypt, London, UK
Cellcrypt is the leading provider of encrypted mobile phone voice calling with a track record in creating innovative products and solutions. The development team in Central London has opportunities for you to share in Cellcrypt’s exciting future.
You will take a key role in the development and continuing roll-out of Cellcrypt\\\'s secure voice mobile device applications, focusing on the BlackBerry platform in its evolution towards the new OS 10. You will perform hands-on mobile software development, within a small and highly focused product delivery team. Our dynamic and challenging work environment means you will also be involved in system-wide aspects of design and development.
Essential Skills and Experience (Key points - see our web site for details):
- 5+ years development experience
- Strong Mobile Application development experience
- Very fluent in C++ and Java, strong OOA/OOD
- Understanding of mobile device security, cryptography, etc.
- Understanding of VoIP (voice over internet protocol) and associated signalling and media technologies
- Experience of full software development lifecycle
- Eligible for, and willing to undertake, UK security clearance vetting if required
Please send your CV and covering letter to jobs (at) cellcrypt.com.
NO AGENCIES PLEASE. Headhunters and recruitment agencies may not submit CVs/ resumes. Cellcrypt does not accept unsolicited headhunter and agency CVs. Cellcrypt will not pay fees to any third-party agency or company that does not have a signed agreement with the Company.
Post-Doc, Department of Electrical Engineering, Linköping University, Linköping, Sweden
The position is within our project ”Secure systems for authentication using mobile units”
The Information Coding group at Institutionen för Systemteknik is active in several areas, such as security of quantum and classical information systems, security and robustness of optical fibre networks, systems biology, computer graphics, and organic electronics. The undergraduate teaching includes courses in information security, image coding, and computer graphics.
2 Research Scientists, Temasek Laboratories, National University of Singapore, Singapore
Temasek Laboratories at National University of Singapore, Singapore is seeking highly motivated professionals interested in conducting research in the area of cryptography.
Applicants are expected to have a PhD degree in Mathematics/Computer Science/Engineering and a strong background and experience in one or two of the following areas: stream ciphers, pseudorandom number generator, public-key cryptography (multivariate, leakage resilient, etc).
Preferred candidates are expected to be proficient in C/C++ language, a team worker and able to conduct independent research. Review of applications will start immediately and continue until positions are filled.
For application information, please visit http://www.temasek-lab.nus.edu.sg/career/career.php.
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles
Abstract We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive from a novel application of a recent signature scheme due to Waters. Signatures in our aggregate signature scheme are sequentially constructed, but knowledge of the order in which messages were signed is not necessary for verification. The aggregate signatures obtained are shorter than Lysyanskaya et al.’s sequential aggregates and can be verified more efficiently than Boneh et al.’s aggregates. We also consider applications to secure routing and proxy signatures.
- Content Type Journal Article
- Pages 1-34
- DOI 10.1007/s00145-012-9126-5
- Steve Lu, Los Angeles, CA, USA
- Rafail Ostrovsky, Los Angeles, CA, USA
- Amit Sahai, Los Angeles, CA, USA
- Hovav Shacham, La Jolla, CA, USA
- Brent Waters, Austin, TX, USA
From: Fri, 22 Jun 2012 14:01:59 GMT
- Journal Journal of Cryptology
- Online ISSN 1432-1378
- Print ISSN 0933-2790