Pairings in Cryptography

Поделиться
HTML-код
  • Опубликовано: 13 июл 2015
  • Dan Boneh, Stanford University
    Historical Papers in Cryptography Seminar Series
    simons.berkeley.edu/crypto2015...

Комментарии • 16

  • @beback_
    @beback_ 7 лет назад +38

    Boneh starts at 4:15

  • @jonabirdd
    @jonabirdd 4 года назад +12

    Boneh is an incredible speaker, and he gives very complete answers without having to think much

  • @qianyingliao1675
    @qianyingliao1675 3 года назад +3

    The "prison" part is so hilarious and so true!

  • @xinyuzhang4204
    @xinyuzhang4204 2 года назад +1

    I love reading Boneh's paper!! So intuitive and so well-written!!!

  • @massimomattia16
    @massimomattia16 6 лет назад

    Nice property about signs, is there any implementation of one signs aggregator and verifier ?

  • @j3r3miasmg
    @j3r3miasmg 5 лет назад +1

    36:01 is very motivational.

  • @itswazowski
    @itswazowski 10 месяцев назад +1

    boneh is a legend

  • @gruntperez4753
    @gruntperez4753 5 лет назад +1

    Great 😁

  • @SametTonyal
    @SametTonyal 7 лет назад +1

    Hastasiyiz dede! :)

  • @portport
    @portport Год назад +3

    gm

  • @kylepena8908
    @kylepena8908 5 месяцев назад

    There is always that one guy who tries to debate the speaker

  • @asmitadhungana3790
    @asmitadhungana3790 2 года назад

    And this was the "less-sophisticated" version ! 😳

  • @TheMikkelet
    @TheMikkelet 2 года назад

    wtf was that awkwardly long introduction