On Sufficient Oracles for Secure Computation with Identifiable Abort

Autor: Mark Simkin, Luisa Siniscalchi, Sophia Yakoubov

Publikováno v: Lecture Notes in Computer Science ISBN: 9783031147906

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::217037f95a5c1c8ad6d83292b0dc3900
https://doi.org/10.1007/978-3-031-14791-3_22

The State of the Union: Union-Only Signatures for Data Aggregation

Autor: Diego F. Aranha, Felix Engelmann, Sebastian Kolby, Sophia Yakoubov

Publikováno v: Lecture Notes in Computer Science ISBN: 9783031147906

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3dfa067af15f2779223dbf80faf3239b
https://doi.org/10.1007/978-3-031-14791-3_17

Random-Index PIR and Applications

Autor: Craig Gentry, Jesper Buus Nielsen, Shai Halevi, Sophia Yakoubov, Bernardo Magri

Publikováno v: Gentry, C, Halevi, S, Magri, B, Nielsen, J B & Yakoubov, S 2021, Random-Index PIR and Applications . in K Nissim & B Waters (eds), Theory of Cryptography-19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part III . vol. 13044, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13044 LNCS, Springer Berlin, pp. 32-61 . https://doi.org/10.1007/978-3-030-90456-2_2
Theory of Cryptography ISBN: 9783030904555
TCC (3)

Private information retrieval (PIR) lets a client retrieve an entry from a database without the server learning which entry was retrieved. Here we study a weaker variant that we call random-index PIR (RPIR), where the retrieved index is an output rat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c38c200613ed8d8689315d5f3b1d286a
https://eprint.iacr.org/2020/1248.pdf

Turning HATE into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC

Autor: Leonid Reyzin, Sophia Yakoubov, Adam Smith

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030780852
CSCML

In a public-key threshold encryption scheme, the sender produces a single ciphertext, and any \(t+1\) out of \(n\) intended recipients can combine their partial decryptions to obtain the plaintext. Ad hoc threshold encryption (ATE) schemes require no

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::43a691d81e08c73b6ce09f3c9e257d04
https://doi.org/10.1007/978-3-030-78086-9_27

YOSO: You Only Speak Once

Autor: Craig Gentry, Tal Rabin, Hugo Krawczyk, Sophia Yakoubov, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen

Publikováno v: Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842444
CRYPTO (2)

The inherent difficulty of maintaining stateful environments over long periods of time gave rise to the paradigm of serverless computing, where mostly stateless components are deployed on demand to handle computation tasks, and are torn down once the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4c430f2ed4f67de48fb90e8811248ba3
https://doi.org/10.1007/978-3-030-84245-1_3