Decisional Diffie–Hellman assumption

Results: 20



#Item
1Formal 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

Add to Reading List

Source URL: certicrypt.gforge.inria.fr

Language: English - Date: 2013-06-17 13:32:36
2Matrix 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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-04-20 07:04:42
3Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel.

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2008-12-21 16:22:00
4Practical 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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2011-01-14 14:00:36
5The 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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-06 19:27:51
6XDH assumption / Decisional Diffie–Hellman assumption / Electronic money / Public-key cryptography / Proof of knowledge / XTR / Cryptography / Cryptographic protocols / Diffie–Hellman key exchange

Practical Anonymous Divisible E-Cash From Bounded Accumulators? Man Ho Au, Willy Susilo, and Yi Mu Centre for Computer and Information Security Research School of Computer Science and Software Engineering University of W

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2007-12-09 02:25:32
7Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade∗ DAN B ONEH† H ART M ONTGOMERY‡

Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade∗ DAN B ONEH† H ART M ONTGOMERY‡

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2010-08-13 19:58:29
8Converting 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]

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2010-07-03 01:40:38
9Converting 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

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2010-07-03 02:36:48
10Pairing-Based Identification Schemes

Pairing-Based Identification Schemes

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2008-06-06 19:27:43