CIOs decided which cloud severs and services are
being used today inside an organization. In that con-
text it seems that for cloud servers having a good sales
person is more important than having experts know-
ing the state-of-the-art in privacy/security. In this con-
text, one can only conclude that:
• clouds are making our research irrelevant, and that
• technology transfer from research to practice has
been a failure.
ACKNOWLEDGEMENTS
Travel made possible by the Jonsson Endowment.
REFERENCES
Abe, M. (1998). Universally verifiable Mix-net with ver-
ification work independent of the number of Mix-
centers. In Nyberg, K., editor, Advances in Cryptology
— Eurocrypt ’98, Proceedings (Lecture Notes in Com-
puter Science 1403), pages 437–447. Springer-Verlag.
Espoo, Finland, May 31–June 4.
Chaum, D. (1981). Untraceable electronic mail, return ad-
dresses, and digital pseudonyms. Commun. ACM,
24(2):84–88.
Chaum, D. (2001). Surevote: Technical overview. In Pro-
ceedings of the Workshop on Trustworthy Elections
(WOTE ’01), August 2001.
Chaum, D., Rivest, R. L., and Sherman, A. T., ed-
itors (1983). Advances in Cryptology. Proc. of
CRYPTO’82. Plenum Press N.Y.
Desmedt, Y. (2022). Can we trust cloud voting? Poster
at Finanicial Cryptography 2022 (not in the proceed-
ings).
Desmedt, Y. and Erotokritou, S. (2015). Making code vot-
ing secure against insider threats using uncondition-
ally secure MIX schemes and human PSMT protocols.
In Vote ID, volume 9269 of Lecture Notes in Computer
Science. Springer.
Desmedt, Y. G. (1994). Threshold cryptography. European
Trans. on Telecommunications, 5(4):449–457. (In-
vited paper).
Estehghari, S. and Desmedt, Y. (2010). Exploiting the client
vulnerabilities in internet e-voting systems: Hacking
Helios 2.0 as an example. In 2010 Electronic Voting
Technology Workshop/Workshop on Trustworthy Elec-
tions (EVT/WOTE ’10), August 9–10, 2010.
Fadhel, A. B., Bianculli, D., and Briand, L. (2015). A com-
prehensive modeling framework for role-based access
control policies. Journal of Systems and Software.
Fiat, A. and Shamir, A. (1987). How to prove your-
self: Practical solutions to identification and signature
problems. In Odlyzko, A., editor, Advances in Cryp-
tology, Proc. of Crypto ’86 (Lecture Notes in Com-
puter Science 263), pages 186–194. Springer-Verlag.
Santa Barbara, California, U. S. A., August 11–15.
Goldreich, O., Micali, S., and Wigderson, A. (1991). Proofs
that yield nothing but their validity or all languages in
NP have zero-knowledge proof systems. Journal of
the ACM, 38(1):691–729.
Goldwasser, S., Micali, S., and Rackoff, C. (1989). The
knowledge complexity of interactive proof systems.
SIAM J. Comput., 18(1):186–208.
Jajodia, S., Samarati, P., Subrahmanian, V., and Bertino, E.
(1997). A unified framework for enforcing multiple
access control policies. In SIGMOD’97, pages 474–
485. Tucson, AZ.
Joshi, J. B., Bertino, E., Latif, U., and Ghafoor, A. (2005). A
generalized temporal role-based access control model.
Knowledge and Data Engineering, IEEE Transactions
on, 17(1):4–23.
Louw, M. T., Lim, J. S., and Venkatakrishnan, V. N. (2008).
Enhancing web browser security against malware ex-
tensions. J. Comput. Virol., 4(3):179–195.
Microsoft Teams (2022). Teams - live event / webinar -
hide participants. https://answers.microsoft.com/en-
us/msteams/forum/all/teams-live-event-webinar-
hide-participants/27a824d3-4488-47ac-8d33-
eb5c6bae02ad.
Oh, S. and Park, S. (2003). Task–role-based access control
model. Information systems, 28(6):533–562.
Park, C., Itoh, K., and Kurosawa, K. (1994). All/nothing
election scheme and anonymous channel. In Helle-
seth, T., editor, Advances in Cryptology — Eu-
rocrypt ’93, Proceedings (Lecture Notes in Com-
puter Science 765), pages 248–259. Springer-Verlag.
Lofthus, Norway, May, 1993.
Sako, K. and Kilian, J. (1994). Secure voting using partially
compatible homomorphisms. In Desmedt, Y. G., ed-
itor, Advances in Cryptology — Crypto ’94, Proceed-
ings (Lecture Notes in Computer Science 839), pages
411–424. Springer-Verlag. Santa Barbara, California,
U.S.A., August 22–25.
Sandhu, R., Ranganathan, K., and Zhang, X. (2006). Secure
information sharing enabled by trusted computing and
pei models. In Proceedings of the 2006 ACM Sympo-
sium on Information, computer and communications
security, pages 2–12. ACM.
Yao, A. C. (1986). How to generate and exchange secrets. In
27th Annual Symp. on Foundations of Computer Sci-
ence (FOCS), pages 162–167. IEEE Computer Soci-
ety Press. Toronto, Ontario, Canada, October 27–29,
1986.
SECRYPT 2022 - 19th International Conference on Security and Cryptography
442