Alessandra Scafuro

According to our database1, Alessandra Scafuro authored at least 43 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
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
Preserving Buyer-Privacy in Decentralized Supply Chain Marketplaces.
IACR Cryptol. ePrint Arch., 2022

From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-theoretic.
IACR Cryptol. ePrint Arch., 2022

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

2021
One-time Traceable Ring Signatures.
IACR Cryptol. ePrint Arch., 2021

Private Signaling.
IACR Cryptol. ePrint Arch., 2021

On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols.
IACR Cryptol. ePrint Arch., 2021

Anonymous Device Authorization for Cellular Networks.
IACR Cryptol. ePrint Arch., 2021

Mutual Accountability Layer: Accountable Anonymity within Accountable Trust.
IACR Cryptol. ePrint Arch., 2021

2020
Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains.
IACR Cryptol. ePrint Arch., 2020

Threshold Ring Signatures: New Definitions and Post-Quantum Security.
IACR Cryptol. ePrint Arch., 2020

Anonymous Lottery in the Proof-of-Stake Setting.
IACR Cryptol. ePrint Arch., 2020

2019
Publicly Verifiable Proofs from Blockchains.
IACR Cryptol. ePrint Arch., 2019

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042).
Dagstuhl Reports, 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
Sublinear Zero-Knowledge Arguments for RAM Programs.
IACR Cryptol. ePrint Arch., 2017

Adaptively Indistinguishable Garbled Circuits.
IACR Cryptol. ePrint Arch., 2017

TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 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

Online/Offline OR Composition of Sigma Protocols.
IACR Cryptol. ePrint Arch., 2016

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion.
IACR Cryptol. ePrint Arch., 2016

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

2015
Round-Optimal Black-Box Two-Party Computation.
IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Garbled Circuits from One-Way Functions.
IACR Cryptol. ePrint Arch., 2015

Improved OR Composition of Sigma-Protocols.
IACR Cryptol. ePrint Arch., 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

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.
IACR Cryptol. ePrint Arch., 2014

Garbled RAM From One-Way Functions.
IACR Cryptol. ePrint Arch., 2014

Practical UC security with a Global Random Oracle.
IACR Cryptol. ePrint Arch., 2014

2013
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions.
IACR Cryptol. ePrint Arch., 2013

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

2012
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions.
IACR Cryptol. ePrint Arch., 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

2011
Revisiting Lower and Upper Bounds for Selective Decommitments.
IACR Cryptol. ePrint Arch., 2011

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...