Sadegh Riazi

@SadeghRiazi

A daydreamer, optimist, technology enthusiast | PhD Candidate working on privacy-preserving ML | Past: Microsoft Research, Astrophysics, BCI, EE

San Diego, CA
Vrijeme pridruživanja: svibanj 2015.

Tweetovi

Blokirali ste korisnika/cu @SadeghRiazi

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @SadeghRiazi

  1. proslijedio/la je Tweet
    15. sij

    Apple has acquired Seattle-based artificial intelligence company

    Poništi
  2. 10. sij

    Flavio Bergamaschi is giving a talk on how Homomorphic encryption can change Financial Services Sector (based on a case study). Interesting to see real-world adoption of FHE. Paper:

    Poništi
  3. proslijedio/la je Tweet
    26. lis 2018.

    Don't "work harder." Instead: Cut away distractions. Stop doing fake work. Ask for help. Plan. Solicit criticism. Automate what can be automated. Engage your mentors. Exercise. Get more sleep. Whatever you do, don't "work harder." It's pretty much never the answer.

    Poništi
  4. proslijedio/la je Tweet
    2. sij

    For anyone who ever thought, “Why should I care about ? I have nothing to hide.” The big theme is that it’s money out of your wallet through a variety of methods. Insurance is one.

    Poništi
  5. proslijedio/la je Tweet
    11. pro 2019.

    When I applied for jobs back in 2011, a very senior researcher in an interview said my work on Private Set Intersection was not very relevant, would not be deployed large-scale. What meme should I use to share yet another massive in-the-wild deployment?

    Prikaži ovu nit
    Poništi
  6. 16. pro 2019.
    Poništi
  7. proslijedio/la je Tweet
    9. pro 2019.

    Congratulations to 's Melissa Chase and Greg Zaverucha on the public preview of 's Private Group System using an efficient anonymous credential scheme based on their research. Read the full paper here: .

    Poništi
  8. proslijedio/la je Tweet
    8. pro 2019.

    RWC 2020 program is now online. See you in January!

    Poništi
  9. proslijedio/la je Tweet
    20. stu 2019.

    Given n numbers, how efficiently can one find k smallest of them (top-k selection)? Surprisingly, we (with , , Y. Dong, O. Poburinnaya, and ) were able to say something new and interesting about this problem, see the thread. Also plz RT! 🤩 (1/9)

    Prikaži ovu nit
    Poništi
  10. proslijedio/la je Tweet
    6. stu 2019.

    ML and Optimization @ Redmond is hiring researchers and postdocs! If you want to join Ofer Dekel Yin Tat Lee Lin Xiao and several brilliant engineers, apply via below links by 12/31 (soft). Plz RT!🤩

    Prikaži ovu nit
    Poništi
  11. proslijedio/la je Tweet
    26. lis 2019.

    So honored to present our winning FHE solution for track 2 at iDash'19 together with

    Poništi
  12. proslijedio/la je Tweet
    23. lis 2019.

    Today claims "quantum supremacy." says not so fast. My new story on the nuanced meaning of this scientific milestone.

    Poništi
  13. proslijedio/la je Tweet
    14. lis 2019.

    Ilaria from showing us how more keys are better than one in TFHE at our COED day...

    Poništi
  14. proslijedio/la je Tweet
    Poništi
  15. proslijedio/la je Tweet
    10. lis 2019.

    Say you have an unwieldy metric space. Instead of working with it directly, it is useful to approximate it with a simple(r) metric. I'll write about _tree_ approximations, which are prominent in TCS, and recently found their way into ML and applied algorithms. Please RT! 😸(1/10)

    Prikaži ovu nit
    Poništi
  16. 10. lis 2019.

    It is very interesting to see that privacy-preserving ML is getting a lot of attention. CrypTen: A new research tool for secure machine learning with PyTorch

    Poništi
  17. proslijedio/la je Tweet
    27. ruj 2019.

    Interested in working on practical MPC for privacy on the Internet? The is looking for a postdoc and a doctoral researcher (PhD student) for our ERC-funded project “Privacy-preserving Services On The Internet”.

    Poništi
  18. 24. ruj 2019.
    Poništi
  19. 19. ruj 2019.

    Great collaboration with , Tanmoy Chowdhury, Emanuela Marasco, Farinaz Koushanfar, and

    Prikaži ovu nit
    Poništi
  20. 19. ruj 2019.

    Excited that our paper “Multisketches: Practical Secure Sketches Using Off-the-Shelf Biometric Matching Algorithms” is accepted at CCS 2019. Paper shows that how biometrics can be used to retreive strong keys from a database with no information leakage even in case of a breach..

    Prikaži ovu nit
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·