Sabitlenmiş Tweet
anka
17 posts
anka retweetledi
for years, notion focused on building foundations for storing and displaying knowledge.
now, our agent can use these foundations to create beautiful docs for your life’s work, while leveraging all the sources you’d need! so much care has gone into the agent, i’m so proud 💛
Notion@NotionHQ
Introducing Notion Agents. You assign the tasks, your Agents do the work. Available today. Giddy up! 🤠
English
anka retweetledi
what i’ve been working on for the past year 🥹! excited for users to finally try it
Ivan Zhao@ivanhzhao
So for 5 years, “offline” has been the #1 request. Today, thanks to the perseverance of our engineering team, @NotionHQ finally works offline. Your ideas don’t need Wi‑Fi to exist! For Notion community: thank you for your patience while we built this right. This is a journey, I want to share what we had to invent to make this real... 1/n
English
@kaijuneer yes great question! in the case of a malicious verifier, the deniability of the TADA proof is similar to that of the DV proof (the verifier could've made an accepting proof, since they already know the commitment opening)
English
@top0xtopo great writeup! if a malicious verifier reveals that the proof has been generated by the prover before time t (e.g. immediately reveal the proof once received from prover), does that lose the deniability property?
English
such a cool application of timed commitments :)
anka@top0xtopo
(1/🎉) Social structures are built from plausibly deniable interactions, but how do we engineer them into digital systems? Here's TADA: Time-Assured Deniable Authentication! aka my earworm for the past month :) @topo/tada" target="_blank" rel="nofollow noopener">hackmd.io/@topo/tada
English
A while ago I worked on a deniable authentication system (github.com/enricobottazzi…)
A major flaw of that system was that only the designated verifier could generate malicious proofs therefore limiting the plausible deniability “factor” to solely be enforced by the designated verifier
Tada elegantly solves this issue by making a clever use of timed-commitments!!
anka@top0xtopo
(1/🎉) Social structures are built from plausibly deniable interactions, but how do we engineer them into digital systems? Here's TADA: Time-Assured Deniable Authentication! aka my earworm for the past month :) @topo/tada" target="_blank" rel="nofollow noopener">hackmd.io/@topo/tada
English
(6/🎉) Deniable authentication breathes authenticity into secure digital interactions, and TADA could be its mouthpiece. WIP on circuits here: github.com/topanisto/tada and thinking about ideas here: @topo/real-world-tada" target="_blank" rel="nofollow noopener">hackmd.io/@topo/real-wor… !
English
@0xpiapark @backaes so when are we getting the italian variant of this post
English
안녕하세요, 한국어로는 처음 올려보는 글인데, 이번에 동형암호를 기반으로 구별불가능성 난독화, indistinguishability obfuscation 를 성공적으로 구현하고 벤치마크 결과를 공유하게 되었습니다.
한국에서 동형암호 기반 암호학 연구하시는 분들이 많이 있는 것으로 들어서 관심있는 리서처, 엔지니어분들과 연결되어 피드백이나 연구 과정 공유를 통해 서로 많이 배울 수 있었으면 좋겠습니다. 감사합니다!
Machina iO@machina__io
Hello, World: the first signs of practical iO Today, we’re excited to announce that we have successfully implemented Diamond iO and completed its end-to-end workflow Check out the full post here: machina-io.com/posts/hello_wo…
한국어
anka retweetledi
anka retweetledi
my first ever paper is up on the arxiv! here's my work on biases in hierarchical bayesian inference of gravitational-wave data with astrophysical models :)
arxiv.org/abs/2307.03129
English