Browsing
     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
See detailÜberlegungen zur Experimentellen Medienarchäologie
Krebs, Stefan UL

Scientific Conference (2019)

Detailed reference viewed: 4 (0 UL)
See detailÜberlegungen zur Kritischen Gesamtausgabe Laurent Menager (1835-1902)
Sagrillo, Damien UL

Conference given outside the academic context (2011)

Detailed reference viewed: 39 (2 UL)
Peer Reviewed
See detailÜberlegungen zur Reform des Sprachenunterrichts in Luxemburg
Berg, Charles UL; Weis, Christiane UL

in Hofman, Bernhard; Valtin, Renate (Eds.) Checkpoint Literacy. Tagungsband 2 zum 15. Europäischen Lesekongress 2007 in Berlin (2008)

Detailed reference viewed: 36 (3 UL)
Full Text
Peer Reviewed
See detailÜberprüfung der psychometrischen Qualität der deutschen Version des Angstsensitivitätsindex-3
Kemper, Christoph UL; Ziegler, M.; Taylor, S.

in Diagnostica (2009), 55(4), 223-233

Detailed reference viewed: 83 (0 UL)
See detailÜberschätzung von Zeit als Indikator von Überraschung.
Klapproth, Florian UL

in Petermann, F.; Koglin, U. (Eds.) 47. Kongress der Deutschen Gesellschaft für Psychologie (S. 222) (2010)

Detailed reference viewed: 14 (0 UL)
See detailÜberschneidungen von Bildungsungleichheiten nach Geschlecht und Migrationshintergrund. Eine theoretische und empirische Hinführung
Hadjar, Andreas UL; Hupka-Brunner, Sandra

in Hadjar, Andreas; Hupka-Brunner, Sandra (Eds.) Geschlecht, Migrationshintergrund und Bildungserfolg (2013)

Detailed reference viewed: 160 (6 UL)
Full Text
Peer Reviewed
See detailÜbersetzte Räume. Literatur und/der Deplatzierung
Heimböckel, Dieter UL

in Istituto Universitario Orientale. Sezione Germanica. Annali (2013), 23(2), 237-252

Detailed reference viewed: 96 (8 UL)
Full Text
See detailÜbersetzung und Anamorphose : Literarische Fremdsprachigkeit und entstellte Sprache : Yoko Tawada, Jonathan Safran Foer
Kohns, Oliver UL

in Cha, Kyung-Ho; Rautzenberg, Markus (Eds.) Der entstellte Blick : Anamorphosen in Kunst, Literatur und Philosophie (2008)

Detailed reference viewed: 167 (6 UL)
Full Text
See detailDie Übertragung der Reinheit (Mary Douglas, Friedrich Nietzsche)
Kohns, Oliver UL

in Geisenhanslüke, Achim; Mein, Georg (Eds.) Grenzräume der Schrift (2008)

Detailed reference viewed: 157 (5 UL)
See detailUbi servi erant? Die Ikonographie von Sklaven und Freigelassenen in der römischen Kunst
Binsfeld, Andrea UL; Ghetta, Marcello

Book published by Steiner (2019)

Ubi servi erant? – Wo waren die Sklaven in der Antike? Die Antwort scheint auf der Hand zu liegen: Überall. Man findet Sklaven in den privaten Haushalten, in Handel, Handwerk und Verwaltung, im Kaiserhaus ... [more ▼]

Ubi servi erant? – Wo waren die Sklaven in der Antike? Die Antwort scheint auf der Hand zu liegen: Überall. Man findet Sklaven in den privaten Haushalten, in Handel, Handwerk und Verwaltung, im Kaiserhaus, in den Städten etc. Inschriften, Papyri, literarische und archäologische Zeugnisse sowie die Rechtsquellen belegen die weite Verbreitung der Sklaverei, so dass man für die griechische und römische Antike mit Fug und Recht von Sklavenhaltergesellschaften sprechen kann. Wie aber sahen die Sklaven aus? Hatten sie die Möglichkeit, Bilder von sich selbst zu überliefern? Wie haben die Herren sie wahrgenommen? Welche Funktion erfüllten die Bilder der Sklaven? Die Beiträge in diesem Band decken ein breites geographisches, chronologisches und thematisches Spektrum ab. Auf diesem Fundament und durch die kombinierte Auswertung einer Vielzahl unterschiedlicher Quellen gelingt es, die Ikonographie der Sklaven besser zu erfassen. [less ▲]

Detailed reference viewed: 13 (0 UL)
Full Text
Peer Reviewed
See detailUbiSettlers-A Dynamically Adapting Mobile P2P Multiplayer Game for Hybrid Networks
Hiedels, Christian UL; Hoff, Christian; Rothkugel, Steffen UL et al

in Abstract book of 4th IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P 2007) (2007)

Detailed reference viewed: 64 (1 UL)
Full Text
Peer Reviewed
See detailUC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
Camenisch, Jan; Dubovitskaya, Maria; Rial, Alfredo UL

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: 120 (12 UL)
Full Text
Peer Reviewed
See detailUC Priced Oblivious Transfer with Purchase Statistics and Dynamic Pricing
Damodaran, Aditya Shyam Shankar UL; Dubovitskaya, Maria; Rial, Alfredo UL

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: 96 (27 UL)
Full Text
Peer Reviewed
See detailUC Updatable Databases and Applications
Damodaran, Aditya Shyam Shankar UL; Rial, Alfredo UL

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: 59 (10 UL)
Full Text
See detailUC Updatable Non-Hiding Committed Database with Efficient Zero-Knowledge Proofs
Rial, Alfredo UL

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: 100 (31 UL)
Peer Reviewed
See detailUCHL1 is a Parkinson's disease susceptibility gene.
Maraganore, Demetrius M.; Lesnick, Timothy G.; Elbaz, Alexis et al

in Annals of neurology (2004), 55(4), 512-21

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 ... [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: 106 (0 UL)
Full Text
Peer Reviewed
See detailDas UCITSG und seine Folgen
Zetzsche, Dirk Andreas UL

in Heiss, Helmut (Ed.) Rechtsreform und Zukunft des Finanzplatzes Liechtenstein (2013)

Detailed reference viewed: 35 (1 UL)
Full Text
Peer Reviewed
See detailUczenie się bez nauczania? Potencjał iograniczenia biograficznego uczenia się dorosłych.
Tedder, M.; Biesta, Gert UL

in Terazniejszosc Czlowiek Edukacja (2009), 46(2), 19-35

Detailed reference viewed: 184 (0 UL)