1![Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE](https://www.pdfsearch.io/img/a1fa9ef1402692dbe3dedb830f37ba05.jpg) | Add to Reading ListSource URL: certicrypt.gforge.inria.frLanguage: English - Date: 2013-06-17 13:32:36
|
---|
2![Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2 Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2](https://www.pdfsearch.io/img/2293bc2e7e4704809b2938b972dc0d5d.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-04-20 07:04:42
|
---|
3![Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University](https://www.pdfsearch.io/img/831918f2f5dc03ee9c80a48e43bd89b1.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2011-01-14 14:00:36
|
---|
4![The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin](https://www.pdfsearch.io/img/cf2f1bd39ceeac2d4af974790427c47b.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2012-12-06 19:27:51
|
---|
5![AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION R. BHASKAR, K. CHANDRASEKARAN, S. LOKAM, P.L. MONTGOMERY, R. VENKATESAN, AND Y. YACOBI Abstract. We generalize the Strong Boneh-Boyen (SBB) signature sche AN OBSERVATION ABOUT VARIATIONS OF THE DIFFIE-HELLMAN ASSUMPTION R. BHASKAR, K. CHANDRASEKARAN, S. LOKAM, P.L. MONTGOMERY, R. VENKATESAN, AND Y. YACOBI Abstract. We generalize the Strong Boneh-Boyen (SBB) signature sche](https://www.pdfsearch.io/img/b5af15436b7c118bd3b1f26ad0924966.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2008-12-16 15:26:16
|
---|
6![CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182. CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182.](https://www.pdfsearch.io/img/4c8b9df8295af4ab361699bb257494bf.jpg) | Add to Reading ListSource URL: crypto.stanford.eduLanguage: English - Date: 2003-02-18 23:13:10
|
---|
7![CS255: Cryptography and Computer Security Winter 2004 Assignment #3 Due: Monday, March 1st, 2004. CS255: Cryptography and Computer Security Winter 2004 Assignment #3 Due: Monday, March 1st, 2004.](https://www.pdfsearch.io/img/93046878fd904be5d050156593cec098.jpg) | Add to Reading ListSource URL: crypto.stanford.eduLanguage: English - Date: 2004-02-22 02:05:11
|
---|
8![CS255: Cryptography and Computer Security Winter 2002 Assignment #3 Due: Friday, March 8th, 2002 at 5pm. CS255: Cryptography and Computer Security Winter 2002 Assignment #3 Due: Friday, March 8th, 2002 at 5pm.](https://www.pdfsearch.io/img/07996c3b076357aac6fe0e3d16d65364.jpg) | Add to Reading ListSource URL: crypto.stanford.eduLanguage: English - Date: 2002-03-05 19:45:19
|
---|
9![Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman? Stanford University [removed] Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman? Stanford University [removed]](https://www.pdfsearch.io/img/5fea4736b3ae433837db03957fc68aeb.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2010-07-03 01:40:38
|
---|
10![Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010 Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups David Mandell Freeman Stanford University, USA Eurocrypt 2010](https://www.pdfsearch.io/img/ba788f92a8b8b802490f86cb9f033844.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2010-07-03 02:36:48
|
---|