BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Bill Brumley (Tampere University)
DTSTART;VALUE=DATE-TIME:20230213T163000Z
DTEND;VALUE=DATE-TIME:20230213T173000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/1
DESCRIPTION:Title: Side Channel Analysis and Lattice Attacks\nby Bill Brumley (Tampere
University) as part of Florida Atlantic University Crypto Café\n\nLectur
e held in SE43 - Room 215.\n\nAbstract\nLattice attacks are a typical endg
ame for side channel attacks targeting digital signature schemes. During t
he procurement phase\, the attacker queries digital signatures\, messages\
, and corresponding side channel traces\, then tries to extract secret inf
ormation from these traces and apply lattice methods to recover the priva
te key. But in practice\, these traces are often incomplete and/or noisy\,
complicating theoretical models for applying lattices. In this talk\, I d
iscuss some of the lattice attack techniques developed over the years\, an
d outline a few interesting open problems that highlight the gap between t
heory and practice for applied side channel attacks powered by lattice met
hods.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Wu (University of Texas at Austin)
DTSTART;VALUE=DATE-TIME:20230327T150000Z
DTEND;VALUE=DATE-TIME:20230327T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/2
DESCRIPTION:Title: Succinct Vector\, Polynomial\, and Functional Commitments from Lattices
\nby David Wu (University of Texas at Austin) as part of Florida Atlan
tic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nIn a f
unctional commitment scheme\, a user can commit to an input x and later on
\, open it to an arbitrary function evaluation f(x). We require that both
the commitment and the opening be short. Important special cases of functi
onal commitments include vector commitments and polynomial commitments. In
this talk\, I will introduce a new lattice-based framework for constructi
ng functional commitments that supports functions computable by arbitrary
(bounded-depth) Boolean circuits. Our constructions rely on a new falsifia
ble "basis-augmented SIS" assumption that we introduce\, which can be view
ed as a new "q-type" variant of the standard SIS assumption.\n\nJoint work
with Hoeteck Wee\n\nBio: David Wu is an assistant professor in the Depart
ment of Computer Science at the University of Texas at Austin. He is broad
ly interested in applied and theoretical cryptography as well as computer
security. Previously\, David received a PhD in computer science from Stanf
ord University in 2018 and was an assistant professor at the University of
Virginia from 2019 to 2021. He has received the NSF CAREER Award\, the Mi
crosoft Research Faculty Fellowship\, and a Google Research Scholar Award.
His work has been recognized with a Best Paper Award at CRYPTO (2022)\, t
wo Best Young-Researcher Paper Awards at CRYPTO (2017\, 2018) and an Outst
anding Paper Award at ESORICS (2016).\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mila Anastasova (FAU)
DTSTART;VALUE=DATE-TIME:20230227T160000Z
DTEND;VALUE=DATE-TIME:20230227T170000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/4
DESCRIPTION:Title: Time-Efficient Finite Field Microarchitecture Design for Curve448 and E
d448 on Cortex-M4.\nby Mila Anastasova (FAU) as part of Florida Atlant
ic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThe ell
iptic curve family of schemes has the lowest computational latency\, memor
y use\, energy consumption\, and bandwidth requirements\, making it the mo
st preferred public key method for adoption into network protocols. Being
suitable for embedded devices and applicable for key exchange and authenti
cation\, ECC is assuming a prominent position in the field of IoT cryptogr
aphy. The attractive properties of the relatively new curve Curve448 contr
ibute to its inclusion in the TLS1.3 protocol and pique the interest of ac
ademics and engineers aiming at studying and optimizing the schemes. When
addressing low-end IoT devices\, however\, the literature indicates little
work on these curves. In this presentation\, we present an efficient desi
gn for both protocols based on Montgomery curve Curve448 and its birationa
lly equivalent Edwards curve Ed448 used for key agreement and digital sign
ature algorithm\, specifically the X448 function and the Ed448 DSA\, relyi
ng on efficient low-level arithmetic operations targeting the ARM-based Co
rtex-M4 platform. Our design performs point multiplication\, the base of t
he Elliptic Curve Diffie Hellman (ECDH)\, in 3\,2KCCs\, resulting in more
than 48% improvement compared to the best previous work based on Curve448\
, and performs sign and verify\, the main operations of the Edwards curves
Digital Signature Algorithm (EdDSA)\, in 6\,038KCCs and 7\,404KCCs\, show
ing a speedup of around 11% compared to the counterparts. We present our n
ovel modular multiplication and squaring architectures reaching ∼ 25% an
d ∼ 35% faster runtime than the previous best-reported results\, respect
ively\, based on Curve448 key exchange counterparts\, and ∼ 13% and ∼
25% better latency results than the Ed448-based digital signature counterp
arts targeting Cortex-M4 platform.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Keegan Ryan (University of California\, San Diego)
DTSTART;VALUE=DATE-TIME:20230424T150000Z
DTEND;VALUE=DATE-TIME:20230424T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/5
DESCRIPTION:Title: Fast Practical Lattice Reduction through Iterated Compression\nby K
eegan Ryan (University of California\, San Diego) as part of Florida Atlan
tic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nWe int
roduce a new lattice basis reduction algorithm with approximation guarante
es analogous to the LLL algorithm and practical performance that far excee
ds the current state of the art. We achieve these results by iteratively a
pplying precision management techniques within a recursive algorithm struc
ture and show the stability of this approach. We analyze the asymptotic be
havior of our algorithm\, and show that the heuristic running time is $O(n
^{\\omega}(C+n)^{1+\\varepsilon})$ for lattices of dimension $n$\, $\\omeg
a\\in (2\,3]$ bounding the cost of size reduction\, matrix multiplication\
, and QR factorization\, and $C$ bounding the log of the condition number
of the input basis $B$. This yields a running time of $O\\left(n^\\omega (
p + n)^{1 + \\varepsilon}\\right)$ for precision $p = O(\\log \\|B\\|_{max
})$ in common applications. Our algorithm is fully practical\, and we have
published our implementation. We experimentally validate our heuristic\,
give extensive benchmarks against numerous classes of cryptographic lattic
es\, and show that our algorithm significantly outperforms existing implem
entations.\n\nKeegan Ryan is a 4th year PhD student advised by Prof. Nadia
Heninger at the University of California\, San Diego. His research intere
sts include practical cryptanalysis of real-world systems\, particularly p
roblems involving lattice reduction.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Corentin Jeudy (Orange Labs\, Université de Rennes)
DTSTART;VALUE=DATE-TIME:20230313T150000Z
DTEND;VALUE=DATE-TIME:20230313T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/6
DESCRIPTION:Title: On the Secret Distributions in Module Learning With Errors\nby Core
ntin Jeudy (Orange Labs\, Université de Rennes) as part of Florida Atlant
ic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThe Mod
ule Learning With Errors (M-LWE) problem is a core assumption of lattice-b
ased cryptography\, and it underlies the security of the future post-quant
um cryptography standards Kyber and Dilithium selected by NIST. The proble
m is parameterized by a secret distribution as well as an error distributi
on. There is a gap between the choices of those distributions for theoreti
cal hardness results (uniform secret modulo q) and practical schemes (smal
l bounded secret). In this talk\, we narrow this gap by presenting three r
esults focused on the secret distribution. We show that both search and de
cision M-LWE remain hard when the secret distribution is uniform over smal
l bounded secret\, provided that the rank is larger by a log(q) factor. We
then show the hardness of search M-LWE for more general secret distributi
ons carrying sufficient entropy.\n\nThis talk is based on the published pa
pers "On the Hardness of Module Learning With Errors with Short Distributi
ons" (Journal of Cryptology 2023) and "Entropic Hardness of Module-LWE fro
m Module-NTRU" (Indocrypt 2022) which are joint works with Katharina Boudg
oust\, Adeline Roux-Langlois and Weiqiang Wen.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Cariel Cohen (Securily)
DTSTART;VALUE=DATE-TIME:20230410T150000Z
DTEND;VALUE=DATE-TIME:20230410T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/7
DESCRIPTION:Title: Securing Cloud Business Applications: A Practical Approach to Cybersecu
rity and Compliance\nby Cariel Cohen (Securily) as part of Florida Atl
antic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nThis
topic explores practical approaches to securing business applications and
addressing cybersecurity and compliance challenges faced by businesses in
today's dynamic digital landscape. Cariel will share insights on best pra
ctices for securing cloud workloads\, data\, and applications\, including
implementing access controls\, training employees on cybersecurity awarene
ss\, and protecting data against a variety of risks. Attendees will gain v
aluable knowledge and practical solutions that are used in helping busines
ses thrive in the face of emerging cybersecurity threats and ever-changing
compliance requirements.\n\nWith over 20 years of experience in the cyber
security industry\, our speaker is a co-founder and passionate coder with
a love for cryptography\, authentication and patents. He has extensive exp
erience working with major public corporations\, including Aqua Security\,
Sony Pictures\, and 5B Technologies. Throughout his career\, he has been
dedicated to ethical hacking and compliance\, ensuring that businesses rem
ain secure and compliant in the face of emerging cybersecurity threats.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Adam Yergovich (Department of State)
DTSTART;VALUE=DATE-TIME:20230829T140000Z
DTEND;VALUE=DATE-TIME:20230829T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/8
DESCRIPTION:Title: Challenges in Securing a Worldwide Enterprise Network Footprint - The B
asics from Australia to Zimbabwe\nby Adam Yergovich (Department of Sta
te) as part of Florida Atlantic University Crypto Café\n\nLecture held in
SE 215.\n\nAbstract\nMany modern theories on Information Security rely on
sophisticated and efficient infrastructure we take for granted in develop
ed countries. When operating in nearly every country in the world it is n
ecessary to focus on the basics. There might be questionable infrastructu
re or even openly hostile host nations\, but basic "hygiene" is often the
best roadmap to securing information and communication - and often the mos
t neglected.\n\nSpeaker bio: Adam Yergovich works for the Department of St
ate\, Bureau of Diplomatic Security as a Regional Cyber Security Officer c
urrently stationed in Fort Lauderdale Florida. He has previously been sta
tioned in Frankfurt Germany\, Bangkok Thailand\, and Moscow Russia but tra
veled extensively within those regions. He graduated from from the Univer
sity of California Davis with a degree in Computer Science and Engineering
and worked for several years designing single board computers for a small
California company before joining State.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zhijun Yin (FAU)
DTSTART;VALUE=DATE-TIME:20230926T140000Z
DTEND;VALUE=DATE-TIME:20230926T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/9
DESCRIPTION:Title: Exploring the Power of Multivariate Public Key Cryptography (MPKC)\
nby Zhijun Yin (FAU) as part of Florida Atlantic University Crypto Café\n
\nLecture held in SE 215.\n\nAbstract\nMultivariate Public Key Cryptograph
y (MPKC) leverages multivariate quadratic polynomial mappings over finite
fields as the foundation for its trapdoor one-way functions. This innovati
ve approach offers remarkable efficiency in both encryption and decryption
processes\, making it a compelling choice for secure communications.\n\nI
n contrast to traditional cryptographic methods\, attacking MPKC involves
solving a system of nonlinear equations over the finite field\, a signific
antly more complex challenge than NP-hard problems like Boolean satisfiabi
lity\, which is equivalent to solving equations over the finite field GF(2
).\n\nIn this presentation\, we will delve into MPKC through a simplified
example featuring three variables within the finite field of GF(2). This i
llustrative toy example will demystify key concepts such as public and sec
ret keys\, encryption\, decryption\, and cryptanalysis. Join us as we unra
vel the intriguing world of MPKC and its potential impact on modern crypto
graphy.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tran Ngo (FAU)
DTSTART;VALUE=DATE-TIME:20231010T140000Z
DTEND;VALUE=DATE-TIME:20231010T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/10
DESCRIPTION:Title: Analysis for Lattice Enumeration\nby Tran Ngo (FAU) as part of Flo
rida Atlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbstra
ct\nLattice reduction algorithms such as BKZ (Block-Korkine-Zolotarev) pla
y a central role in estimating the security of lattice-based cryptography.
The subroutine in BKZ which needs to find the shortest vector in a projec
ted sublattice can be instantiated with enumeration algorithms. The enumer
ation procedure can be seen as a depth-first search on some "enumeration t
ree" whose nodes denote a partial assignment of the coefficients\, corresp
onding to lattice points as a linear combination of the lattice basis with
the coefficients. This work provides a concrete analysis for the cost of
quantum lattice enumeration based on the quantum tree backtracking algorit
hm of Montanaro (ToC\, '18). More precisely\, we give a concrete implement
ation of Montanaro's algorithm for lattice enumeration based on the quantu
m circuit model. We also show how to optimize the circuit depth by paralle
lizing the components. Based on the circuit designed\, we discuss the conc
rete quantum resource estimates required for lattice enumeration. This is
a joint work with Shi Bai\, Maya-Iggy van Hoof\, Floyd B. Johnson\, and Ta
nja Lange.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:William Youmans (FAU)
DTSTART;VALUE=DATE-TIME:20231024T140000Z
DTEND;VALUE=DATE-TIME:20231024T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/11
DESCRIPTION:Title: An algorithm for solving the principal ideal problem with subfields\nby William Youmans (FAU) as part of Florida Atlantic University Crypto
Café\n\nLecture held in SE 215.\n\nAbstract\nThe principal ideal problem
(PIP) is the problem of deciding whether a given ideal of a number field i
s principal and\, if it is\, of finding a generator. Solving the PIP appli
es to solving major computational tasks in number theory. It is also conne
cted to the search for approximate short vectors in so-called ideal lattic
es\, which is a crucial problem in cryptography. We present a novel applic
ation of norm relations to utilize information from subfields to solve the
PIP in fields of degree up to 1800.\n\nDr. William Youmans received a BA
in pure mathematics in 2017 and a PhD in mathematics in 2023 from the Univ
ersity of South Florida. Since May 2023 he has been a postdoctoral researc
h fellow at Florida Atlantic University. His research interests include la
ttice-based cryptography\, computational number theory\, and quantum algor
ithms.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paul Zimmermann (INRIA/LORIA\, France)
DTSTART;VALUE=DATE-TIME:20230912T140000Z
DTEND;VALUE=DATE-TIME:20230912T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/12
DESCRIPTION:Title: Deciphering Charles Quint (A diplomatic letter from 1547)\nby Paul
Zimmermann (INRIA/LORIA\, France) as part of Florida Atlantic University
Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nAn unknown and almost
fully encrypted letter written in 1547 by Emperor Charles V to his ambass
ador at the French Court\, Jean de Saint-Mauris\, was identified in a publ
ic library\, the Bibliothèque Stanislas (Nancy\, France). As no decryptio
n of this letter was previously published or even known\, a team of crypto
graphers and historians gathered together to study the letter and its encr
yption system. First\, multiple approaches and methods were tested in orde
r to decipher the letter without any other specimen. Then\, the letter has
now been inserted within the whole correspondence between Charles and Sai
nt-Mauris\, and the key has been consolidated thanks to previous key recon
structions. Finally\, the decryption effort enabled us to uncover the cont
ent of the letter and investigate more deeply both cryptanalysis challenge
s and encryption methods.\n\nPaul Zimmermann is a Directeur de Recherche a
t INRIA/LORIA\, Nancy\, France. His research interests include asymptotica
lly fast arithmetic\, computer algebra and computational number theory. To
gether with Richard Brent\, he has written the book "Modern Computer Arith
metic"\, and he has coordinated the book "Computational Mathematics with S
ageMath". He has contributed to some of the record computations in integer
factorization and discrete logarithm. He is the author or co-author of se
veral computer packages\, including the GNU MPFR library providing arithme
tic on floating-point numbers with correct rounding\, and CADO-NFS\, an im
plementation of the number field sieve for integer factorization. His late
st project is CORE-MATH\, an implementation of mathematical functions with
correct rounding for the IEEE 754 standard formats.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Zhenisbek Assylbekov (Purdue University Fort Wayne)
DTSTART;VALUE=DATE-TIME:20231107T150000Z
DTEND;VALUE=DATE-TIME:20231107T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/13
DESCRIPTION:Title: Intractability of Learning AES with Gradient-based Methods\nby Zhe
nisbek Assylbekov (Purdue University Fort Wayne) as part of Florida Atlant
ic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nWe show
the approximate pairwise orthogonality of a class of functions formed by
a single AES output bit under the assumption that all of its round keys
except the initial one are independent. This result implies the hardness
of learning AES encryption (and decryption) with gradient-based methods. T
he proof relies on the Boas-Bellman type of inequality in inner-product sp
aces.\n\nBio: Zhenisbek has a PhD in Mathematical Statistics from Hiroshim
a University. After the PhD and some period of work in industry\, he got a
job at Nazarbayev University\, where he was working as a Teaching Assista
nt\, Instructor\, and Assistant Professor in the Department of Mathematics
during 2011-2023. Currently\, he is an Assistant Professor of Data Scienc
e at Purdue University Fort Wayne.\n \nHis research interests are in machi
ne learning with applications to natural language processing (NLP). He is
interested in both the theoretical analysis of machine learning algorithms
and the practical implementation and experimental evaluation of such algo
rithms on text data. He is also interested in hardness of learning which i
s closely related to cryptography because cryptographic primitives are exa
ctly what is hard for machine learning.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paolo Santini (Università Politecnica delle Marche)
DTSTART;VALUE=DATE-TIME:20231121T150000Z
DTEND;VALUE=DATE-TIME:20231121T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/14
DESCRIPTION:Title: A New Formulation of the Linear Equivalence Problem and Shorter LESS S
ignatures\nby Paolo Santini (Università Politecnica delle Marche) as
part of Florida Atlantic University Crypto Café\n\nLecture held in SE 215
.\n\nAbstract\nThe problem of determining whether two linear codes are equ
ivalent is called Code Equivalence Problem. When codes are endowed with th
e Hamming metric (which is the most studied case)\, the equivalence is mai
nly considered with respect to monomial transformations (permutations with
scaling factors) and the problem is known as the Linear Equivalence Probl
em (LEP). Code equivalence can be described as a transitive\, non-commutat
ive group action and\, as such\, finds a natural application in cryptograp
hy: for example\, it is possible to design zero-knowledge proofs\, and hen
ce signature schemes. In recent works\, it has been shown that LEP can be
reformulated using notions such as information sets (arguably\, ubiquitous
objects in coding theory) and canonical forms. This unlocks some new feat
ures\, such as the possibility of communicating the equivalence map in a v
ery compact way (which leads to much shorter signatures)\, as well as open
ing new attack avenues. In this talk\, we recall the basics of code equiva
lence and then focus on these recent results\, aiming to describe how they
can be applied to boost the performance of cryptographic schemes.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Dominic Gold (FAU)
DTSTART;VALUE=DATE-TIME:20231205T150000Z
DTEND;VALUE=DATE-TIME:20231205T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/15
DESCRIPTION:Title: TDA-Preprocessing Yields Quantifiable Efficiency Gains in Privacy-Pres
erving ML Models\nby Dominic Gold (FAU) as part of Florida Atlantic Un
iversity Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nComputationa
l tools grounded in algebraic topology\, known collectively as topological
data analysis (TDA)\, have been used for dimensionality-reduction to pres
erve salient and discriminating features in data. TDA's flagship method\,
persistent homology (PH)\, extracts distinguishing shape characteristics f
rom the data directly and provide inherent noise-tolerance and compact\, i
nterpretable representations of high-dimensional data that are amenable to
well-established statistical methods and machine learning (ML) models\; t
his faithful but compressed representation of data motivates TDA's use to
address the complexity\, depth\, and inefficiency issues present in privac
y-preserving\, homomorphic encryption (HE)-based ML models through ciphert
ext packing---the process of packing multiple encrypted observations into
a single ciphertext for Single Instruction\, Multiple Data (SIMD) operatio
ns.\n\nBy investigating several TDA featurization techniques on the MNIST
digits dataset using a logistic regression (LR) classifier\, we demonstrat
ed that the TDA methods chosen improves encrypted model evaluation with a
10-25 fold reduction in amortized time while improving model accuracy up t
o 1.4% compared to naive reductions that used downscaling/resizing. The de
veloped technique also has implications for multiclass classification by s
ending multiple model classifications in a single packed ciphertext to red
uce the communication overhead between the Client and Server\, potentially
avoiding restriction to a binary classification (as done in past HE-ML li
terature for secure classification of MNIST digits).\n\nBiography: Dominic
Gold is a 6th year graduate teaching assistant at Florida Atlantic Univer
sity who studies both cryptography and data science\, with his main intere
st in secure/privacy-preserving machine learning on encrypted data. The in
tersectionality of his research in homomorphic encryption and topological
data analysis shows promising implications for research in both fields\, w
ith his work in cryptography recognized by venues such as USENIX and ACM C
CS. The ultimate goal of his work is to enable real-time predictions on en
crypted biomedical data to improve both the reliability\, security\, and e
quitability of healthcare systems.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vincenzo Pallozzi Lavorante (University of South Florida)
DTSTART;VALUE=DATE-TIME:20240129T150000Z
DTEND;VALUE=DATE-TIME:20240129T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/16
DESCRIPTION:Title: Locality and complexity distribution in coding theory\, an approach ba
sed on Galois theory\nby Vincenzo Pallozzi Lavorante (University of So
uth Florida) as part of Florida Atlantic University Crypto Café\n\nLectur
e held in SE 215.\n\nAbstract\nThe storage of information and the necessit
y to ease the heaviness of big data computations are two key aspects to co
nsider when investigating new problems in coding theory. The concept of l
ocality is closely linked to the reliability of distributed storage system
s\, while matrix multiplication is often the first operation required for
secure distribution. This presentation will provide an overview of the lat
est developments and explore how Galois theory can offer valuable tools fo
r addressing and contributing to these areas.\n\nBio: Dr. Pallozzi Lavoran
te received a Ph.D. in Mathematics in 2022 from the University of Modena a
nd Reggio Emilia in Italy. Since August 2022 he has been a Postdoctoral fe
llow at the University of South Florida. His research interest focuses on
Galois Theory and polynomials over finite fields with applications to codi
ng theory\, code-based cryptography\, and finite geometry.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jason LeGrow (Virginia Polytechnic Institute and State University)
DTSTART;VALUE=DATE-TIME:20240311T140000Z
DTEND;VALUE=DATE-TIME:20240311T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/17
DESCRIPTION:Title: Post-Quantum Blind Signatures from Group Actions\nby Jason LeGrow
(Virginia Polytechnic Institute and State University) as part of Florida A
tlantic University Crypto Café\n\nLecture held in SE 215.\n\nAbstract\nBl
ind signatures are a kind of cryptographic scheme which allows a User to r
eceive a Signer’s signature on a message\, in such a way that the messag
e is not revealed to the Signer. Blind signatures can be used in many appl
ications\, such as a electronic voting and anonymous purchasing. To resist
attacks by quantum computers\, we must design blind signature schemes bas
ed on computational problems which are believed to be hard for quantum com
puters: so-called post-quantum protocols. I will discuss techniques for co
nstructing post-quantum blind signatures from cryptographic group actions
in the setting of isogeny-based cryptography and code-based cryptography.\
n
LOCATION:https://researchseminars.org/talk/CryptoCafe/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Xinxin Fan (IoTeX)
DTSTART;VALUE=DATE-TIME:20240325T140000Z
DTEND;VALUE=DATE-TIME:20240325T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/18
DESCRIPTION:Title: Zero-Knowledge Proofs - An Industry Perspective\nby Xinxin Fan (Io
TeX) as part of Florida Atlantic University Crypto Café\n\nLecture held i
n SE 215.\n\nAbstract\nDriven by the rapid growth of blockchain and web3\,
zero-knowledge proofs have gained considerable development during the pas
t few years. In this talk\, I will give a state-of-the-art overview of zer
o-knowledge proofs and their potential use cases from an industry perspect
ive and highlight a number of research challenges that need to be further
investigated.\n\nDr. Xinxin Fan is the Head of Cryptography at IoTeX\, a S
ilicon Valley-based technology platform that empowers the emerging machine
economy with innovative combination of blockchain and IoT. He is responsi
ble for directing the company’s strategy and product roadmaps as well as
developing the core technologies and IP portfolio. Before joining IoTeX\,
he was a senior research engineer of the Security and Privacy Group at Bo
sch Research Technology Center North America. Dr. Xinxin Fan received his
Ph.D. in Electrical and Computer Engineering from the University of Waterl
oo in 2010. He has published 60+ referred research papers in top-tier jour
nals\, conferences and workshops in the areas of cryptography and informat
ion security and is an inventor of 17 patent filings for innovative inform
ation security and privacy-enhancing technologies. He is also a Certified
Information Systems Security Professional (CISSP) from (ISC)^2 and a (co-)
chair of IEEE P2418.1 and IEEE P2958 standards working groups.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Francesco Sica (FAU)
DTSTART;VALUE=DATE-TIME:20240408T140000Z
DTEND;VALUE=DATE-TIME:20240408T150000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/19
DESCRIPTION:Title: Acceleration of multiscalar multiplication for zkSNARKs\nby France
sco Sica (FAU) as part of Florida Atlantic University Crypto Café\n\nLect
ure held in SE 215.\n\nAbstract\nThe main computational bottleneck in the
implementation of zero-knowledge succinct arguments of knowledge (zkSNARKs
) based on elliptic curves\, such as Pinocchio\, is the evaluation (called
multiscalar multiplication) $\\sum_{i=1}^n a_i P_i$\, where the $a_i$’s
are scalar and the $P_i$’s are fixed elliptic curve points. We will rev
iew currently used techniques and introduce new improvements. \nThis is jo
int work with Xinxin Fan\, Veronika Kuchta and Lei Xu.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Merve Karabulut (FAU)
DTSTART;VALUE=DATE-TIME:20240212T150000Z
DTEND;VALUE=DATE-TIME:20240212T160000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/20
DESCRIPTION:Title: Number Theoretic Transform: A Python-based Speed Enhancement\nby M
erve Karabulut (FAU) as part of Florida Atlantic University Crypto Café\n
\nLecture held in SE 215.\n\nAbstract\nOur proposal involves a Python-base
d solution that utilizes Numba's just-in-time compilation capabilities. We
aim to optimize the control flow of the Number Theoretic Transform (NTT)
operation to exploit parallelism in modern CPUs. Our solution leverages mu
lti-core processing\, multi-threading\, and cache memory.\n\nSpeaker bio:
Merve is a computer engineering graduate from Yildiz Technical University\
, with experience in full-stack development and blockchain\, especially wi
th Hyperledger. At FAU\, she is working towards a Ph.D.\, focusing on PQC
with Dr. Reza Azarderakhsh. Her goal is to create secure solutions resista
nt to quantum computing and efficient implementation of algorithms.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lukas Kölsch (University of South Florida)
DTSTART;VALUE=DATE-TIME:20240226T213000Z
DTEND;VALUE=DATE-TIME:20240226T223000Z
DTSTAMP;VALUE=DATE-TIME:20240329T122156Z
UID:CryptoCafe/21
DESCRIPTION:Title: A general and unifying construction for semifields and their related m
aximum rank distance codes\nby Lukas Kölsch (University of South Flor
ida) as part of Florida Atlantic University Crypto Café\n\n\nAbstract\n**
******* IMPORTANT: THIS TALK AT 4:30 PM *********\n\nSemifields are algebr
aic structures that can be for instance used to construct nondesarguesian
planes in finite geometry\, as well as maximum rank distance (MRD) codes w
ith special parameters (more precisely\, every element in the code will be
a square matrix with full rank). Many constructions of MRD codes are root
ed in ideas from semifield theory. Interestingly\, many known construction
s of semifields only exist in even dimension (i.e. the dimension over the
prime field is even)\, leading to MRD codes in even dimension or MRD codes
in odd dimension over a field of even degree. In this talk\, we present a
unifying construction for almost all semifields of this type\, including
semifields found by Dickson\, Knuth\, Hughes-Kleinfeld\, Taniguchi\, Dempw
olff\, Bierbrauer\, Zhou-Pott in the last 120 years. Our construction reco
vers all these semifields\, and gives many new examples.\n
LOCATION:https://researchseminars.org/talk/CryptoCafe/21/
END:VEVENT
END:VCALENDAR