Showing cs.CRShow all
2 papers · 1 filter
cs.CR2026
Simple Extremely Lossy Functions from Small-Exponent Hashing
Damiano Abram, Agni Datta, Archisman Dutta +1
Extremely Lossy Functions (ELFs) are a standard model primitive that captures many useful properties of random oracles (Zhandry, Crypto 2016). While there are many variations of EL…
cs.CR2025
Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
Damiano Abram, Giulio Malavolta, Lawrence Roy
We propose the notion of succinct oblivious tensor evaluation (OTE), where two parties compute an additive secret sharing of a tensor product of two vectors $\mathbf{x} \otimes \ma…