Alessandra Scafuro

Baldimtsi, F., Madathil, V., Scafuro, A., & Zhou, L. (2020). Anonymous Lottery In The Proof-of-Stake Setting. 2020 IEEE 33RD COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2020), pp. 318–333. https://doi.org/10.1109/CSF49147.2020.00030

Goldwasser, S., Ostrovsky, R., Scafuro, A., & Sealfon, A. (2018). Population Stability: Regulating Size in the Presence of an Adversary. PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 397–406. https://doi.org/10.1145/3212734.3212747

Jafargholi, Z., Scafuro, A., & Wichs, D. (2017). Adaptively Indistinguishable Garbled Circuits. In Theory of Cryptography (pp. 40–71). https://doi.org/10.1007/978-3-319-70503-3_2

Baldimtsi, F., Papadopoulos, D., Papadopoulos, S., Scafuro, A., & Triandopoulos, N. (2017). Server-Aided Secure Computation with Off-line Parties. In Computer Security – ESORICS 2017 (pp. 103–123). https://doi.org/10.1007/978-3-319-66402-6_8

Mohassel, P., Rosulek, M., & Scafuro, A. (2017). Sublinear zero-knowledge arguments for RAM programs. Advances in cryptology - eurocrypt 2017, pt i, 10210, 501–531. https://doi.org/10.1007/978-3-319-56620-7_18

Hemenway, B., Jafargholi, Z., Ostrovsky, R., Scafuro, A., & Wichs, D. (2016). Adaptively Secure Garbled Circuits from One-Way Functions. In Advances in Cryptology – CRYPTO 2016 (pp. 149–178). https://doi.org/10.1007/978-3-662-53015-3_6

Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., & Visconti, I. (2016). Improved OR-Composition of Sigma-Protocols. In Lecture Notes in Computer Science: Vol. 9563. Theory of Cryptography. TCC 2016 (pp. 112–141). https://doi.org/10.1007/978-3-662-49099-0_5

Bellare, M., Fuchsbauer, G., & Scafuro, A. (2016). NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion. In Advances in Cryptology – ASIACRYPT 2016 (pp. 777–804). https://doi.org/10.1007/978-3-662-53890-6_26

Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., & Visconti, I. (2016). Online/Offline OR Composition of Sigma Protocols. In Advances in Cryptology – EUROCRYPT 2016 (pp. 63–92). https://doi.org/10.1007/978-3-662-49896-5_3

Ostrovsky, R., Scafuro, A., & Venkitasubramanian, M. (2015). Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way. In Theory of Cryptography (pp. 345–374). https://doi.org/10.1007/978-3-662-46494-6_15

Ostrovsky, R., Richelson, S., & Scafuro, A. (2015). Round-Optimal Black-Box Two-Party Computation. In Lecture Notes in Computer Science (pp. 339–358). https://doi.org/10.1007/978-3-662-48000-7_17

Ostrovsky, R., Rao, V., Scafuro, A., & Visconti, I. (2013). Revisiting Lower and Upper Bounds for Selective Decommitments. In Theory of Cryptography (pp. 559–578). https://doi.org/10.1007/978-3-642-36594-2_31

Damgård, I., & Scafuro, A. (2013). Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. In Advances in Cryptology - ASIACRYPT 2013 (pp. 100–119). https://doi.org/10.1007/978-3-642-42045-0_6

Ostrovsky, R., Scafuro, A., Visconti, I., & Wadia, A. (2013). Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions. In Advances in Cryptology – EUROCRYPT 2013 (pp. 702–718). https://doi.org/10.1007/978-3-642-38348-9_41

Scafuro, A., & Visconti, I. (2012). On Round-Optimal Zero Knowledge in the Bare Public-Key Model. In Advances in Cryptology – EUROCRYPT 2012 (pp. 153–171). https://doi.org/10.1007/978-3-642-29011-4_11

Cho, C., Ostrovsky, R., Scafuro, A., & Visconti, I. (2012). Simultaneously Resettable Arguments of Knowledge. In Theory of Cryptography (pp. 530–547). https://doi.org/10.1007/978-3-642-28914-9_30

Armknecht, F., Sadeghi, A.-R., Scafuro, A., Visconti, I., & Wachsmann, C. (2010). Impossibility Results for RFID Privacy Notions. In Transactions on Computational Science XI (pp. 39–63). https://doi.org/10.1007/978-3-642-17697-5_3

D’Arco, P., Scafuro, A., & Visconti, I. (2009). Revisiting DoS Attacks and Privacy in RFID-Enabled Networks. In Algorithmic Aspects of Wireless Sensor Networks (pp. 76–87). https://doi.org/10.1007/978-3-642-05434-1_9