<--- Back to Details
First PageDocument Content
Cryptography / Post-quantum cryptography / Multivariate cryptography / Finite fields / Lattice-based cryptography / Hidden Field Equations / Learning with errors / QUAD / RSA / Reduction / Computational hardness assumption / Ideal lattice cryptography
Date: 2012-04-04 23:26:12
Cryptography
Post-quantum cryptography
Multivariate cryptography
Finite fields
Lattice-based cryptography
Hidden Field Equations
Learning with errors
QUAD
RSA
Reduction
Computational hardness assumption
Ideal lattice cryptography

Public-Key Cryptography from New Multivariate Quadratic Assumptions Yun-Ju Huang1,3 , Feng-Hao Liu2 , and Bo-Yin Yang3 1 3

Add to Reading List

Source URL: precision.moscito.org

Download Document from Source Website

File Size: 261,61 KB

Share Document on Facebook

Similar Documents

Computational hardness assumption / Ciphertext indistinguishability / Computer security / Cyberwarfare / Science / Cryptography / Cryptographic primitive / Information-theoretic security

Proving Computational Security with a General-Purpose C Verifier A 5-Minute Talk Fran¸cois Dupressoir The Open University

DocID: 1ga1k - View Document

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

Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE

DocID: 19hjI - View Document

Computational hardness assumptions / Finite fields / Decisional Diffie–Hellman assumption / Diffie–Hellman problem / Vector space / Matrix / Kalman filter / Principal component analysis / Algebra / Mathematics / Cryptography

Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2

DocID: 18cff - View Document

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

Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University

DocID: 13pBd - View Document

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

The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin

DocID: 12Nkf - View Document