Alessandra Scafuro

Orcid: 0000-0003-1797-9457

According to our database1, Alessandra Scafuro authored at least 45 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A New Paradigm for Server-Aided MPC.
IACR Commun. Cryptol., 2024

Round-Optimal Compiler for Semi-Honest to Malicious Oblivious Transfer via CIH.
IACR Commun. Cryptol., 2024

Jäger: Automated Telephone Call Traceback.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
How to Recover a Cryptographic Secret From the Cloud.
IACR Cryptol. ePrint Arch., 2023

PriFHEte: Achieving Full-Privacy in Account-based Cryptocurrencies is Possible.
IACR Cryptol. ePrint Arch., 2023

2022
Private Signaling.
Proceedings of the 31st USENIX Security Symposium, 2022

Black-Box Anonymous Commit-and-Prove.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

Preserving Buyer-Privacy in Decentralized Supply Chain Marketplaces.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2022

Mutual Accountability Layer: Accountable Anonymity Within Accountable Trust.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021
Anonymous device authorization for cellular networks.
Proceedings of the WiSec '21: 14th ACM Conference on Security and Privacy in Wireless and Mobile Networks, Abu Dhabi, United Arab Emirates, 28 June, 2021

On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

One-Time Traceable Ring Signatures.
Proceedings of the Computer Security - ESORICS 2021, 2021

2020
Threshold Ring Signatures: New Definitions and Post-quantum Security.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Anonymous Lottery In The Proof-of-Stake Setting.
Proceedings of the 33rd IEEE Computer Security Foundations Symposium, 2020

2019
Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042).
Dagstuhl Reports, 2019

Publicly Verifiable Proofs from Blockchains.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Break-glass Encryption.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

2018
Population Stability: Regulating Size in the Presence of an Adversary.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Adaptively Indistinguishable Garbled Circuits.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

Sublinear Zero-Knowledge Arguments for RAM Programs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Server-Aided Secure Computation with Off-line Parties.
Proceedings of the Computer Security - ESORICS 2017, 2017

2016
TumbleBit: An Untrusted Tumbler for Bitcoin-Compatible Anonymous Payments.
IACR Cryptol. ePrint Arch., 2016

Secure Computation in Online Social Networks.
IACR Cryptol. ePrint Arch., 2016

Improved OR-Composition of Sigma-Protocols.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Online/Offline OR Composition of Sigma Protocols.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Adaptively Secure Garbled Circuits from One-Way Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Garbled RAM From One-Way Functions.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Round-Optimal Black-Box Two-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way.
IACR Cryptol. ePrint Arch., 2014

Black-box non-black-box zero knowledge.
Proceedings of the Symposium on Theory of Computing, 2014

Practical UC security with a Global Random Oracle.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
Secure Computation Under Network and Physical Attacks.
Bull. EATCS, 2013

Revisiting Lower and Upper Bounds for Selective Decommitments.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions.
Proceedings of the Advances in Cryptology, 2013

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Simultaneously Resettable Arguments of Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

On Round-Optimal Zero Knowledge in the Bare Public-Key Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2010
Impossibility Results for RFID Privacy Notions.
Trans. Comput. Sci., 2010

On Efficient Non-Interactive Oblivious Transfer with Tamper-Proof Hardware.
IACR Cryptol. ePrint Arch., 2010

2009
Revisiting DoS Attacks and Privacy in RFID-Enabled Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009


  Loading...