default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Caforio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Subhadeep Banik
, Andrea Caforio, Serge Vaudenay:
New Attacks on LowMC Using Partial Sets in the Single-Data Setting. IACR Commun. Cryptol. 1(1): 22 (2024)- [j6]Ravi Anand, Subhadeep Banik, Andrea Caforio, Tatsuya Ishikawa, Takanori Isobe, Fukang Liu, Kazuhiko Minematsu, Mostafizar Rahman, Kosei Sakamoto:
Gleeok: A Family of Low-Latency PRFs and its Applications to Authenticated Encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(2): 545-587 (2024) - 2023
- [j5]Hailun Yan, Serge Vaudenay, Daniel Collins, Andrea Caforio:
Optimal Symmetric Ratcheting for Secure Communication. Comput. J. 66(4): 987-1016 (2023) - [c9]Ravi Anand, Subhadeep Banik, Andrea Caforio, Kazuhide Fukushima, Takanori Isobe, Shinsaku Kiyomoto, Fukang Liu, Yuto Nakano, Kosei Sakamoto, Nobuyuki Takeuchi:
An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation. ESORICS (1) 2023: 229-248 - 2022
- [j4]Andrea Caforio, Fatih Balli, Subhadeep Banik:
Melting SNOW-V: improved lightweight architectures. J. Cryptogr. Eng. 12(1): 53-73 (2022) - [c8]Andrea Caforio, Daniel Collins, Subhadeep Banik, Francesco Regazzoni:
A Small GIFT-COFB: Lightweight Bit-Serial Architectures. AFRICACRYPT 2022: 53-77 - [c7]Subhadeep Banik, Andrea Caforio, Kostas Papagiannopoulos, Francesco Regazzoni:
Bias Cancellation of MixColumns. SPACE 2022: 70-80 - [i11]Subhadeep Banik, Khashayar Barooti, Andrea Caforio, Serge Vaudenay:
Memory-Efficient Single Data-Complexity Attacks on LowMC Using Partial Sets. IACR Cryptol. ePrint Arch. 2022: 688 (2022) - [i10]Andrea Caforio, Daniel Collins, Subhadeep Banik, Francesco Regazzoni:
A Small GIFT-COFB: Lightweight Bit-Serial Architectures. IACR Cryptol. ePrint Arch. 2022: 955 (2022) - 2021
- [j3]Fatih Balli, Andrea Caforio, Subhadeep Banik:
The Area-Latency Symbiosis: Towards Improved Serial Encryption Circuits. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1): 239-278 (2021) - [j2]Subhadeep Banik, Andrea Caforio, Takanori Isobe, Fukang Liu, Willi Meier, Kosei Sakamoto, Santanu Sarkar:
Atom: A Stream Cipher with Double Key Filter. IACR Trans. Symmetric Cryptol. 2021(1): 5-36 (2021) - [j1]Andrea Caforio, Subhadeep Banik, Yosuke Todo, Willi Meier, Takanori Isobe, Fukang Liu, Bin Zhang:
Perfect Trees: Designing Energy-Optimal Symmetric Encryption Primitives. IACR Trans. Symmetric Cryptol. 2021(4): 36-73 (2021) - [c6]Andrea Caforio, Fatih Balli, Subhadeep Banik:
Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers. CARDIS 2021: 97-117 - [c5]Andrea Caforio, Fatih Balli, Subhadeep Banik, Francesco Regazzoni:
A Deeper Look at the Energy Consumption of Lightweight Block Ciphers. DATE 2021: 170-175 - [c4]Andrea Caforio, Daniel Collins, Ognjen Glamocanin, Subhadeep Banik:
Improving First-Order Threshold Implementations of SKINNY. INDOCRYPT 2021: 246-267 - [c3]Andrea Caforio, F. Betül Durak, Serge Vaudenay:
Beyond Security and Efficiency: On-Demand Ratcheting with Security Awareness. Public Key Cryptography (2) 2021: 649-677 - [i9]Subhadeep Banik, Andrea Caforio, Takanori Isobe, Fukang Liu, Willi Meier, Kosei Sakamoto, Santanu Sarkar:
Atom: A Stream Cipher with Double Key Filter. IACR Cryptol. ePrint Arch. 2021: 403 (2021) - [i8]Fatih Balli, Andrea Caforio, Subhadeep Banik:
Some Applications of Hamming Weight Correlations. IACR Cryptol. ePrint Arch. 2021: 611 (2021) - [i7]Andrea Caforio, Fatih Balli, Subhadeep Banik:
Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers. IACR Cryptol. ePrint Arch. 2021: 1252 (2021) - [i6]Andrea Caforio, Daniel Collins, Ognjen Glamocanin, Subhadeep Banik:
Improving First-Order Threshold Implementations of SKINNY. IACR Cryptol. ePrint Arch. 2021: 1425 (2021) - [i5]Andrea Caforio, Subhadeep Banik, Yosuke Todo, Willi Meier, Takanori Isobe, Fukang Liu, Bin Zhang:
Perfect Trees: Designing Energy-Optimal Symmetric Encryption Primitives. IACR Cryptol. ePrint Arch. 2021: 1523 (2021) - 2020
- [c2]Andrea Caforio, Fatih Balli, Subhadeep Banik:
Energy Analysis of Lightweight AEAD Circuits. CANS 2020: 23-42 - [i4]Andrea Caforio, Fatih Balli, Subhadeep Banik:
Energy Analysis of Lightweight AEAD Circuits. IACR Cryptol. ePrint Arch. 2020: 607 (2020) - [i3]Fatih Balli, Andrea Caforio, Subhadeep Banik:
Low-latency Meets Low-area: An Improved Bit-Sliding Technique for AES, SKINNY and GIFT. IACR Cryptol. ePrint Arch. 2020: 608 (2020)
2010 – 2019
- 2019
- [c1]Andrea Caforio, Subhadeep Banik:
A Study of Persistent Fault Analysis. SPACE 2019: 13-33 - [i2]Andrea Caforio, F. Betül Durak, Serge Vaudenay:
On-Demand Ratcheting with Security Awareness. IACR Cryptol. ePrint Arch. 2019: 965 (2019) - [i1]Andrea Caforio, Subhadeep Banik:
A Study of Persistent Fault Analysis. IACR Cryptol. ePrint Arch. 2019: 1057 (2019)
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-07-05 20:19 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:
