Ahto Truu
where else to find them
what they talk about
all 6 in the filters
where they keep going back
- ACCU5 editions2017–2023
on a stage with
never shared a talk
who talks about the same things
- Andrei Alexandrescu27 talks
- James McNellis17 talks
- Arthur O'Dwyer21 talks
- Björn Fahller31 talks
- Ivica Bogosavljevic6 talks
- Fedor G Pikus7 talks
| title | conference | date |
|---|---|---|
| Introduction to Secure Multi-Party Computation | ACCU 2023 | 2023-04-19 |
Overview of practical secure multi‑party computation: three families exist — homomorphic encryption (Gentry’s 2009 fully homomorphic breakthrough initially… | ||
| Measuring the Overhead of iostreams: What Is the Difference? | ACCU 2022 | 2022-04-06 |
A simple harness generates 1–2 million lines (10–40 million integers) and runs gcc 9.2 -O2 binaries on Ubuntu to compare C stdio vs C++ iostreams with… | ||
| Introduction to Verifiable Computing | ACCU 2022 | 2022-04-06 |
Shows how verifiable computing turns C functions into quadratic arithmetic programs and uses commitments, bilinear pairings and discrete‑log hardness to… | ||
| Programming as a Sport -- What Do You Mean? | ACCU 2021 Online | 2021-03-10 |
Overview of competitive programming: contests give word problems whose solutions are implemented as programs judged by correctness via black-box test cases and… | ||
| How to Build Digital Signatures From Hash Functions | ACCU 2021 Online | 2021-03-10 |
Recap of hash‑based construction shows Lamport one‑time signatures plus Merkle tree aggregation turn impractical one‑time keys into reusable public keys… | ||
| Verified Security of BLT Signature Scheme | CPP 2020 | 2020-01-20 |
Formalizes and mechanically verifies that a BLT-style signature scheme becomes existentially unforgeable when a forward‑resistant tagging primitive combines… | ||
| What are hash trees? and why you should care | ACCU 2019 | 2019-04-10 |
Explains binary Merkle (hash) trees where each parent hash is computed from child hashes using a one-way hash, allowing a server to return both a query result… | ||
| Efficient data aggregation with Fenwick trees | ACCU 2017 | 2017-04-24 |
Fenwick tree stores cumulative blocks inside the original array so it gives no extra memory while supporting O(log n) updates and queries; building the… | ||
| nothing matches | ||