Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jorge Luis Villar

dblp:v/JorgesLuisVillar · also Jorge L. Villar, Jorge Luis Villar Santos · DBLP profile ↗
← Back
16ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0003-1607-3792ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 12 · 1 first-authorTheory of computation · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptographic assumptions
diffie-hellman assumption
0.732017
An Algebraic Framework for Diffie-Hellman Assumptions · J. Cryptol. 2017
The Kernel Matrix Diffie-Hellman Assumption · ASIACRYPT (1) 2016
An Algebraic Framework for Diffie-Hellman Assumptions · CRYPTO (2) 2013
Cryptographic primitives and cryptanalysis
cryptographic assumptions
0.422016
The Kernel Matrix Diffie-Hellman Assumption · ASIACRYPT (1) 2016
Optimal Reductions of Some Decisional Problems to the Rank Problem · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis › provable security
search-to-decision reductions
0.112012
Optimal Reductions of Some Decisional Problems to the Rank Problem · ASIACRYPT 2012
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
chosen-ciphertext security
0.112006
Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption · ASIACRYPT 2006
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
factoring-based encryption
0.112006
Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption · ASIACRYPT 2006
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption
0.112006
Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption · ASIACRYPT 2006
YearPublicationVenuePosition
2017 An Algebraic Framework for Diffie-Hellman Assumptions
Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge Luis Villar
J. Cryptol.5
2016 The Kernel Matrix Diffie-Hellman Assumption
Paz Morillo, Carla Ràfols, Jorge Luis Villar
ASIACRYPT (1)3
2014 Cryptanalysis of a key exchange scheme based on block matrices
María Isabel González Vasco, Angel L. Pérez del Pozo, Pedro Taborda Duarte, Jorge Luis Villar
Inf. Sci.4
2013 An Algebraic Framework for Diffie-Hellman Assumptions
Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge Luis Villar
CRYPTO (2)5
2012 Optimal Reductions of Some Decisional Problems to the Rank Problem
Jorge Luis Villar
ASIACRYPT1
2012 Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience
David Galindo, Javier Herranz, Jorge Luis Villar
ESORICS3
2010 Anonymous Subscription Schemes - A Flexible Construction for On-line Services Access
María Isabel González Vasco, Somayeh Heidarvand, Jorge Luis Villar
SECRYPT3
2009 On proper secrets, ( t , k )-bases and linear codes
Tamir Tassa, Jorge Luis Villar
Des. Codes Cryptogr.2
2006 Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
Pascal Paillier, Jorge Luis Villar
ASIACRYPT2
2005 A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes
María Isabel González Vasco, Consuelo Martínez, Rainer Steinwandt, Jorge Luis Villar
TCC4
2004 An Unbalanced Protocol for Group Key Exchange
Javier Herranz, Jorge Luis Villar
TrustBus2
2003 Easy Verifiable Primitives and Practical Public Key Cryptosystems
David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar
ISC4
2003 An IND-CPA cryptosystem from Demytko's primitive
abstract
An encryption scheme should satisfy semantic security or indistinguishability of encryptions against chosen plaintext attack (IND-CPA). We propose an elliptic curve scheme over the ring /spl Zopf/(n/sup 2/), which is efficient and semantically secure in the standard model. It is based on factoring, and it has expansion factor 2 (previous schemes with these features present expansion factors greater than or equal to 4). Demytko's primitive has been used to obtain efficiency and probabilistic encryption. Semantic security of this scheme is based on a new decisional assumption, namely, the decisional small root assumption. Confidence in this assumption is also discussed.
David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar
ITW4
1999 Detection of Cheaters in Vector Space Secret Sharing Schemes
Carles Padró, Germán Sáez, Jorge Luis Villar
Des. Codes Cryptogr.3
1999 Weighted Threshold Secret Sharing Schemes
Paz Morillo, Carles Padró, Germán Sáez, Jorge Luis Villar
Inf. Process. Lett.4
1992 The Underlying Graph of a Line Digraph
Jorge Luis Villar
Discret. Appl. Math.1