Oriol Farrŕs
Oriol Farrŕs
Geverifieerd e-mailadres voor urv.cat - Homepage
Geciteerd door
Geciteerd door
Ideal multipartite secret sharing schemes
O Farrŕs, J Martí-Farré, C Padró
Journal of cryptology 25 (3), 434-463, 2012
Ideal hierarchical secret sharing schemes
O Farras, C Padro
IEEE Transactions on Information Theory 58 (5), 3273-3286, 2012
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts
Q Wu, B Qin, L Zhang, J Domingo-Ferrer, O Farras, JA Manjon
IEEE Transactions on Computers 65 (2), 466-479, 2016
Generalization-based privacy preservation and discrimination prevention in data publishing and mining
S Hajian, J Domingo-Ferrer, O Farrŕs
Data Mining and Knowledge Discovery 28 (5), 1158-1188, 2014
Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges
J Domingo-Ferrer, O Farras, J Ribes-González, D Sánchez
Computer Communications 140, 38-60, 2019
On the information ratio of non-perfect secret sharing schemes
O Farras, TB Hansen, T Kaced, C Padró
Algorithmica 79 (4), 987-1013, 2017
Secret-Sharing Schemes for Very Dense Graphs
A Beimel, O Farrŕs, Y Mintz
Journal of Cryptology 29 (2), 336-362, 2016
Natural generalizations of threshold secret sharing
O Farras, C Padró, C Xing, A Yang
IEEE transactions on information theory 60 (3), 1652-1664, 2014
On the optimization of bipartite secret sharing schemes
O Farrŕs, JR Metcalf-Burton, C Padró, L Vázquez
Designs, Codes and Cryptography 63 (2), 255-271, 2012
Self-enforcing protocols via co-utile reputation management
J Domingo-Ferrer, O Farras, S Martínez, D Sánchez, J Soria-Comas
Information Sciences 367, 159-175, 2016
Linear secret-sharing schemes for forbidden graph access structures
A Beimel, O Farrŕs, Y Mintz, N Peter
Theory of Cryptography Conference, 394-423, 2017
Improving the linear programming technique in the search for lower bounds in secret sharing
O Farrŕs, T Kaced, S Martín, C Padro
IEEE Transactions on Information Theory 66 (11), 7088-7100, 2020
Secret-sharing schemes for general and uniform access structures
B Applebaum, A Beimel, O Farrŕs, O Nir, N Peter
Annual International Conference on the Theory and Applications of …, 2019
Provably secure threshold public-key encryption with adaptive security and short ciphertexts
B Qin, Q Wu, L Zhang, O Farrŕs, J Domingo-Ferrer
Information Sciences 210, 67-80, 2012
Secret sharing schemes for dense forbidden graphs
A Beimel, O Farrŕs, N Peter
International Conference on Security and Cryptography for Networks, 509-528, 2016
Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes
K Stokes, O Farrŕs
Designs, codes and cryptography 71 (3), 503-524, 2014
Extending Brickell–Davenport theorem to non-perfect secret sharing schemes
O Farras, C Padró
Designs, Codes and Cryptography 74 (2), 495-510, 2015
Provably secure public-key encryption with conjunctive and subset keyword search
O Farrŕs, J Ribes-González
International Journal of Information Security 18 (5), 533-548, 2019
Distance computation between two private preference functions
A Blanco, J Domingo-Ferrer, O Farras, D Sánchez
IFIP International Information Security Conference, 460-470, 2014
Linear threshold multisecret sharing schemes
O Farrŕs, I Gracia, S Martín, C Padró
Information Processing Letters 112 (17-18), 667-673, 2012
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20