| Efficient Proofs of Knowledge for Threshold Relations. | 0 | 0.34 | 2022 |
| Digital Contact Tracing Solutions: Promises, Pitfalls and Challenges. | 0 | 0.34 | 2022 |
| Shielded Computations in Smart Contracts Overcoming Forks | 0 | 0.34 | 2021 |
| Black-Box Constructions of Bounded-Concurrent Secure Computation. | 0 | 0.34 | 2020 |
| Publicly Verifiable Proofs from Blockchains. | 0 | 0.34 | 2019 |
| Non-interactive Zero Knowledge Proofs in the Random Oracle Model. | 0 | 0.34 | 2019 |
| Non-interactive Secure Computation from One-Way Functions. | 0 | 0.34 | 2018 |
| Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. | 2 | 0.35 | 2018 |
| Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. | 3 | 0.39 | 2017 |
| Resettably-Sound Resettable Zero Knowledge in Constant Rounds. | 1 | 0.35 | 2017 |
| Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model. | 0 | 0.34 | 2017 |
| Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. | 4 | 0.38 | 2017 |
| Controlled Homomorphic Encryption: Definition and Construction. | 1 | 0.35 | 2017 |
| On Round-Efficient Non-Malleable Protocols. | 2 | 0.35 | 2016 |
| New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs. | 0 | 0.34 | 2016 |
| On Selective-Opening Attacks against Encryption Schemes. | 3 | 0.41 | 2014 |
| The design and implementation of a secure CAPTCHA against man-in-the-middle attacks | 1 | 0.35 | 2014 |
| Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation. | 0 | 0.34 | 2014 |
| Concurrent zero knowledge in the bounded player model | 5 | 0.39 | 2013 |
| SmartK: Smart cards in operating systems at kernel level | 5 | 0.47 | 2013 |
| Simultaneous Resettability from One-Way Functions | 10 | 0.48 | 2013 |
| Constant-Round Concurrent Zero Knowledge in the Bounded Player Model | 3 | 0.37 | 2013 |
| Reliable accounting in grids | 0 | 0.34 | 2013 |
| Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions. | 24 | 0.87 | 2012 |
| Constructing Non-malleable Commitments: A Black-Box Approach | 36 | 0.87 | 2012 |
| Simultaneously resettable arguments of knowledge | 16 | 0.59 | 2012 |
| Nearly simultaneously resettable black-box zero knowledge | 1 | 0.36 | 2012 |
| On round-optimal zero knowledge in the bare public-key model | 12 | 0.51 | 2012 |
| Resettable statistical zero knowledge | 5 | 0.47 | 2012 |
| Impossibility Results for Static Input Secure Computation. | 11 | 0.47 | 2012 |
| Simultaneous Resettability from Collision Resistance. | 14 | 0.57 | 2012 |
| Revisiting lower and upper bounds for selective decommitments | 10 | 0.50 | 2011 |
| On constant-round concurrent non-malleable proof systems | 5 | 0.44 | 2011 |
| On Efficient Non-Interactive Oblivious Transfer with Tamper-Proof Hardware. | 2 | 0.35 | 2010 |
| Efficiency preserving transformations for concurrent non-malleable zero knowledge | 15 | 0.56 | 2010 |
| Constant-Round concurrent non-malleable statistically binding commitments and decommitments | 5 | 0.40 | 2010 |
| Impossibility results for RFID privacy notions | 9 | 0.55 | 2010 |
| On RFID privacy with mutual authentication and tag corruption | 12 | 0.61 | 2010 |
| Increasing privacy threats in the cyberspace: the case of Italian e-passports | 2 | 0.47 | 2010 |
| Proxy Smart Card Systems | 1 | 0.34 | 2010 |
| Anonymizer-Enabled Security and Privacy for RFID | 19 | 0.78 | 2009 |
| Location Privacy in RFID Applications | 8 | 0.51 | 2009 |
| Co-sound Zero-Knowledge with Public Keys | 5 | 0.40 | 2009 |
| Revisiting DoS Attacks and Privacy in RFID-Enabled Networks | 7 | 0.59 | 2009 |
| Simulation-Based Concurrent Non-malleable Commitments and Decommitments | 10 | 0.50 | 2009 |
| Improved Security Notions and Protocols for Non-transferable Identification | 9 | 0.56 | 2008 |
| Collusion-Free Multiparty Computation in the Mediated Model | 14 | 0.65 | 2008 |
| User Privacy in Transport Systems Based on RFID E-Tickets | 25 | 1.18 | 2008 |
| Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings | 25 | 1.60 | 2008 |
| Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model | 21 | 0.64 | 2008 |
