Lecture 10.2: Cryptographic Commitments

Поділитися
Вставка
  • Опубліковано 21 жов 2024

КОМЕНТАРІ • 12

  • @GameNationRDF
    @GameNationRDF 2 роки тому +14

    Absolutely terrific explanation. Finally someone explains it they way it should be explained. Thank you very much

  • @moonman239
    @moonman239 Рік тому +1

    So what do you do with the random value? Hash functions tend to like having maybe one value and a salt.

  • @alexicazee
    @alexicazee 5 місяців тому

    just want you to know this video is saving my last software eng final and thereby, my degree. bless u.

  • @anmolagrawal5358
    @anmolagrawal5358 7 місяців тому

    Can this be used for proof-of-authorship and gaining priority?

  • @moonman239
    @moonman239 Рік тому

    Also, if I multiply a commitment string by itself, can I deduce the original m?

  • @alexdith9024
    @alexdith9024 Рік тому

    Thank you so much for this presentation. It explained everything so well, I am so excited that i can understand almost everything!

  • @gauravwagh3038
    @gauravwagh3038 2 роки тому

    Does pedersen commitment support multiplicative homomorphic property? In the video you have explained additive homomorphic properties. Thank you so much

  • @lherfel
    @lherfel 8 місяців тому

    Truly Awesome explanation, much thanks

  • @jobosan4855
    @jobosan4855 2 роки тому

    For the historical record: Only 1 year later and this sharing this information anywhere on earth could land you in federal prison.

  • @zeytelaloi
    @zeytelaloi Рік тому

    Super clear!

  • @redvelvetzip
    @redvelvetzip 2 роки тому

    great lesson, thank you!

  • @SoumyadweepMondal
    @SoumyadweepMondal Рік тому

    Sir you are too fast.