274 research outputs found
Entre dos mundos: Jaime Ferran
Jaime Ferran, poet of the Generation of 50 and author of the Anthology Part, bringing together poets of the so-called School of Barcelona, is an author semidesconocido reader to the general public and even to most specialists poetry 50. a number of vital and literary circumstances, largely explain this almost forgotten where he has been the work of the poet of Cervera. Notable among them are the fact of having written most of his work outside of Spain. His professional life in Syracuse, USA, led him to build a work outside the concerns of their classmates and also regardless of the prevailing poetic fashions in Spain especially during the decades of the sixties and seventies. In this biographical fact we should add other life and literary adventures that have made Jaime Ferran a kind of outsider.Jaime Ferran, poeta de la Generación de los 50 y autor de la Antología Parcial, que reúne a los poetas de la llamada Escuela de Barcelona, es un autor semidesconocido para el gran público lector e, incluso, para la mayoría de los especialistas en la poesía de los 50. Hay una serie de circunstancias vitales y literarias que, en buena parte, explican este casi olvido en el que ha quedado la obra del poeta de Cervera. Entre ellas cabe destacar el hecho de haber escrito casi toda su obra fuera de España. Su vida profesional en Syracuse, EE.UU, lo llevó a construir una obra al margen de las inquietudes de sus compañeros de promoción y al margen también de las modas poéticas imperantes en España durante, sobre todo, las décadas de los sesenta y los setenta. A este hecho biográfico habría que añadir otras peripecias vitales y literarias que han hecho de Jaime Ferran una especie de outsider
Entre dos mundos : Jaime Ferran
Jaime Ferran, poeta de la Generación de los 50 y autor de la Antología Parcial, que reúne a los poetas de la llamada Escuela de Barcelona, es un autor semidesconocido para el gran público lector e, incluso, para la mayoría de los especialistas en la poesía de los 50. Hay una serie de circunstancias vitales y literarias que, en buena parte, explican este casi olvido en el que ha quedado la obra del poeta de Cervera. Entre ellas cabe destacar el hecho de haber escrito casi toda su obra fuera de España. Su vida profesional en Syracuse, EE.UU, lo llevó a construir una obra al margen de las inquietudes de sus compañeros de promoción y al margen también de las modas poéticas imperantes en España durante, sobre todo, las décadas de los sesenta y los setenta. A este hecho biográfico habría que añadir otras peripecias vitales y literarias que han hecho de Jaime Ferran una especie de outsider.Jaime Ferran, poet of the Generation of 50 and author of the Anthology Part, bringing together poets of the so-called School of Barcelona, is an author semidesconocido reader to the general public and even to most specialists poetry 50. A number of vital and literary circumstances, largely explain this almost forgotten where he has been the work of the poet of Cervera. Notable among them are the fact of having written most of his work outside of Spain. His professional life in Syracuse, USA, led him to build a work outside the concerns of their classmates and also regardless of the prevailing poetic fashions in Spain especially during the decades of the sixties and seventies. In this biographical fact we should add other life and literary adventures that have made Jaime Ferran a kind of outsider
Simulation Secure Multi-Input Quadratic Functional Encryption: Applications to Differential Privacy
Multi-input functional encryption is a primitive that allows for the evaluation of an -ary function over multiple ciphertexts, without learning any information about the underlying plaintexts. This type of computation is useful in many cases where one has to compute over encrypted data, such as privacy-preserving cloud services, federated learning, or more generally delegation of computation from multiple clients. It has recently been shown by Alborch et al. in PETS \u2724 to be useful to construct a randomized functional encryption scheme for obtaining differentially private data analysis over an encrypted database supporting linear queries.
In this work we propose the first secret-key multi-input quadratic functional encryption scheme satisfying simulation security. Current constructions supporting quadratic functionalities, proposed by Agrawal et al. in CRYPTO \u2721 and TCC \u2722, only reach indistinguishibility-based security. Our proposed construction is generic, and for a concrete instantiation, we propose a new function-hiding inner-product functional encryption scheme proven simulation secure against one challenge ciphertext in the standard model, which is of independent interest. We then use these two results to construct an efficient randomized quadratic functional encryption scheme, from which we obtain differentially private data analysis over an encrypted database supporting quadratic queries. Finally, we give and fully benchmark an implementation of the randomized scheme. This work is an extended version of the paper Simulation Secure Multi-Input Quadratic Functional Encryption at SAC \u2724, where the multi-input quadratic functional encryption scheme and function-hiding inner-product functional encryption schemes were first presented (Section 3 and Seciton 4)
"Stovertop Philospohy" An interview with Ferran Adrià
This text is a result of two long conversations between Ferran Adrià and Jèssica Jaques at elBulliLab, the creativity laboratory directed by the Catalan cook, in January, 2016. It has been translated from Catalan by Tiam Goudarzi under the supervision of the author
Ferran Soldevila i la Revista de Catalunya (1924-1939)
Estudi de l'activitat professional de Ferran Soldevila a la Revista de Catalunya, com a director de la publicació i com a responsable de valuosos articles
sobre la història de Catalunya en el període que va de 1924, any de la fundació, a 1939, final de la Guerra Civil.Study of Ferran Soldevilas work for the Revista de Catalunya, both as the publications director and as the author of valuable articles on the history of
Catalonia in the period ranging from 1924, the year it was founded, to 1939, the end of the Civil War
Biblical Intertextuality in Ferran de Pol
The main objective of this article is to offer an intertextual study of the presence of the Bible in the work of Ferran de Pol. Intertextuality is understood as the relationship that exists between two or more texts when we can identify in one of them more or less explicit phrases taken from others, in this case from the Bible. We do not analyse any religious intention of the author, but we note that the Bible was undoubtedly one of his formative books. We find the greatest biblical presence in his novels Érem quatre (‘We Were Four’, 1960), Miralls tèrbols (‘Cloudy Mirrors’, 1966) and the unpublished Ella, jo i el càntic (She, I and the Song, 1987). Ferran de Pol’s rewriting of the Bible has multiple and heterogeneous functions: in some cases it acts as the central axis of a specific work, in others it has compositional, rhetorical, satirical, conceptual or parodic functions
Ferran de Pol, un escriptor-traductor del segle XX
Ferran de Pol (Arenys de Mar 1911-1994) fue uno de los traductores-escritores que comenzó su obra en la Cataluña republicana. Los primeros textos traducidos al catalán fueron de E.T.A. Hoffmann. Autor de una destacable obra narrativa, estuvo en el exilio en Méjico de 1939 a 1948, donde trabajó de peirodista i tradujo novelas al español para la editorial Albatros. Desde su retorno a Cataluña tradujo diferentes novelas al castellano y al catalán, entre las que destacan El viejo y el mar de Ernest Hemingway. Además, tradujo junto con su mujer, la escritora galesa Esylit T. Lawrence, una obra de teatro de Saunders Lewis. Palabras clave: Ferran de Pol; exilo mejicano; traductor/escritor; literatura catalana; traducción catalán/español.Ferran de Pol (Arenys de Mar 1911-1994) was one of the writers-translators who started writing during the Catalonian Republic. The first text he translated into Catalan was a story by E.T.A. Hoffmann. Ferran de Pol authored important fictional titles and he was an exile in Mexico from 1939 to 1948, where he worked as a journalist and translated several novels into Spanish for the publishing house Albatros. At his return to Catalonia he translated into Catalan and Spanish several more novels, Ernest Hemingway’s The Old Man and the Sea among some others. Together with his wife, Esyllt T. Lawrence he translated a play by Welsh author Saunders Lewis. Keywords: Ferran de Pol; Mexican exile; writer/translator; Catalan literature; Catalan/Spanish translation
RLWE-based distributed key generation and threshold decryption
Ever since the appearance of quantum computers, prime factoring and discrete logarithm based cryptography has been put in question, giving birth to the so called post-quantum cryptography. The most prominent field in post-quantum cryptography is lattice-based cryptography, protocols that are proved to be as difficult to break as certain difficult lattice problems like Learning With Errors (LWE) or Ring Learning With Errors (R-LWE). This Master s Degree Thesis forwards and elevates the work done in the Bachelor s Degree Thesis "Lattice-based Threshold Cryptography" by taking the R-LWE-based protocols specified there and giving more accurate and improved proofs of correctness and security, developing an original proposal for dispute resolution throughout both protocols, making an analysis of the specific hardness of breaking security of the protocol and analyzing a given implementation of both protocols in C
Lattice-based threshold cryptography
Ever since the appearance of quantum computers, prime factoring and discrete logarithm based cryptography has been put in question, giving birth to the so called post-quantum cryptography. The goal of this bachelor's degree thesis is to develop a post-quantum threshold cryptosystem, in particular based on Ring Learning with Errors, a lattice-based problem
Analyse Confidentielle de Données sur Bases de Données Chiffrées : Mélange de Chiffrement Fonctionnel et Confidentialité Différentielle Calculatoire
In our current digitalized society, data is ruling the world. But as it is most of the time related to individuals, its exploitation should respect the privacy of the latter. This issue has raised the differential privacy paradigm, which permits to protect individuals when querying databases containing data about them. But with the emergence of cloud computing, it is becoming increasingly necessary to also consider the confidentiality of "on-cloud'' storage confidentiality of such vast databases, using encryption techniques. This thesis studies how to provide both privacy and confidentiality of such outsourced databases by mixing two primitives: computational differential privacy and functional encryption. First, we study the relationship between computational differential privacy and functional encryption for randomized functions in a generic way. We analyze the privacy of the setting where a malicious analyst may access the encrypted data stored in a server, either by corrupting or breaching it, and prove that a secure randomized functional encryption scheme supporting the appropriate family of functions guarantees the computational differential privacy of the system. Second, we construct efficient randomized functional encryption schemes for certain useful families of functions, and we prove them secure in the standard model under well-known assumptions. The families of functions considered are linear functions, used for example in counting queries, histograms and linear regressions, and quadratic functions, used for example in quadratic regressions and hypothesis testing. The schemes built are then used together with the first result to construct encrypted databases for their corresponding family of queries. Finally, we implement both randomized functional encryption schemes to analyze their efficiency. This shows that our constructions are practical for databases with up to 1 000 000 entries in the case of linear queries and databases with up to 10 000 database entries in the case of quadratic queries.Dans l'actuelle société numérique, les données dominent le monde. Associées la plupart du temps à des individus, leur exploitation doit respecter la vie privée de ces derniers. Cette contrainte a donné naissance au paradigme de confidentialité différentielle, qui permet de protéger les individus lors de requêtes sur des bases contenant des données les concernant. Mais avec l'émergence du "cloud computing'', il devient nécessaire de prendre en compte la confidentialité du stockage de ces dernières dans le cloud, en utilisant du chiffrement. Cette thèse étudie comment assurer à la fois la confidentialité et le respect de la vie privée de ces bases de données externalisées en combinant deux primitives : la confidentialité différentielle calculatoire et le chiffrement fonctionnel. Dans un premier temps, nous étudions les liens entre la confidentialité différentielle calculatoire et le chiffrement fonctionnel pour des fonctions aléatoires d'un point de vue générique. Nous analysons la confidentialité dans un cadre où un analyste malicieux peut accéder aux données chiffrées stockés dans un serveur soit par corruption soit par brèche de sécurité, et nous prouvons qu'un schéma de chiffrement fonctionnel aléatoire sûr et pour la famille de fonctions appropriée garantie la confidentialité différentielle calculatoire du système. Dans second temps, nous construisons des schémas de chiffrement fonctionnel aléatoire pour certaines familles de fonctions utiles, et nous les prouvons sûrs dans le modèle standard sous des hypothèses très étudiées. Les familles de fonctions que nous étudions sont les fonctions linéaires, utilisées par exemple pour requêtes de comptage, des histogrammes et régressions linéaires, et les fonctions quadratiques, utilisées par exemple pour régressions quadratiques et tests d'hypothèses. Les schémas proposés sont utilisés avec le premier résultat pour construire des bases des données chiffrées pour fonctions linéaires et quadratiques respectivement. Finalement, nous implémentons les deux schémas de chiffrement fonctionnel pour analyser leur efficacité. Cela montre que nos constructions sont pratiques pour des bases de données avec 1 000 000 entrées pour des requêtes linéaires et des bases de données avec 10 000 entrées pour des requêtes quadratiques
- …
