default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarbara Masucci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]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)- [c19]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, Giorgio Venditti:
An Information-Theoretic Approach to Anonymous Access Control. ISIT 2024: 3326-3331 - [c18]Roberta Cimorelli Belfiore, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Hierarchical Key Assignment Schemes with Key Rotation. SACMAT 2024 - [c17]Barbara Masucci:
Cryptographic Enforcement of Access Control Policies: Models, Applications, and Future Directions. SACMAT 2024 - 2023
- [c16]Alfredo De Santis, Barbara Masucci:
New Results on Distributed Secret Sharing Protocols. DBSec 2023: 51-68
2010 – 2019
- 2019
- [c15]Marco Castaldo, Aniello Castiglione, Barbara Masucci, Michele Nappi, Chiara Pero:
Energy Awareness and Secure Communication Protocols: The Era of Green Cybersecurity. SSCC 2019: 159-173 - 2017
- [j29]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci, Francesco Palmieri, Xinyi Huang, Aniello Castiglione:
Supporting dynamic updates in storage clouds with the Akl-Taylor scheme. Inf. Sci. 387: 56-74 (2017) - [j28]Arcangelo Castiglione, Raffaele Pizzolante, Francesco Palmieri, Barbara Masucci, Bruno Carpentieri, Alfredo De Santis, Aniello Castiglione:
On-Board Format-Independent Security of Functional Magnetic Resonance Images. ACM Trans. Embed. Comput. Syst. 16(2): 56:1-56:15 (2017) - [c14]Alfredo De Santis, Manuela Flores, Barbara Masucci:
One-Message Unilateral Entity Authentication Schemes. ARES 2017: 25:1-25:6 - 2016
- [j27]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci:
Key Indistinguishability versus Strong Key Indistinguishability for Hierarchical Key Assignment Schemes. IEEE Trans. Dependable Secur. Comput. 13(4): 451-460 (2016) - [j26]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci, Francesco Palmieri, Aniello Castiglione, Jin Li, Xinyi Huang:
Hierarchical and Shared Access Control. IEEE Trans. Inf. Forensics Secur. 11(4): 850-865 (2016) - [j25]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci, Francesco Palmieri, Aniello Castiglione, Xinyi Huang:
Cryptographic Hierarchical Access Control for Dynamic Structures. IEEE Trans. Inf. Forensics Secur. 11(10): 2349-2364 (2016) - [c13]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci, Francesco Palmieri, Aniello Castiglione:
On the Relations Between Security Notions in Hierarchical Key Assignment Schemes for Dynamic Structures. ACISP (2) 2016: 37-54 - 2015
- [j24]Massimo Cafaro, Roberto Civino, Barbara Masucci:
On the Equivalence of Two Security Notions for Hierarchical Key Assignment Schemes in the Unconditional Setting. IEEE Trans. Dependable Secur. Comput. 12(4): 485-490 (2015) - [c12]Aniello Castiglione, Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci, Francesco Palmieri, Raffaele Pizzolante:
Novel Insider Threat Techniques: Automation and Generation of Ad Hoc Digital Evidence. MIST@CCS 2015: 29-39 - 2014
- [c11]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci:
Hierarchical and Shared Key Assignment. NBiS 2014: 263-270 - [i7]Massimo Cafaro, Roberto Civino, Barbara Masucci:
On the Unconditional Security of Hierarchical Key Assignment Schemes. CoRR abs/1402.5371 (2014) - [i6]Arcangelo Castiglione, Alfredo De Santis, Barbara Masucci:
Key Indistinguishability vs. Strong Key Indistinguishability for Hierarchical Key Assignment Schemes. IACR Cryptol. ePrint Arch. 2014: 752 (2014) - 2013
- [j23]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) - 2012
- [j22]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) - 2011
- [j21]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Efficient provably-secure hierarchical key assignment schemes. Theor. Comput. Sci. 412(41): 5684-5699 (2011) - 2010
- [j20]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
- [c10]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
- [j19]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
An attack on a payment scheme. Inf. Sci. 178(5): 1418-1421 (2008) - [j18]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) - 2007
- [j17]Alfredo De Santis, Barbara Masucci:
New results on non-perfect sharing of multiple secrets. J. Syst. Softw. 80(2): 216-223 (2007) - [c9]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Efficient Provably-Secure Hierarchical Key Assignment Schemes. MFCS 2007: 371-382 - [c8]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
New constructions for provably-secure time-bound hierarchical key assignment schemes. SACMAT 2007: 133-138 - 2006
- [j16]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Unconditionally secure key assignment schemes. Discret. Appl. Math. 154(2): 234-252 (2006) - [j15]Barbara Masucci:
Sharing Multiple Secrets: Models, Schemes and Analysis. Des. Codes Cryptogr. 39(1): 89-111 (2006) - [j14]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) - [c7]Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Provably-secure time-bound hierarchical key assignment schemes. CCS 2006: 288-297 - [i5]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) - [i4]Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
Efficient Provably-Secure Hierarchical Key Assignment Schemes. IACR Cryptol. ePrint Arch. 2006: 479 (2006) - [i3]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
- [j13]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) - [c6]Stelvio Cimato, Clemente Galdi, Raffaella Giordano, Barbara Masucci, Gildo Tomasco:
Design and Implementation of an Inline Certified E-mail Service. CANS 2005: 186-199 - [c5]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
- [j12]Alfredo De Santis, Barbara Masucci:
Anonymous Membership Broadcast Schemes. Des. Codes Cryptogr. 32(1-3): 135-151 (2004) - [j11]Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. Des. Codes Cryptogr. 33(3): 241-260 (2004) - [j10]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
- [c4]Anna Lisa Ferrara, Barbara Masucci:
An Information-Theoretic Approach to the Access Control Problem. ICTCS 2003: 342-354 - 2002
- [j9]Carlo Blundo, Annalisa De Bonis, Barbara Masucci:
Bounds and constructions for metering schemes. Commun. Inf. Syst. 2(1): 1-28 (2002) - [j8]Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei:
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. Des. Codes Cryptogr. 26(1-3): 97-110 (2002) - [j7]Carlo Blundo, Stelvio Cimato, Barbara Masucci:
A note on optimal metering schemes. Inf. Process. Lett. 84(6): 319-326 (2002) - 2001
- [j6]Barbara Masucci, Douglas R. Stinson:
Efficient metering schemes with pricing. IEEE Trans. Inf. Theory 47(7): 2835-2844 (2001) - [i2]Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. IACR Cryptol. ePrint Arch. 2001: 87 (2001) - 2000
- [j5]Alfredo De Santis, Barbara Masucci:
On secret set schemes. Inf. Process. Lett. 74(5-6): 243-251 (2000) - [c3]Barbara Masucci, Douglas R. Stinson:
Metering Schemes for General Access Structures. ESORICS 2000: 72-87 - [c2]Carlo Blundo, Annalisa De Bonis, Barbara Masucci, Douglas R. Stinson:
Dynamic Multi-threshold Metering Schemes. Selected Areas in Cryptography 2000: 130-143 - [c1]Carlo Blundo, Annalisa De Bonis, Barbara Masucci:
Metering Schemes with Pricing. DISC 2000: 194-208 - [i1]Carlo Blundo, Barbara Masucci, Douglas R. Stinson, Ruizhong Wei:
Constructions and Bounds for Unconditionally Secure Commitment Schemes. IACR Cryptol. ePrint Arch. 2000: 43 (2000)
1990 – 1999
- 1999
- [j4]Alfredo De Santis, Barbara Masucci:
A Lower Bound on the Encoding Length in Lossy Transmission. Inf. Sci. 116(2-4): 129-146 (1999) - [j3]Carlo Blundo, Barbara Masucci:
A Note on the Randomness in Dynamic Threshold Schemes. J. Comput. Secur. 7(1): 73-85 (1999) - [j2]Carlo Blundo, Barbara Masucci:
Randomness in Multi-Secret Sharing Schemes. J. Univers. Comput. Sci. 5(7): 367-389 (1999) - [j1]Alfredo De Santis, Barbara Masucci:
Multiple ramp schemes. IEEE Trans. Inf. Theory 45(5): 1720-1728 (1999)
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 2024-10-13 18:00 CEST 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:
