Decisional Diffie–Hellman assumption - PDFSEARCH.IO - Document Search Engine

Decisional Diffie–Hellman assumption
Results: 20

#	Item
1	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 ElGamal encryption Public-key cryptography Ciphertext indistinguishability Diffie–Hellman problem Decisional Diffie–Hellman assumption Optimal asymmetric encryption padding Cramer–Shoup cryptosystem Cryptography Computational hardness assumptions Finite fields
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 Computational hardness assumptions Finite fields Decisional Diffie–Hellman assumption Diffie–Hellman problem Vector space Matrix Kalman filter Principal component analysis Algebra Mathematics Cryptography
3	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 Oblivious transfer Decisional Diffie–Hellman assumption Commitment scheme Secure multi-party computation Communications protocol Zero-knowledge proof Proof of knowledge Cryptography Cryptographic protocols Universal composability
4	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 Cryptographic protocols Finite fields Diffie–Hellman problem Oblivious transfer RSA XTR Decisional Diffie–Hellman assumption Decision Linear assumption Diffie–Hellman key exchange Cryptography Public-key cryptography Computational hardness assumptions
5	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 Mathematics Multilinear algebra Cryptography Finite fields Decision Linear assumption Boneh/Franklin scheme Group theory Bilinear map Decisional Diffie–Hellman assumption Algebra Computational hardness assumptions Abstract algebra
6	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 XDH assumption Decisional Diffie–Hellman assumption Electronic money Public-key cryptography Proof of knowledge XTR Cryptography Cryptographic protocols Diffie–Hellman key exchange
7	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 Mathematics Decisional Diffie–Hellman assumption Cryptography Applied mathematics
8	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 Computational hardness assumptions Finite groups Decisional Diffie–Hellman assumption XDH assumption XTR Cyclic group Subgroup Group action BLS Abstract algebra Group theory Algebra
9	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 Group theory Cryptography Decisional Diffie–Hellman assumption Pairing G1 Subgroup XDH assumption Algebra Computational hardness assumptions Mathematics
10	Pairing-Based Identification Schemes Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2008-06-06 19:27:43 Public-key cryptography Finite fields BLS Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Zero-knowledge proof Digital signature Cryptography Computational hardness assumptions Cryptographic protocols

UPDATE