Friday Hacks #262, September 13: On Secret Sharing and AI in Complex Adversarial Games
Posted on by Chua Jun Yu
Date/Time: Friday, September 13 at 7:00pm SGT
Venue: Seminar Room 3, COM1-02-12, NUS
Sign-up Link: Sign-up here
Food 🍕 and Drinks 🧋 will be served!
1) How to share a secret (with your friends)
Have you ever wondered how you could reveal a secret without actually exposing yourself? No? that’s fine, besides who is ever just going to trust a single person? Unless… This short-talk will give a flavour into the world of Threshold-Ring Signing and their possible applications with as little math as possible.
Speaker Profile 🎙️
Advised by Asst. Prof Li Jialin, Michael is a PhD candidate here at NUS; Working on applying cryptography to introduce characteristics not found in traditional Distributed system’s protocols and algorithms.
2) AI in Complex Adversarial Games
You might have come across alpha-beta pruning. But you probably have been disappointed to realise that the most complex game it can solve (in reasonable time) is tic-tac-toe. But, did you know that Stockfish algorithm, the current strongest AI both in Chess and Chinese Chess, is based on alpha-beta pruning? What did the Stockfish community do to make alpha-beta pruning possible? Let’s find out!
Speaker Profile 🎙️
Nguyen is a year 3 Computer Science student. He is passionate about developing classical AI algorithms, especially those for adversarial games. His ultimate-tictactoe engine is currently top 5% worldwide on Codingame.
👋 See you there!