Sofia M Nikolakaki retweeted
Dynamic searchable encryption with optimal search time in the presence of deletes + forward/backward privacy + faster in practice? DONE!
My student @OItsMAK2 presents our work (eprint.iacr.org/2022/648) today at 2:15pm at @USENIXSecurity (joint work w/ J.Chamani + @dipapadopo)
If you are interested in pursuing a PhD or a Postdoc in the areas of applied cryptography, security & privacy, and secure databases & systems consider applying.
Please RT: I am hiring PhD students and Postdocs interested in the areas of applied cryptography, security & privacy, and secure databases & systems @UCSC CSE Dept.! The deadline is January 11, 2021. Please contact me directly if interested! More details: idemertzis.com/UCSC_PHD_Post…
Teaming up people only based on their ability is not enough! Team members should have clear roles and respect each other. To see how check our work "Finding Teams of Maximum Mutual Respect", accepted @icdm2020 w/ E.Terzi, P.Tsaparas, E.Pitoura. #ApproximationAlgorithms #ICDM2020
Sofia M Nikolakaki retweeted
Competitive Balance in Team Sports Games
deepai.org/publication/compe…
by @smnikol et al.
#Probability #NeuralNetwork
My internship work "Competitive Balance in Team Sports Games" @EA has been accepted as a full paper @ieee_cog. Check out how to achieve fast prediction of balanced matches in team sports games arxiv.org/pdf/2006.13763.pdf w/ O. Dibie, @beiramiAB, N. Peterson, N. Aghdaie and K. Zaman!
Sofia M Nikolakaki retweeted
I am very excited to announce that I will be starting in Fall 2021 as an Assistant Professor in Computer Science and Engineering at UC Santa Cruz @UCSC and that I'll be spending the next year as a postdoc at UC Berkeley @Berkeley_EECS at RiseLab @ucbrise!
Sofia M Nikolakaki retweeted
(2/2) highlight of this work: Getting encrypted search time to be close to plaintext search time in a dynamic setting is hard, unless you seriously ORAM. We minimize using ORAM by logging deletions. @DemertzisYannis, now on the job market, will present the work at @NDSSSymposium!
Dynamic searchable encryption with small client storage AND non-interactive search AND forward/backward privacy? Dont mind if I do :) Catch our upcoming work ia.cr/2019/1227 at #ndss2020 with @DemertzisYannis, my student Javad Ghareh Chamani, and @chbpap!
New trends of Searchable Encryption presented by @DemertzisYannis @Visa_Research
6
Sofia M Nikolakaki retweeted
Excited to listen to @kimisperros ‘s awesome works on #tensor factorization for scalable unsupervised phenotyping at TMEDSC workshop @kdd_news #kdd2019
Team formation research meets application!! Excited to apply our team formation research for team recommendations in hackathons :D @TechTogetherBos
#TeamFormation #ResearchMeetsApplication #TechTogetherBoston
Sofia M Nikolakaki retweeted
Kimis presenting "SUSTain:Scalable unsupervised scoring for tensors.." @KDD2018 poster session.
#KDD2018 @mlatgt @GTCSE @gtcomputing @kimisperros
The best finale to an amazing internship - Winner at the CTO Tech Fair #CTOKenMoss #EA #EASports #ThisIsEA #IAmInTheGame :D :D
Sofia M Nikolakaki retweeted
Our work on integer tensor factorization and its application to phenotyping got accepted to KDD 2018 as a long presentation! Check out the pre-print: arxiv.org/abs/1803.05473 @vagelispapalex @hpcgarage @jimeng @GTCSE #kdd2018
Sofia M Nikolakaki retweeted
CRYPTO 2018 accepted paper: "Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency", with my student @DemertzisYannis and @dipapadopo. Question: How close to O(1) can we go?
Sofia M Nikolakaki retweeted
Question: is there an algorithm to create groups of students and assign them to projects? I could have them rank projects and assign projects using optimization, but I feel they might be happier/learn more if they can decide who they work with.
Sofia M Nikolakaki retweeted
.@UofMaryland doctoral student Ioannis Demertzis awarded prestigious @symantec research fellowship to continue his work in searchable encryption go.umd.edu/f5q #UMDInspires @eceumd @UMDGradSchool
Sofia M Nikolakaki retweeted
Big congratulations to my student @DemertzisYannis from @eceumd, @CollegeParkMC2 and @umiacs for receiving the 2018 @symantec Research Labs Graduate Fellowship for his work on searchable encryption! goo.gl/Dex6f6
Our paper "Mining tours and paths in activity networks" has been accepted at #www2018 w/ @harrymvr, Alina Ene, Evimaria Terzi
Preprint: smnikolakaki.com/tours_paths…





















