Alessandra Scafuro

Black-Box Anonymous Commit-and-Prove

SECURITY AND CRYPTOGRAPHY FOR NETWORKS (SCN 2022), Vol. 13409, pp. 591–614.

Mutual Accountability Layer: Accountable Anonymity Within Accountable Trust

CYBER SECURITY, CRYPTOLOGY, AND MACHINE LEARNING, Vol. 13301, pp. 318–336.

One-Time Traceable Ring Signatures

COMPUTER SECURITY - ESORICS 2021, PT II, Vol. 12973, pp. 481–500.

Anonymous Lottery In The Proof-of-Stake Setting

2020 IEEE 33RD COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2020), pp. 318–333.

Population Stability: Regulating Size in the Presence of an Adversary

PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, pp. 397–406.

Adaptively Indistinguishable Garbled Circuits

In Theory of Cryptography (pp. 40–71).

Server-Aided Secure Computation with Off-line Parties

In Computer Security – ESORICS 2017 (pp. 103–123).

Sublinear Zero-Knowledge Arguments for RAM Programs

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT I, Vol. 10210, pp. 501–531.

Adaptively Secure Garbled Circuits from One-Way Functions

In Advances in Cryptology – CRYPTO 2016 (pp. 149–178).

Improved OR-Composition of Sigma-Protocols

In Lecture Notes in Computer Science: Vol. 9563. Theory of Cryptography. TCC 2016 (pp. 112–141).

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion

In Advances in Cryptology – ASIACRYPT 2016 (pp. 777–804).

Online/Offline OR Composition of Sigma Protocols

In Advances in Cryptology – EUROCRYPT 2016 (pp. 63–92).

Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way

In Theory of Cryptography (pp. 345–374).

Round-Optimal Black-Box Two-Party Computation

In Lecture Notes in Computer Science (pp. 339–358).

Revisiting Lower and Upper Bounds for Selective Decommitments

In Theory of Cryptography (pp. 559–578).

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

In Advances in Cryptology - ASIACRYPT 2013 (pp. 100–119).

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

In Advances in Cryptology – EUROCRYPT 2013 (pp. 702–718).

On Round-Optimal Zero Knowledge in the Bare Public-Key Model

In Advances in Cryptology – EUROCRYPT 2012 (pp. 153–171).

Simultaneously Resettable Arguments of Knowledge

In Theory of Cryptography (pp. 530–547).

Impossibility Results for RFID Privacy Notions

In Transactions on Computational Science XI (pp. 39–63).

Revisiting DoS Attacks and Privacy in RFID-Enabled Networks

In Algorithmic Aspects of Wireless Sensor Networks (pp. 76–87).