Computational hardness assumption - PDFSEARCH.IO - Document Search Engine

Computational hardness assumption
Results: 20

#	Item
1	Proving Computational Security with a General-Purpose C Verifier A 5-Minute Talk Fran¸cois Dupressoir The Open University Add to Reading List Source URL: csf2012.seas.harvard.edu Language: English - Date: 2012-07-05 18:15:11 Computational hardness assumption Ciphertext indistinguishability Computer security Cyberwarfare Science Cryptography Cryptographic primitive Information-theoretic security
2	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
3	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
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	CS255: Cryptography and Computer Security Winter 2003 Assignment #3 Due: Monday, March 3rd, 2003 at 5pm in CS255 box next to Gates 182. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-02-18 23:13:10 Finite fields Computational hardness assumptions Diffie–Hellman key exchange ElGamal encryption XTR RSA Diffie–Hellman problem Computational Diffie–Hellman assumption Discrete logarithm Cryptography Public-key cryptography Cryptographic protocols
7	CS255: Cryptography and Computer Security Winter 2004 Assignment #3 Due: Monday, March 1st, 2004. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2004-02-22 02:05:11 Finite fields Cryptographic protocols Electronic commerce Diffie–Hellman key exchange XTR ElGamal encryption RSA Computational Diffie–Hellman assumption Discrete logarithm Cryptography Public-key cryptography Computational hardness assumptions
8	CS255: Cryptography and Computer Security Winter 2002 Assignment #3 Due: Friday, March 8th, 2002 at 5pm. Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-03-05 19:45:19 Computational hardness assumptions Electronic commerce Cryptographic protocols RSA Diffie–Hellman key exchange ElGamal encryption XTR Diffie–Hellman problem Computational Diffie–Hellman assumption Cryptography Public-key cryptography Finite fields
9	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
10	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

UPDATE