z-logo
open-access-imgOpen Access
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions
Author(s) -
Benôıt Libert,
Somindu C. Ramanna,
Moti Yung
Publication year - 2016
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - computer science , theoretical computer science , functional encryption , commitment scheme , mathematical proof , function (biology) , cryptography , polynomial , generalization , encryption , cryptographic primitive , simple (philosophy) , mathematics , computer security , cryptographic protocol , mathematical analysis , philosophy , epistemology , geometry , ciphertext , evolutionary biology , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here