Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Computational indistinguishability"'
The field of cryptographic protocol verification in the computational model aims at obtaining formal security proofs of protocols. To facilitate writing such proofs, which are complex and hard to automate, Bana and Comon have proposed the Computation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5734de1a7dbe62a9787e5bd481bf4e1a
https://hal.inria.fr/hal-03981949/document
https://hal.inria.fr/hal-03981949/document
Autor:
Yong Li, Chunsheng Gu, Mengshi Zhang, Guangquan Xu, Zhengjun Jing, Xi Zheng, Alireza Jolfaei, Peizhong Shi, Chenkai Tan
Publikováno v:
Computer Communications. 161:202-211
As a powerful cryptographic primitive, indistinguishable obfuscation has been widely used to protect data privacy on the Internet of Medical Things (IoMT) systems. Basically, the cryptographic technique protects data privacy using a function to obfus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87570fb087f57c5688bb78ebc33ba6b9
https://doi.org/10.1016/j.comcom.2020.07.033
https://doi.org/10.1016/j.comcom.2020.07.033
Publikováno v:
Theoretical Computer Science. 816:195-220
Differential privacy can achieve the tradeoff between privacy and utility by using privacy metric and utility metric. However, since privacy metric and utility metric may not be bounded, differential privacy can not provide the bounded tradeoff. More
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03f37ff54226e55e5e17c64ebba98acb
https://doi.org/10.1016/j.tcs.2020.02.004
https://doi.org/10.1016/j.tcs.2020.02.004
Autor:
Adrien Koutsos
Publikováno v:
ACM Transactions on Computational Logic
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (1), pp.1-44. ⟨10.1145/3423169⟩
CSF
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-44. ⟨10.1145/3423169⟩
ACM Transactions on Computational Logic, Association for Computing Machinery, 2021, 22 (1), pp.1-44. ⟨10.1145/3423169⟩
CSF
ACM Transactions on Computational Logic, 2021, 22 (1), pp.1-44. ⟨10.1145/3423169⟩
Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon’s approach [7, 8], axiomatizing what an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1dd0148b15179ba2c1f080fa0252e15
https://hal.archives-ouvertes.fr/hal-03469091/file/hal.pdf
https://hal.archives-ouvertes.fr/hal-03469091/file/hal.pdf
Publikováno v:
Algorithmica. 81:3245-3390
Constrained pseudorandom functions (CPRF) are an enriched variant of traditional pseudorandom functions (PRF)—a fundamental tool of modern cryptography. A CPRF enables a master PRF key holder to issue constrained keys corresponding to specific cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e29137e261cba926119ca8aba2a1ee6
https://doi.org/10.1007/s00453-019-00576-7
https://doi.org/10.1007/s00453-019-00576-7
Publikováno v:
2021 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus).
The issue of data security is one of the key issues of using homomorphic data encryption algorithms. In this article, we investigate the computational indistinguishability of the homomorphic encryption scheme BFV. We propose a scenario in which attac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c73e9d48f26b16b60d7607ce82e03e4
https://doi.org/10.1109/elconrus51938.2021.9396116
https://doi.org/10.1109/elconrus51938.2021.9396116
Publikováno v:
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Prediction algorithms assign numbers to individuals that are popularly understood as individual "probabilities" -- what is the probability of 5-year survival after cancer diagnosis? -- and which increasingly form the basis for life-altering decisions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f626495be610e9174a08e42948dc3188
Autor:
Marc Fischlin, Arno Mittelbach
Publikováno v:
Information Security and Cryptography ISBN: 9783030632861
In the previous chapter we began our study of hash function properties with the introduction of computational security and one-wayness. While one-way functions are at the core of computational security and modern cryptography, the security guarantees
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3738aca0aa4d3db18a94d60ba8c9aa9c
https://doi.org/10.1007/978-3-030-63287-8_3
https://doi.org/10.1007/978-3-030-63287-8_3
Autor:
Moldovyan Nikolay Andreevich, Lich Van Luu, Moldovyan Alexander Andreevich, Minh Hieu Nguyen, Tien Van Nguyen, Canh Ngoc Hoang, Manh Cong Tran, Tan Sy Ho
Publikováno v:
ACOMP
To ensure resistance to attacks with coercion to disclose a secret key by an active adversary, the protocol of deniable encryption includes a procedure for mutual authentication of the sender and receiver of a message with their long-term public keys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0937f8fba1d8f8b2789bc88b1a70536
https://doi.org/10.1109/acomp50827.2020.00008
https://doi.org/10.1109/acomp50827.2020.00008
Publikováno v:
SAC
Securing applications on untrusted platforms can involve protection against legitimate end-users who act in the role of malicious reverse engineers and hackers. Such adversaries have access to the full execution environment of programs, whether the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1ccf36e7ce4e8b0879e1c13e7c24392
https://doi.org/10.1145/3341105.3374031
https://doi.org/10.1145/3341105.3374031