Alessandra Scafuro

According to our database1, Alessandra Scafuro authored at least 29 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Publicly Verifiable Proofs from Blockchains.
IACR Cryptology ePrint Archive, 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.
CoRR, 2018

2017
Sublinear Zero-Knowledge Arguments for RAM Programs.
IACR Cryptology ePrint Archive, 2017

Adaptively Indistinguishable Garbled Circuits.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2016

Online/Offline OR Composition of Sigma Protocols.
IACR Cryptology ePrint Archive, 2016

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

Secure Computation in Online Social Networks.
IACR Cryptology ePrint Archive, 2016

2015
Round-Optimal Black-Box Two-Party Computation.
IACR Cryptology ePrint Archive, 2015

Adaptively Secure Garbled Circuits from One-Way Functions.
IACR Cryptology ePrint Archive, 2015

Improved OR Composition of Sigma-Protocols.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2014

Black-Box Non-Black-Box Zero Knowledge.
IACR Cryptology ePrint Archive, 2014

Garbled RAM From One-Way Functions.
IACR Cryptology ePrint Archive, 2014

Practical UC security with a Global Random Oracle.
IACR Cryptology ePrint Archive, 2014

2013
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions.
IACR Cryptology ePrint Archive, 2013

Secure Computation Under Network and Physical Attacks.
Bulletin of the EATCS, 2013

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

2010
Impossibility Results for RFID Privacy Notions.
Trans. Computational Science, 2010

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

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


  Loading...