Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Souradyuti Paul"'
Autor:
Suyash Kandele, Souradyuti Paul
Publikováno v:
IACR Transactions on Symmetric Cryptology, Vol 2018, Iss 4 (2018)
The Key Assignment Scheme (KAS) is a well-studied cryptographic primitive used for hierarchical access control (HAC) in a multilevel organisation where the classes of people with higher privileges can access files of those with lower ones. Our first
Externí odkaz:
https://doaj.org/article/46065601d3a54d869add4a3a279b1f88
Publikováno v:
Proceedings of the 24th International Conference on Distributed Computing and Networking.
Publikováno v:
2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS).
Autor:
Ananya Shrivastava, Souradyuti Paul
Publikováno v:
Progress in Cryptology – LATINCRYPT 2019 ISBN: 9783030305291
LATINCRYPT
LATINCRYPT
In ACM CCS’17, Choudhuri et al. designed two fair public-ledger-based multi-party protocols (in the malicious model with dishonest majority) for computing an arbitrary function f. One of their protocols is based on a trusted hardware enclave \(\mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a040016aec2c25d5db1258cdc41fc7ee
https://doi.org/10.1007/978-3-030-30530-7_15
https://doi.org/10.1007/978-3-030-30530-7_15
Publikováno v:
Journal of Mathematical Cryptology, Vol 10, Iss 2, Pp 101-133 (2016)
A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them as random functions. To elim
Autor:
Sudhakar Kumawat, Souradyuti Paul
Publikováno v:
Information Security and Cryptology ISBN: 9783319751597
Inscrypt
Inscrypt
Accountable ring signature (ARS), introduced by Xu and Yung (CARDIS 2004), combines many useful properties of ring and group signatures. In particular, the signer in an ARS scheme has the flexibility of choosing an ad hoc group of users, and signing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e86a399198028ae957a34adad0cd8107
https://doi.org/10.1007/978-3-319-75160-3_11
https://doi.org/10.1007/978-3-319-75160-3_11
Autor:
Ananya Shrivastava, Souradyuti Paul
Publikováno v:
Information Security and Privacy ISBN: 9783319936376
ACISP
ACISP
In Eurocrypt 2016, Kiayias, Zhou and Zikas (KZZ) have designed a multiparty protocol for computing an arbitrary function, which they prove to be secure in the malicious model with identifiable abort supporting robustness property. In their algorithm,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a537e8921c8edfa7532ca604d39067c
https://doi.org/10.1007/978-3-319-93638-3_8
https://doi.org/10.1007/978-3-319-93638-3_8
Autor:
Souradyuti Paul, Suyash Kandele
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783319933863
ACNS
ACNS
Message-locked encryption (MLE) (formalized by Bellare et al. [5]) is an important cryptographic primitive that supports deduplication in the cloud. Updatable block-level message-locked encryption (UMLE) (formalized by Zhao and Chow [13]) adds the up
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cde09057aa0a145aa0ecffbd5ea88da
https://doi.org/10.1007/978-3-319-93387-0_35
https://doi.org/10.1007/978-3-319-93387-0_35
Autor:
Indra Deep Mastan, Souradyuti Paul
Publikováno v:
Cryptology and Network Security ISBN: 9783030026400
CANS
CANS
Mounting deanonymization attacks on the unreachable Bitcoin nodes – these nodes do not accept incoming connections – residing behind the NAT is a challenging task. Such an attack was first given by Biryukov, Khovratovich and Pustogarov based on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e348ea5cc338c230fd29c5d22d54ffb
https://doi.org/10.1007/978-3-030-02641-7_13
https://doi.org/10.1007/978-3-030-02641-7_13
Publikováno v:
IndraStra Global.
Indifferentiability security of a hash mode of operation guarantees the mode's resistance against all generic attacks. It is also useful to establish the security of protocols that use hash functions as random functions. The JH hash function was one