There are zk-SNARKs that is able to prove relations for arithmetic circuit satisfiability. The relation can be expressed as some form, for example, R1CS/QAP form. We are recently studying about the papers for

IntroductionNOTE. This post is a summary of a presentation entitled "Understanding Adversarial Examples" at "C&A Lab 2023-Summer Deep Learning Seminar". The corresponding slide is available at HERE.For secure, trustworthy ML, potential threats against

Update BoardThis post describes a functional upgrade of the blog.The title will contain the date of the last update, and you can check the update by referring to that date.The last updated date

 [C&A Lab 블로그 관련 안내]연구실 블로그는 Google의 Blogger라는 플랫폼을 통해 구현되었습니다.연구실 분들께서는 관리자의 초대 하에 작성자의 권한을 가지실 수 있으며, 필요에 따라 별도의 관리자 권한을 부여받으실 수도 있습니다.블로그 담당자 외의 관리자 권한을 부여받으신