Back to Results
First PageMeta Content
Computational complexity theory / Linear algebra / Matrix theory / Matrix / Circuit complexity / Boolean circuit / Circuit / Invertible matrix / Arithmetic circuit complexity / Algebra / Theoretical computer science / Mathematics


Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko
Add to Reading List

Document Date: 2012-01-21 00:18:10


Open Document

File Size: 364,11 KB

Share Result on Facebook

Facility

square Pmand / /

IndustryTerm

given cryptographic protocol / computing / circuit computing / agreement protocol / function computing / public-key cryptographic protocol / secure secret key protocols / /

Organization

Russian Fund for Basic Research / /

Person

Bob / Alain Hiltgen / Alice / Sergey I. Nikolenko / Edward A. Hirsch Olga Melanich Sergey / /

/

Position

correspondent / model at present / /

ProgrammingLanguage

CΩ / /

Technology

secure secret key protocols / cryptography / secret key / public-key cryptographic protocol / Hellman key agreement protocol / given cryptographic protocol / /

SocialTag