Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Goel, Aarushi"'
Byzantine agreement (BA), the task of $n$ parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interestingly, in protocols with the best o
Externí odkaz:
http://arxiv.org/abs/2002.02516
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Goel, A, Hall-Andersen, M, Hegde, A & Jain, A 2022, Secure Multiparty Computation with Free Branching . in O Dunkelman & S Dziembowski (eds), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings . Springer, Lecture Notes in Computer Science (LNCS), vol. 13275, pp. 397-426, 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, Trondheim, Norway, 30/05/2022 . https://doi.org/10.1007/978-3-031-06944-4_14
We study secure multi-party computation (MPC) protocols for branching circuits that contain multiple sub-circuits (i.e., branches) and the output of the circuit is that of single “active” branch. Crucially, the identity of the active branch must
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::40e9ed78779124acd5654edc606108d4
https://pure.au.dk/portal/da/publications/secure-multiparty-computation-withfree-branching(e5364cd2-62ad-4d21-828d-1c1e7fca23a0).html
https://pure.au.dk/portal/da/publications/secure-multiparty-computation-withfree-branching(e5364cd2-62ad-4d21-828d-1c1e7fca23a0).html
Publikováno v:
Goel, A, Green, M, Hall-Andersen, M & Kaptchuk, G 2022, Stacking Sigmas : A Framework to Compose Σ-Protocols for Disjunctions . in O Dunkelman & S Dziembowski (eds), Advances in Cryptology – EUROCRYPT 2022 : 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings . Springer, Lecture Notes in Computer Science, vol. 13276, pp. 458-487, 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2022, Trondheim, Norway, 30/05/2022 . https://doi.org/10.1007/978-3-031-07085-3_16
Zero-Knowledge (ZK) Proofs for disjunctive statements have been a focus of a long line of research. Classical results such as Cramer et al. [CRYPTO’94] and Abe et al. [AC’02] design generic compilers that transform certain classes of ZK proofs in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::4a175ea082e6fa8ec30f411d1d6da678
https://pure.au.dk/portal/da/publications/stacking-sigmas(f5348a52-7e33-4ae2-a801-fba1140c903d).html
https://pure.au.dk/portal/da/publications/stacking-sigmas(f5348a52-7e33-4ae2-a801-fba1140c903d).html
Publikováno v:
Goel, A, Green, M, Hall-Andersen, M N & Kaptchuk, G 2022, ' Efficient Set Membership Proofs using MPC-in-the-Head ', Proceedings on Privacy Enhancing Technologies, vol. 2022, no. 2, pp. 304-324 . https://doi.org/10.2478/popets-2022-0047
Set membership proofs are an invaluable part of privacy preserving systems. These proofs allow a prover to demonstrate knowledge of a witness corresponding to a secret element x of a public set, such that they jointly satisfy a given NP relation, i.e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c2f95a0343d1857f8c70099365ad39a2
https://pure.au.dk/portal/da/publications/efficient-set-membership-proofs-using-mpcinthehead(74fffb41-6084-47bb-a6b9-03e282ba0aa4).html
https://pure.au.dk/portal/da/publications/efficient-set-membership-proofs-using-mpcinthehead(74fffb41-6084-47bb-a6b9-03e282ba0aa4).html
Publikováno v:
Hall-Andersen, M N, Goel, A, Green, M & Kaptchuk, G 2021, Set Membership using MPC-in-the-Head with Applications to Post-Quantum Ring-Signatures and Confidential Transactions . in Privacy Enhancing Technologies Symposium 2022 .
Set membership proofs are an invaluable part of privacy preserving systems. These proofs allow a prover to demonstrate knowledge of a witness w corresponding to a secret element x of a public set, such that they jointly satisfy a given NP relation, {
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::c11b607cb781582ddb1eb109593c1959
https://pure.au.dk/portal/da/publications/set-membership-using-mpcinthehead-with-applications-to-postquantum-ringsignatures-and-confidential-transactions(60082d61-5ea9-4a3e-9bfe-16ae7ea0d347).html
https://pure.au.dk/portal/da/publications/set-membership-using-mpcinthehead-with-applications-to-postquantum-ringsignatures-and-confidential-transactions(60082d61-5ea9-4a3e-9bfe-16ae7ea0d347).html
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Information Security & Cryptology - ICISC 2015; 2016, p119-135, 17p
Publikováno v:
Progress in Cryptology -- INDOCRYPT 2015; 2015, p198-217, 20p