References of "Iovino, Vincenzo"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detail(Universal) Unconditional Verifiability in E-Voting without Trusted Parties
Iovino, Vincenzo; Rial, Alfredo UL; Roenne, Peter UL et al

in 2020 IEEE 33rd Computer Security Foundations Symposium (2020)

Detailed reference viewed: 125 (1 UL)
Full Text
Peer Reviewed
See detailVerifiable Inner Product Encryption Scheme
Soroush, Najmeh UL; Iovino, Vincenzo; Rial, Alfredo UL et al

in Public-Key Cryptography – PKC 2020 (2020)

Detailed reference viewed: 103 (5 UL)
Full Text
Peer Reviewed
See detail"The Simplest Protocol for Oblivious Transfer'' Revisited
Genç, Ziya Alper UL; Iovino, Vincenzo; Rial, Alfredo UL

in Information Processing Letters (2020)

In 2015, Chou and Orlandi presented an oblivious transfer protocol that already drew a lot of attention both from theorists and practitioners due to its extreme simplicity and high efficiency. Chou and ... [more ▼]

In 2015, Chou and Orlandi presented an oblivious transfer protocol that already drew a lot of attention both from theorists and practitioners due to its extreme simplicity and high efficiency. Chou and Orlandi claimed that their protocol is universally composable secure (UC-secure) in the random oracle model under dynamic corruptions. UC-security is a very strong security guarantee that assures that, not only the protocol in itself is secure, but can be also used safely in larger protocols. Unfortunately, in this work we point out a flaw in their security proof for the case of a corrupt sender. In more detail, we define a decisional problem and we prove that, if a correct security proof for the Chou and Orlandi's protocol is provided, then this problem can be solved correctly with overwhelming probability. Therefore, the protocol of Chou and Orlandi cannot be instantiated securely with groups for which our decisional problem cannot be solved correctly with overwhelming probability. Consequently, the protocol of Chou and Orlandi cannot be instantiated with {\em all} groups $\G$ in which the CDH problem is intractable, but only with groups in which both the CDH problem is intractable and our decisional problem can be solved with overwhelming probability. After the appearance of our work, Chou and Orlandi acknowledged the problems we pointed out in their security proof and subsequent works showed additional issues, removing the claims of UC security of their protocol. [less ▲]

Detailed reference viewed: 86 (6 UL)