Browsing Complete repository Arts & humanities   Archaeology   Art & art history   Classical & oriental studies   History   Languages & linguistics   Literature   Performing arts   Philosophy & ethics   Religion & theology   Multidisciplinary, general & others Business & economic sciences   Accounting & auditing   Production, distribution & supply chain management   Finance   General management & organizational theory   Human resources management   Management information systems   Marketing   Strategy & innovation   Quantitative methods in economics & management   General economics & history of economic thought   International economics   Macroeconomics & monetary economics   Microeconomics   Economic systems & public economics   Social economics   Special economic topics (health, labor, transportation…)   Multidisciplinary, general & others Engineering, computing & technology   Aerospace & aeronautics engineering   Architecture   Chemical engineering   Civil engineering   Computer science   Electrical & electronics engineering   Energy   Geological, petroleum & mining engineering   Materials science & engineering   Mechanical engineering   Multidisciplinary, general & others Human health sciences   Alternative medicine   Anesthesia & intensive care   Cardiovascular & respiratory systems   Dentistry & oral medicine   Dermatology   Endocrinology, metabolism & nutrition   Forensic medicine   Gastroenterology & hepatology   General & internal medicine   Geriatrics   Hematology   Immunology & infectious disease   Laboratory medicine & medical technology   Neurology   Oncology   Ophthalmology   Orthopedics, rehabilitation & sports medicine   Otolaryngology   Pediatrics   Pharmacy, pharmacology & toxicology   Psychiatry   Public health, health care sciences & services   Radiology, nuclear medicine & imaging   Reproductive medicine (gynecology, andrology, obstetrics)   Rheumatology   Surgery   Urology & nephrology   Multidisciplinary, general & others Law, criminology & political science   Civil law   Criminal law & procedure   Criminology   Economic & commercial law   European & international law   Judicial law   Metalaw, Roman law, history of law & comparative law   Political science, public administration & international relations   Public law   Social law   Tax law   Multidisciplinary, general & others Life sciences   Agriculture & agronomy   Anatomy (cytology, histology, embryology...) & physiology   Animal production & animal husbandry   Aquatic sciences & oceanology   Biochemistry, biophysics & molecular biology   Biotechnology   Entomology & pest control   Environmental sciences & ecology   Food science   Genetics & genetic processes   Microbiology   Phytobiology (plant sciences, forestry, mycology...)   Veterinary medicine & animal health   Zoology   Multidisciplinary, general & others Physical, chemical, mathematical & earth Sciences   Chemistry   Earth sciences & physical geography   Mathematics   Physics   Space science, astronomy & astrophysics   Multidisciplinary, general & others Social & behavioral sciences, psychology   Animal psychology, ethology & psychobiology   Anthropology   Communication & mass media   Education & instruction   Human geography & demography   Library & information sciences   Neurosciences & behavior   Regional & inter-regional studies   Social work & social policy   Sociology & social sciences   Social, industrial & organizational psychology   Theoretical & cognitive psychology   Treatment & clinical psychology   Multidisciplinary, general & others      by title 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z or enter first few letters:    OK Showing results 36861 to 36880 of 39724     1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849     UbiSettlers-A Dynamically Adapting Mobile P2P Multiplayer Game for Hybrid NetworksHiedels, Christian ; Hoff, Christian; Rothkugel, Steffen et alin Abstract book of 4th IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P 2007) (2007)Detailed reference viewed: 65 (1 UL) UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute TokensCamenisch, Jan; Dubovitskaya, Maria; Rial, Alfredo in Advances in Cryptology – CRYPTO 2016 (2016, August 14)Complex cryptographic protocols are often designed from simple cryptographic primitives, such as signature schemes, encryption schemes, verifiable random functions, and zero-knowledge proofs, by bridging ... [more ▼]Complex cryptographic protocols are often designed from simple cryptographic primitives, such as signature schemes, encryption schemes, verifiable random functions, and zero-knowledge proofs, by bridging between them with commitments to some of their inputs and outputs. Unfortunately, the known universally composable (UC) functionalities for commitments and the cryptographic primitives mentioned above do not allow such constructions of higher-level protocols as hybrid protocols. Therefore, protocol designers typically resort to primitives with property-based definitions, often resulting in complex monolithic security proofs that are prone to mistakes and hard to verify. We address this gap by presenting a UC functionality for non-interactive commitments that enables modular constructions of complex protocols within the UC framework. We also show how the new functionality can be used to construct hybrid protocols that combine different UC functionalities and use commitments to ensure that the same inputs are provided to different functionalities. We further provide UC functionalities for attribute tokens and revocation that can be used as building blocks together with our UC commitments. As an example of building a complex system from these new UC building blocks, we provide a construction (a hybrid protocol) of anonymous attribute tokens with revocation. Unlike existing accumulator-based schemes, our scheme allows one to accumulate several revocation lists into a single commitment value and to hide the revocation status of a user from other users and verifiers. [less ▲]Detailed reference viewed: 122 (12 UL) UC Priced Oblivious Transfer with Purchase Statistics and Dynamic PricingDamodaran, Aditya Shyam Shankar ; Dubovitskaya, Maria; Rial, Alfredo in Progress in Cryptology – INDOCRYPT 2019 (2019, December)Priced oblivious transfer (POT) is a cryptographic protocol that can be used to protect customer privacy in e-commerce applications. Namely, it allows a buyer to purchase an item from a seller without ... [more ▼]Priced oblivious transfer (POT) is a cryptographic protocol that can be used to protect customer privacy in e-commerce applications. Namely, it allows a buyer to purchase an item from a seller without disclosing to the latter which item was purchased and at which price. Unfortunately, existing POT schemes have some drawbacks in terms of design and functionality. First, the design of existing POT schemes is not modular. Typically, a POT scheme extends a k-out-of-N oblivious transfer (OT) scheme by adding prices to the items. However, all POT schemes do not use OT as a black-box building block with certain security guarantees. Consequently, security of the OT scheme needs to be reanalyzed while proving security of the POT scheme, and it is not possible to swap the underlying OT scheme with any other OT scheme. Second, existing POT schemes do not allow the seller to obtain any kind of statistics about the buyer's purchases, which hinders customer and sales management. Moreover, the seller is not able to change the prices of items without restarting the protocol from scratch. We propose a POT scheme that addresses the aforementioned drawbacks. We prove the security of our POT in the UC framework. We modify a standard POT functionality to allow the seller to receive aggregate statistics about the buyer's purchases and to change prices dynamically. We present a modular construction for POT that realizes our functionality in the hybrid model. One of the building blocks is an ideal functionality for OT. Therefore, our protocol separates the tasks carried out by the underlying OT scheme from the additional tasks needed by a POT scheme. Thanks to that, our protocol is a good example of modular design and can be instantiated with any secure OT scheme as well as other building blocks without reanalyzing security from scratch. [less ▲]Detailed reference viewed: 99 (27 UL) UC Updatable Databases and ApplicationsDamodaran, Aditya Shyam Shankar ; Rial, Alfredo in 12th International Conference on Cryptology (2020)We define an ideal functionality $\Functionality_{\UD}$ and a construction $\mathrm{\Pi_{\UD}}$ for an updatable database ($\UD$). $\UD$ is a two-party protocol between an updater and a reader. The ... [more ▼]We define an ideal functionality $\Functionality_{\UD}$ and a construction $\mathrm{\Pi_{\UD}}$ for an updatable database ($\UD$). $\UD$ is a two-party protocol between an updater and a reader. The updater sets the database and updates it at any time throughout the protocol execution. The reader computes zero-knowledge (ZK) proofs of knowledge of database entries. These proofs prove that a value is stored at a certain position in the database, without revealing the position or the value. (Non-)updatable databases are implicitly used as building block in priced oblivious transfer, privacy-preserving billing and other privacy-preserving protocols. Typically, in those protocols the updater signs each database entry, and the reader proves knowledge of a signature on a database entry. Updating the database requires a revocation mechanism to revoke signatures on outdated database entries. Our construction $\mathrm{\Pi_{\UD}}$ uses a non-hiding vector commitment (NHVC) scheme. The updater maps the database to a vector and commits to the database. This commitment can be updated efficiently at any time without needing a revocation mechanism. ZK proofs for reading a database entry have communication and amortized computation cost independent of the database size. Therefore, $\mathrm{\Pi_{\UD}}$ is suitable for large databases. We implement $\mathrm{\Pi_{\UD}}$ and our timings show that it is practical. In existing privacy-preserving protocols, a ZK proof of a database entry is intertwined with other tasks, e.g., proving further statements about the value read from the database or the position where it is stored. $\Functionality_{\UD}$ allows us to improve modularity in protocol design by separating those tasks. We show how to use $\Functionality_{\UD}$ as building block of a hybrid protocol along with other functionalities. [less ▲]Detailed reference viewed: 75 (12 UL) UC Updatable Non-Hiding Committed Database with Efficient Zero-Knowledge ProofsRial, Alfredo E-print/Working paper (2019)We define an ideal functionality $\Functionality_{\DB}$ and a protocol $\mathrm{\Pi_{\DB}}$ for an updatable non-hiding committed database ($\DB$). $\DB$ is described as the task of storing a database ... [more ▼]We define an ideal functionality $\Functionality_{\DB}$ and a protocol $\mathrm{\Pi_{\DB}}$ for an updatable non-hiding committed database ($\DB$). $\DB$ is described as the task of storing a database into a suitable data structure that allows you to efficiently prove in zero-knowledge (ZK) that a value is stored in the database at a certain position. The database is \emph{non-hiding} because both prover and verifier know its content. It is \emph{committed} in the sense that only ZK proofs about position-value pairs that are actually stored are possible. It is \emph{updatable} because its contents can be modified dynamically throughout the protocol execution. The $\DB$ task is used implicitly as building block of privacy-preserving protocols for e-commerce, smart billing and access control. In those protocols, this task is intertwined with others. Our functionality $\Functionality_{\DB}$ allows us to study constructions for this task in isolation. Furthermore, it allows us to improve modularity in protocol design, by using $\Functionality_{\DB}$ as building block of those protocols along with functionalities for other tasks. Our construction $\mathrm{\Pi_{\DB}}$ uses a non-hiding vector commitment (VC) scheme as building block. Thanks to the efficiency properties of non-hiding VC schemes, $\mathrm{\Pi_{\DB}}$ provides ZK proofs whose computation cost (after initialization) and whose size are both independent of the database size. Therefore, $\mathrm{\Pi_{\DB}}$ is suitable for large databases. Moreover, the database can be updated dynamically and very efficiently. [less ▲]Detailed reference viewed: 102 (31 UL) Účast Evropského společenství v rámci Všeobecné dohody o clech a obchodu (GATT) a v rámci Světové obchodní organizace (WTO)Lickova, Magdalena in Právník (2006), 145(7), 769-790Detailed reference viewed: 24 (0 UL) UCHL1 is a Parkinson's disease susceptibility gene.Maraganore, Demetrius M.; Lesnick, Timothy G.; Elbaz, Alexis et alin Annals of neurology (2004), 55(4), 512-21The reported inverse association between the S18Y variant of the ubiquitin carboxy-terminal hydrolase L1 (UCHL1) gene and Parkinson's disease (PD) has strong biological plausibility. If confirmed, genetic ... [more ▼]The reported inverse association between the S18Y variant of the ubiquitin carboxy-terminal hydrolase L1 (UCHL1) gene and Parkinson's disease (PD) has strong biological plausibility. If confirmed, genetic association of this variant with PD may support molecular targeting of the UCHL1 gene and its product as a therapeutic strategy for PD. In this light, we performed a collaborative pooled analysis of individual-level data from all 11 published studies of the UCHL1 S18Y gene variant and PD. There were 1,970 cases and 2,224 unrelated controls. We found a statistically significant inverse association of S18Y with PD. Carriers of the variant allele (Y/Y plus Y/S vs S/S) had an odds ratio (OR) of 0.84 (95% confidence interval [CI], 0.73-0.95) and homozygotes for the variant allele (Y/Y vs S/S plus Y/S) had an OR of 0.71 (95% CI, 0.57-0.88). There was a linear trend in the log OR consistent with a gene dose effect (p = 0.01). The inverse association was most apparent for young cases compared with young controls. There was no evidence for publication bias and the associations remained significant after excluding the first published, hypothesis-generating study. These findings confirm that UCHL1 is a susceptibility gene for PD and a potential target for disease-modifying therapies. [less ▲]Detailed reference viewed: 108 (0 UL) Das UCITSG und seine FolgenZetzsche, Dirk Andreas in Heiss, Helmut (Ed.) Rechtsreform und Zukunft des Finanzplatzes Liechtenstein (2013)Detailed reference viewed: 36 (1 UL) Uczenie się bez nauczania? Potencjał iograniczenia biograficznego uczenia się dorosłych.Tedder, M.; Biesta, Gert in Terazniejszosc Czlowiek Edukacja (2009), 46(2), 19-35Detailed reference viewed: 184 (0 UL) ÜGK Mathematik 2016: Auditergebnisse / Évaluation des COFO en mathématiques 2016 : Résultats de l’auditFischbach, Antoine ; Ugen, Sonja Presentation (2018, March 22)Detailed reference viewed: 64 (7 UL) ÜGK/COFO mathematics 2016 audit report. Commissioned by EDK/CDIP upon the request of KOSTA HarmoSFischbach, Antoine ; Ugen, Sonja Report (2018)Detailed reference viewed: 56 (10 UL) Uit de marge van de onderwijsgeschiedenis: schoolschriften als lieux de mémoire (1950-1970)Herman, Frederik ; Van Gorp, Angelo; Surmont, Melanie et alin Van Gorp, A.; Bakker, N.; Braster, S. (Eds.) et al Materiële schoolcultuur: over artefacten als bron in de onderwijsgeschiedenis (2009)Detailed reference viewed: 16 (0 UL) The UK reform package in view of Free movement, social and fundamental rightsGerkrath, Jörg Scientific Conference (2016, March 11)Detailed reference viewed: 90 (8 UL) UL HPC in practice: why, what, how, where to lookBesseron, Xavier Presentation (2015, June 25)Detailed reference viewed: 18 (1 UL) UL HPC Tutorial: Advanced Job scheduling with SLURM and OARPlugaru, Valentin ; Varrette, Sébastien ; Diehl, Sarah et alPresentation (2018, June)Detailed reference viewed: 74 (4 UL) UL HPC Tutorial: Building [custom] software with EasyBuild on the UL HPC platformDiehl, Sarah ; Varrette, Sébastien ; Plugaru, Valentin et alPresentation (2018, June)Detailed reference viewed: 53 (1 UL) UL HPC Tutorial: Parallel computations with OpenMP/MPIVarrette, Sébastien ; Plugaru, Valentin ; Diehl, Sarah et alPresentation (2018, June)Detailed reference viewed: 37 (1 UL) UL HPC Tutorial: Performance engineering - HPC debugging and profillingPlugaru, Valentin ; Besseron, Xavier ; Varrette, Sébastien et alPresentation (2018, June)Detailed reference viewed: 44 (9 UL) UL HPC Tutorial: (Advanced) Prototyping with PythonParisot, Clément ; Diehl, Sarah ; Varrette, Sébastien et alPresentation (2018, June)Detailed reference viewed: 54 (4 UL) UL HPC Tutorial: Basic and Advanced scientific computing using MATLABPlugaru, Valentin ; Varrette, Sébastien ; Diehl, Sarah et alPresentation (2018, June)Detailed reference viewed: 38 (2 UL)