Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sanjay Bhattacherjee"'
Autor:
Sanjay Bhattacherjee, Palash Sarkar
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031263682
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81a7ec1a223fe51b0993b657fec7df11
https://doi.org/10.1007/978-3-031-26369-9_15
https://doi.org/10.1007/978-3-031-26369-9_15
Autor:
Sanjay Bhattacherjee, Palash Sarkar
Publikováno v:
International Journal of Game Theory. 50:279-295
The Goods and Services Tax (GST) Council of India has a non-conventional weighted voting procedure having a primary player who is a blocker and a set of secondary players. The voting weights are not fixed and are determined based on the subset of pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ede2a758e54e6cc6ad3d8876ad58405d
https://doi.org/10.1007/s00182-020-00751-z
https://doi.org/10.1007/s00182-020-00751-z
Autor:
Sanjay Bhattacherjee, Palash Sarkar
Publikováno v:
Deprivation, Inequality and Polarization ISBN: 9789811379437
In a weighted majority voting game, the weights of the players are determined based on some socio-economic parameter. A number of measures have been proposed to measure the voting powers of the different players. A basic question in this area is to w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7488b9dc823857b4a417d08c23d3aef4
https://doi.org/10.1007/978-981-13-7944-4_9
https://doi.org/10.1007/978-981-13-7944-4_9
Publikováno v:
CCS
We provide efficient constructions for trace-and-revoke systems with public traceability in the black-box confirmation model. Our constructions achieve adaptive security, are based on standard assumptions and achieve significant efficiency gains comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9116ad796431d02f5011d91eae1c3df2
https://doi.org/10.1145/3133956.3134041
https://doi.org/10.1145/3133956.3134041
Publikováno v:
HAL
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS'2017
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS'2017, Oct 2017, Dallas, United States
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS'2017
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS'2017, Oct 2017, Dallas, United States
We provide efficient constructions for trace-and-revoke systems with public traceability in the black-box confirmation model. Our constructions achieve adaptive security, are based on standard assumptions and achieve significant efficiency gains comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ca64c730c494bdfa29d0d09127f24963
https://kar.kent.ac.uk/83284/1/3.pdf
https://kar.kent.ac.uk/83284/1/3.pdf
Autor:
Sanjay Bhattacherjee, Palash Sarkar
The most influential broadcast encryption (BE) scheme till date was introduced in 2001 by Naor, Naor and Lotspiech (NNL) and is based on binary trees. This paper generalizes the ideas of NNL to obtain BE schemes based on k-ary trees for any k ? 2 . T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c941b9571e9298246c88fb20c5d63c43
https://kar.kent.ac.uk/83842/1/JDA.pdf
https://kar.kent.ac.uk/83842/1/JDA.pdf
Autor:
Sanjay Bhattacherjee, Palash Sarkar
Publikováno v:
IEEE Transactions on Computers
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2015
IEEE Transactions on Computers, 2015, 65 (8), pp.2575-2587. ⟨10.1109/TC.2015.2485231⟩
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2015
IEEE Transactions on Computers, 2015, 65 (8), pp.2575-2587. ⟨10.1109/TC.2015.2485231⟩
In Broadcast Encryption (BE) systems like Pay-TV, AACS, online content sharing and broadcasting, reducing the header length (communication overhead per session) is of practical interest. The Subset Difference (SD) scheme due to Naor-Naor-Lotspiech (N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db67eb8c69d93397b29362b7a0f78fb5
https://hal.archives-ouvertes.fr/hal-01241138
https://hal.archives-ouvertes.fr/hal-01241138
Autor:
Sanjay Bhattacherjee, Palash Sarkar
Two key parameters of broadcast encryption (BE) schemes are the transmission size and the user storage. Naor-Naor-Lotspiech (2001) introduced the subset difference (SD) scheme achieving a good trade-off between these two parameters. Halevy-Shamir (20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e72da24686a2e46bfb2f2769f57939d
https://kar.kent.ac.uk/83282/1/7818.pdf
https://kar.kent.ac.uk/83282/1/7818.pdf
Autor:
Sanjay Bhattacherjee, Palash Sarkar
The Subset Difference (SD) method proposed by Naor, Naor and Lotspiech is the most popular broadcast encryption (BE) scheme. It is suitable for real-time applications like Pay-TV and has been suggested for use by the AACS standard for digital rights
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::439d1140890e1ad68a71b0973250ce2d
https://kar.kent.ac.uk/93930/1/DCC.pdf
https://kar.kent.ac.uk/93930/1/DCC.pdf