default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Lisa Ferrara
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Alfredo De Santis
, Anna Lisa Ferrara, Manuela Flores, Barbara Masucci:
Provably-Secure One-Message Unilateral Entity Authentication Schemes. IEEE Trans. Dependable Secur. Comput. 21(4): 1665-1679 (2024)- [c21]Roberta Cimorelli Belfiore, Andrea De Cosmo, Anna Lisa Ferrara:
Identity-Based Matchmaking Encryption from Standard Lattice Assumptions. ACNS (2) 2024: 163-188 - [c20]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, Giorgio Venditti:
An Information-Theoretic Approach to Anonymous Access Control. ISIT 2024: 3326-3331 - [c19]Roberta Cimorelli Belfiore, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Hierarchical Key Assignment Schemes with Key Rotation. SACMAT 2024 - [e2]Anna Lisa Ferrara, Ram Krishnan:
Data and Applications Security and Privacy XXXVIII - 38th Annual IFIP WG 11.3 Conference, DBSec 2024, San Jose, CA, USA, July 15-17, 2024, Proceedings. Lecture Notes in Computer Science 14901, Springer 2024, ISBN 978-3-031-65171-7 [contents] - 2023
- [c18]Roberta Cimorelli Belfiore, Anna Lisa Ferrara:
Security Analysis of Access Control Policies for Smart Homes. SACMAT 2023: 99-106 - [e1]Vijayalakshmi Atluri, Anna Lisa Ferrara:
Data and Applications Security and Privacy XXXVII - 37th Annual IFIP WG 11.3 Conference, DBSec 2023, Sophia-Antipolis, France, July 19-21, 2023, Proceedings. Lecture Notes in Computer Science 13942, Springer 2023, ISBN 978-3-031-37585-9 [contents] - 2021
- [c17]Anna Lisa Ferrara, Federica Paci, Chiara Ricciardi:
Verifiable Hierarchical Key Assignment Schemes. DBSec 2021: 357-376 - 2020
- [j13]Stephen Hart, Anna Lisa Ferrara, Federica Paci:
Fuzzy-based approach to assess and prioritize privacy risks. Soft Comput. 24(3): 1553-1563 (2020) - [i6]Anna Lisa Ferrara, Chiara Ricciardi:
Verifiable Hierarchical Key Assignment Schemes. IACR Cryptol. ePrint Arch. 2020: 1156 (2020)
2010 – 2019
- 2017
- [c16]Emre Uzun, Gennaro Parlato, Vijayalakshmi Atluri, Anna Lisa Ferrara, Jaideep Vaidya, Shamik Sural, David Lorenzi:
Preventing Unauthorized Data Flows. DBSec 2017: 41-62 - [c15]Anna Lisa Ferrara, Anna Cinzia Squicciarini, Cong Liao, Truc L. Nguyen:
Toward Group-Based User-Attribute Policies in Azure-Like Access Control Systems. DBSec 2017: 349-361 - 2015
- [c14]Anna Lisa Ferrara, Georg Fuchsbauer, Bin Liu, Bogdan Warinschi:
Policy Privacy in Cryptographic Access Control. CSF 2015: 46-60 - 2014
- [j12]Emre Uzun, Vijayalakshmi Atluri, Jaideep Vaidya, Shamik Sural, Anna Lisa Ferrara, Gennaro Parlato, P. Madhusudan:
Security analysis for temporal role based access control. J. Comput. Secur. 22(6): 961-996 (2014) - [c13]Anna Lisa Ferrara, P. Madhusudan, Truc L. Nguyen, Gennaro Parlato:
Vac - Verifier of Administrative Role-Based Access Control Policies. CAV 2014: 184-191 - 2013
- [j11]Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
A note on time-bound hierarchical key assignment schemes. Inf. Process. Lett. 113(5-6): 151-155 (2013) - [c12]Anna Lisa Ferrara, Georg Fuchsbauer, Bogdan Warinschi:
Cryptographically Enforced RBAC. CSF 2013: 115-129 - [c11]Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato:
Policy Analysis for Self-administrated Role-Based Access Control. TACAS 2013: 432-447 - [i5]Anna Lisa Ferrara, Georg Fuchsbauer, Bogdan Warinschi:
Cryptographically Enforced RBAC. IACR Cryptol. ePrint Arch. 2013: 492 (2013) - 2012
- [j10]Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes. J. Cryptol. 25(2): 243-270 (2012) - [c10]Anna Lisa Ferrara, P. Madhusudan, Gennaro Parlato:
Security Analysis of Role-Based Access Control through Program Verification. CSF 2012: 113-125 - [c9]Emre Uzun, Vijayalakshmi Atluri, Shamik Sural, Jaideep Vaidya, Gennaro Parlato, Anna Lisa Ferrara, Parthasarathy Madhusudan:
Analyzing temporal role based access control models. SACMAT 2012: 177-186 - 2011
- [j9]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Efficient provably-secure hierarchical key assignment schemes. Theor. Comput. Sci. 412(41): 5684-5699 (2011) - 2010
- [j8]Paolo D'Arco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Variations on a theme by Akl and Taylor: Security and tradeoffs. Theor. Comput. Sci. 411(1): 213-227 (2010)
2000 – 2009
- 2009
- [c8]Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, Michael Østergaard Pedersen:
Practical Short Signature Batch Verification. CT-RSA 2009: 309-324 - [c7]Paolo D'Arco, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants. MFCS 2009: 247-257 - 2008
- [j7]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
An attack on a payment scheme. Inf. Sci. 178(5): 1418-1421 (2008) - [j6]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
New constructions for provably-secure time-bound hierarchical key assignment schemes. Theor. Comput. Sci. 407(1-3): 213-230 (2008) - [i4]Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, Michael Østergaard Pedersen:
Practical Short Signature Batch Verification. IACR Cryptol. ePrint Arch. 2008: 15 (2008) - 2007
- [c6]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Efficient Provably-Secure Hierarchical Key Assignment Schemes. MFCS 2007: 371-382 - [c5]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
New constructions for provably-secure time-bound hierarchical key assignment schemes. SACMAT 2007: 133-138 - 2006
- [j5]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Unconditionally secure key assignment schemes. Discret. Appl. Math. 154(2): 234-252 (2006) - [j4]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Enforcing the security of a time-bound hierarchical key assignment scheme. Inf. Sci. 176(12): 1684-1694 (2006) - [c4]Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Provably-secure time-bound hierarchical key assignment schemes. CCS 2006: 288-297 - [i3]Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Provably-Secure Time-Bound Hierarchical Key Assignment Schemes. IACR Cryptol. ePrint Arch. 2006: 225 (2006) - [i2]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Efficient Provably-Secure Hierarchical Key Assignment Schemes. IACR Cryptol. ePrint Arch. 2006: 479 (2006) - [i1]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
New Constructions for Provably-Secure Time-Bound Hierarchical Key Assignment Schemes. IACR Cryptol. ePrint Arch. 2006: 483 (2006) - 2005
- [j3]Stelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Ideal contrast visual cryptography schemes with reversing. Inf. Process. Lett. 93(4): 199-206 (2005) - [c3]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy. WCC 2005: 202-217 - 2004
- [j2]Francis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, Ngai Lam Ho, S. K. Kim:
A simple algorithm for the constrained sequence problems. Inf. Process. Lett. 90(4): 175-179 (2004) - [j1]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Cryptographic key assignment schemes for any access control policy. Inf. Process. Lett. 92(4): 199-205 (2004) - 2003
- [c2]Anna Lisa Ferrara, Barbara Masucci:
An Information-Theoretic Approach to the Access Control Problem. ICTCS 2003: 342-354 - [c1]Carlo Blundo, Stelvio Cimato, Roberto De Prisco, Anna Lisa Ferrara:
Modeling A Certified Email Protocol using I/O Automata. MEFISTO 2003: 339-359
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
