Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Alexandra Boldyreva"'
Autor:
Alexandra Boldyreva, Tianxin Tang
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2021, Iss 4, Pp 549-574 (2021)
We study the problem of privacy-preserving approximate kNN search in an outsourced environment — the client sends the encrypted data to an untrusted server and later can perform secure approximate kNN search and updates. We design a security model
Publikováno v:
Journal of Cryptology. 34
Secure channel establishment protocols such as Transport Layer Security (TLS) are some of the most important cryptographic protocols, enabling the encryption of Internet traffic. Reducing latency (the number of interactions between parties before enc
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842512
CRYPTO (3)
CRYPTO (3)
We carry out the first provable security analysis of the new FIDO2 protocols, the promising FIDO Alliance’s proposal for a standard for passwordless user authentication. Our analysis covers the core components of FIDO2: the W3C’s Web Authenticati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0582515898ed26edb2be7a5fa45e4adb
https://doi.org/10.1007/978-3-030-84252-9_5
https://doi.org/10.1007/978-3-030-84252-9_5
The two-volume proceedings set LNCS 13940 and 13941 constitutes the refereed proceedings of the 26th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2023, which took place in March 2023 in Atlanta, GA, USA.The 49
Autor:
Lyubov A. Frolova, Pavel A. Troshin, Mohamed Elnaggar, Azat F. Akbulatov, Keith J. Stevenson, Sergey Tsarev, Moneim Elshobaki, Alexandra Boldyreva, Olga R. Yamilova
Publikováno v:
Proceedings of the 11th International Conference on Hybrid and Organic Photovoltaics.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030299583
ESORICS (1)
ESORICS (1)
Secure channel establishment protocols such as TLS are some of the most important cryptographic protocols, enabling the encryption of Internet traffic. Reducing the latency (the number of interactions between parties) in such protocols has become an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::068c9446d7a481b15ad6d272c5f3cc9a
https://doi.org/10.1007/978-3-030-29959-0_20
https://doi.org/10.1007/978-3-030-29959-0_20
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783030215675
ACNS
ACNS
We introduce and study the notion of keyless fuzzy search (KlFS) which allows to mask a publicly available database in such a way that any third party can retrieve content if and only if it possesses some data that is “close to” the encrypted dat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5655c6fde98c03eaac12255906d9763e
https://doi.org/10.1007/978-3-030-21568-2_28
https://doi.org/10.1007/978-3-030-21568-2_28
The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers present
Autor:
Hovav Shacham, Alexandra Boldyreva
The three volume-set, LNCS 10991, LNCS 10992, and LNCS 10993, constitutes the refereed proceedings of the 38th Annual International Cryptology Conference, CRYPTO 2018, held in Santa Barbara, CA, USA, in August 2018. The 79 revised full papers present
Publikováno v:
CSF
CSF 2017-30th IEEE Computer Security Foundations Symposium
CSF 2017-30th IEEE Computer Security Foundations Symposium, Aug 2017, Santa Barbara, CA, United States. pp.159-175, ⟨10.1109/CSF.2017.31⟩
CSF 2017-30th IEEE Computer Security Foundations Symposium
CSF 2017-30th IEEE Computer Security Foundations Symposium, Aug 2017, Santa Barbara, CA, United States. pp.159-175, ⟨10.1109/CSF.2017.31⟩
International audience; We propose the first user authentication and key exchange protocols that can tolerate strong corruptions on the client-side. If a user happens to log in to a server from a terminal that has been fully compromised, then the oth