Suchergebnisse - "Theory of computation Computational complexity and cryptography Cryptographic protocols"

Memory Checking Requires Logarithmic Overhead.

Autoren: Boyle, Elette Komargodski, Ilan Vafa, Neekon

Quelle: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-43, 43p

Schlagwörter: CLIENT/SERVER computing, TRUST, CHECKERS, CHECKS, MEMORY

OptORAMa: Optimal Oblivious RAM.

Autoren: ASHAROV, GILAD KOMARGODSKI, ILAN WEI-KAI LIN et al.

Quelle: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-70, 70p

Schlagwörter: DETERMINISTIC algorithms, CRYPTOCURRENCIES, LEAKS (Disclosure of information), COMPACTING, OPEN-ended questions

Two-round Multiparty Secure Computation from Minimal Assumptions.

Autoren: GARG, SANJAM SRINIVASAN, AKSHAYARAM

Quelle: Journal of the ACM; Sep2022, Vol. 69 Issue 5, p1-30, 30p

Schlagwörter: PLAINS

SPARKs: Succinct Parallelizable Arguments of Knowledge.

Autoren: EPHRAIM, NAOMI FREITAG, CODY KOMARGODSKI, ILAN et al.

Quelle: Journal of the ACM; Sep2022, Vol. 69 Issue 5, p1-88, 88p

Schlagwörter: POLYNOMIAL time algorithms, ARGUMENT, PARALLEL programming

Revocable Quantum Timed-Release Encryption.

Autoren: UNRUH, DOMINIQUE

Quelle: Journal of the ACM; Dec2015, Vol. 62 Issue 6, p49-49:76, 76p

Schlagwörter: QUANTUM computers, DATA encryption, CRYPTOGRAPHY, DATA security, MATHEMATICAL proofs