Oriol Farràs

Orcid: 0000-0002-7495-5980

According to our database1, Oriol Farràs authored at least 48 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hardware Acceleration for High-Volume Operations of CRYSTALS-Kyber and CRYSTALS-Dilithium.
ACM Trans. Reconfigurable Technol. Syst., September, 2024

One-Out-of-q OT Combiners.
IEEE Trans. Inf. Theory, April, 2024

Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation.
IACR Cryptol. ePrint Arch., 2024

Secret-Sharing Schemes for High Slices.
IACR Cryptol. ePrint Arch., 2024

Optimizing Extension Techniques for Discovering Non-Algebraic Matroids.
CoRR, 2024

Secret-Sharing Schemes for High Slices.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

A Safety-Critical, RISC-V SoC Integrated and ASIC-Ready Classic McEliece Accelerator.
Proceedings of the Applied Reconfigurable Computing. Architectures, Tools, and Applications, 2024

2023
Improved Polynomial Secret-Sharing Schemes.
IACR Cryptol. ePrint Arch., 2023

2022
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures.
IEEE Trans. Inf. Theory, 2022

A Security Model for Randomization-based Protected Caches.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022

2021
Privacy-preserving data splitting: a combinatorial approach.
Des. Codes Cryptogr., 2021

Common information, matroid representation, and secret sharing for matroid ports.
Des. Codes Cryptogr., 2021

HLS-Based HW/SW Co-Design of the Post-Quantum Classic McEliece Cryptosystem.
Proceedings of the 31st International Conference on Field-Programmable Logic and Applications, 2021

2020
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing.
IEEE Trans. Inf. Theory, 2020

Secret sharing schemes for ports of matroids of rank 3.
Kybernetika, 2020

The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.
IACR Cryptol. ePrint Arch., 2020

2019
Provably secure public-key encryption with conjunctive and subset keyword search.
Int. J. Inf. Sec., 2019

Secret-Sharing Schemes for General and Uniform Access Structures.
IACR Cryptol. ePrint Arch., 2019

Local bounds for the optimal information ratio of secret sharing schemes.
Des. Codes Cryptogr., 2019

Privacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges.
Comput. Commun., 2019

2017
Resource-efficient OT combiners with active security.
IACR Cryptol. ePrint Arch., 2017

On the Information Ratio of Non-perfect Secret Sharing Schemes.
Algorithmica, 2017

Private Outsourced Kriging Interpolation.
Proceedings of the Financial Cryptography and Data Security, 2017

2016
Contributory Broadcast Encryption with Efficient Encryption and Short Ciphertexts.
IEEE Trans. Computers, 2016

Secret-Sharing Schemes for Very Dense Graphs.
J. Cryptol., 2016

Self-enforcing protocols via co-utile reputation management.
Inf. Sci., 2016

A Note on Non-Perfect Secret Sharing.
IACR Cryptol. ePrint Arch., 2016

Bounds on the Information Ratios of Secret Sharing Schemes for Close Access Structures.
IACR Cryptol. ePrint Arch., 2016

Secret Sharing Schemes for Dense Forbidden Graphs.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Searchable encryption for geo-referenced data.
Proceedings of the 2016 Mediterranean Ad Hoc Networking Workshop, 2016

Recent Advances in Non-perfect Secret Sharing Schemes.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Extending Brickell-Davenport theorem to non-perfect secret sharing schemes.
Des. Codes Cryptogr., 2015

2014
Natural Generalizations of Threshold Secret Sharing.
IEEE Trans. Inf. Theory, 2014

Optimal Non-Perfect Uniform Secret Sharing Schemes.
IACR Cryptol. ePrint Arch., 2014

Erratum to: Linear spaces and transversal designs: $$k$$ -anonymous combinatorial configurations for anonymous database search.
Des. Codes Cryptogr., 2014

Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes.
Des. Codes Cryptogr., 2014

Generalization-based privacy preservation and discrimination prevention in data publishing and mining.
Data Min. Knowl. Discov., 2014

Distance Computation between Two Private Preference Functions.
Proceedings of the ICT Systems Security and Privacy Protection, 2014

2013
Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes.
Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2013

2012
Ideal Hierarchical Secret Sharing Schemes.
IEEE Trans. Inf. Theory, 2012

Ideal Multipartite Secret Sharing Schemes.
J. Cryptol., 2012

Provably secure threshold public-key encryption with adaptive security and short ciphertexts.
Inf. Sci., 2012

Linear threshold multisecret sharing schemes.
Inf. Process. Lett., 2012

On the optimization of bipartite secret sharing schemes.
Des. Codes Cryptogr., 2012

Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search
CoRR, 2012

2011
TTP SmartCard-Based ElGamal Cryptosystem Using Threshold Scheme for Electronic Elections.
Proceedings of the Foundations and Practice of Security, 2011

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

Bridging Broadcast Encryption and Group Key Agreement.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011


  Loading...