关注
Pierre Meyer
Pierre Meyer
Aarhus Universitet
在 cs.au.dk 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
G Couteau, P Meyer
Annual International Conference on the Theory and Applications of …, 2021
122021
Sublinear secure computation from new assumptions
E Boyle, G Couteau, P Meyer
Theory of Cryptography Conference, 121-150, 2022
82022
Topology-hiding communication from minimal assumptions
M Ball, E Boyle, R Cohen, L Kohl, T Malkin, P Meyer, T Moran
Journal of Cryptology 36 (4), 39, 2023
72023
Sublinear-communication secure multiparty computation does not require FHE
E Boyle, G Couteau, P Meyer
Annual International Conference on the Theory and Applications of …, 2023
52023
Constrained pseudorandom functions from homomorphic secret sharing
G Couteau, P Meyer, A Passelègue, M Riahinia
Annual International Conference on the Theory and Applications of …, 2023
52023
New random oracle instantiations from extremely lossy functions
C Brzuska, G Couteau, C Egger, P Karanko, P Meyer
Cryptology ePrint Archive, 2023
42023
On low-end obfuscation and learning
E Boyle, Y Ishai, P Meyer, R Robere, G Yehuda
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
42023
Towards topology-hiding computation from oblivious transfer
M Ball, A Bienstock, L Kohl, P Meyer
Theory of Cryptography Conference, 349-379, 2023
32023
Fast Public-Key Silent OT and More from Constrained Naor-Reingold
D Bui, G Couteau, P Meyer, A Passelègue, M Riahinia
Annual International Conference on the Theory and Applications of …, 2024
22024
Lightweight FEC: Rectangular Codes with Minimum Feedback Information
BM Bui-Xuan, P Meyer, A Roux
arXiv preprint arXiv:1904.02076, 2019
2019
Link Stream Edition: Sparse Split and Bi-Sparse Split
BMBXC Magniena, P Meyerb, THD Phanc
系统目前无法执行此操作，请稍后再试。
文章 1–11