Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC Phillip Rogaway Dept. of Computer Science, University of California, Davis CAUSA, and Dept. of Computer Science, Chiang Mai

Source URL: www.iacr.org

Tate pairing implementation for hyperelliptic curves y 2 = xp − x + d Iwan Duursma1 and Hyang-Sook Lee2 1 ?

Source URL: www.iacr.org

In How Many Ways Can You Write Rijndael? Elad Barkan and Eli Biham Computer Science Department Technion – Israel Institute of Technology Haifa 32000, Israel Email: {barkan,biham}@cs.technion.ac.il

Source URL: www.iacr.org

Unconditionally Secure Anonymous Encryption and Group Authentication? Goichiro Hanaoka1 , Junji Shikata2 , Yumiko Hanaoka3 , and Hideki Imai1 1 3

Source URL: www.iacr.org

Helios web-based open-audit voting Ben Adida Harvard University IACR Voting System Session 19 August 2008

Source URL: assets.adida.net

• Software engineering
• Computer programming
• Computing
• Adida
• Voting system
• JavaScript

Crypto 2015 Call for Papers Original contributions on all technical aspects of cryptology are solicited for submission to Crypto 2015, the 35th Annual International Cryptology Conference. Submissions are welcome on any c

Source URL: www.iacr.org

The Modular Inversion Hidden Number Problem Dan Boneh1 , Shai Halevi2 , and Nick Howgrave-Graham2 1 Department of Computer Science, Stanford University, CA, USA

Source URL: www.iacr.org

Efficient Group Signatures without Trapdoors? Giuseppe Ateniese and Breno de Medeiros The Johns Hopkins University Department of Computer Science Baltimore, MD 21218, USA ,

Source URL: www.iacr.org

PDF Document

Source URL: www.iacr.org

PDF Document

Source URL: www.iacr.org