Filtern
Erscheinungsjahr
Dokumenttyp
- Arbeitspapier (12)
- Preprint (8)
- Wissenschaftlicher Artikel (5)
- Teil eines Buches (Kapitel) (4)
- Konferenzveröffentlichung (3)
Sprache
- Englisch (32) (entfernen)
Volltext vorhanden
- ja (32)
Gehört zur Bibliographie
- nein (32)
Schlagworte
- Kongress (32) (entfernen)
Institut
The present article explores perceptions and cultural constructions of the terms capitalism or capitalistic West among ex-Soviet, highly qualified Jewish migrants from Russia and Ukraine after their emigration to Germany between 1990 and 1996. It seems that migration offers a unique opportunity to migrants to realise knowledge that is normally taken for granted, behaviour schemes and values, and to reflect on them. How do they acquire such presumed capitalist knowledge of the new society and new social world, how do they create it, and with what concrete contents do they connect the illusion about monolithic cultural, economic and political capital, the illusion which contributes to group formation and which serves as action orientation? As my research shows, immigrants try to disparage much of what appeared to them in the Soviet Union as normative, right and appropriate; now they often act by way of categories, which were defined in the previous context as "capitalist" and were interpreted as immoral. Without exact ideas or knowledge about behaviour codes, unspoken norms and silent values from the new society, many immigrants orient themselves towards the opposite of what was counted as morally proper in the origin society. Simultaneously they revive old system through the establishing and development of a Russian language enclave. Nevertheless this enclave is not located in a vacuum of "dusty" memories from the past, but build transnational cross-border space connected and corresponding to the processes of to-day's CIS and with the life of those relatives and friends who still live there, und with whom the emigrants share intensive social networks.
Even though tourism has been recognised as an important field for transnational research today, there are few attempts to place tourism in the context of transnational theories or to think about transnationalism from the perspective of tourists. I argue that in researching tourist practices one can add important aspects to transnational approaches. The prerequisites of mobility and interaction for example are the features chosen by backpackers to describe what their Round-The-World-Trip is about. A form of tourism is adopted, or created, that itself confronts many aspects of globalisation: First of all there is the immense dynamic that is involved. Backpackers try to cover as many places and experiences as possible, travelling at high speed. They adopt all kinds of touristic experiences ranging from beach to adventure to culture tourism. They don't focus on a specific area or country but travel the world. They cross national borders perpetually. Additionally they form a transnational network in which they interact with strangers of similar backgrounds (other backpackers, tourist professionals). This network helps them interacting with people from different backgrounds (the socalled hosts or locals). Considering my research Backpackers forge a certain identity from these transnational practices which I want to name globedentity. Globedentity expresses a type of identity construction that not only refers to the individual (I) but reflects the world (globe) in this identity. This globedentity is not fixed but is perpetually re-created and re-defined. It also embraces the increasing popular awareness of globalisation which backpackers, coming from highly educated middle class backgrounds, in particular have identified with. Due to the constant awareness of the latest global social, cultural and economic developments in these educated milieus they know exactly which tools to use to become successful parts of their societies.
We show that non-interactive statistically-secret bit commitment cannot be constructed from arbitrary black-box one-to-one trapdoor functions and thus from general public-key cryptosystems. Reducing the problems of non-interactive crypto-computing, rerandomizable encryption, and non-interactive statistically-sender-private oblivious transfer and low-communication private information retrieval to such commitment schemes, it follows that these primitives are neither constructible from one-to-one trapdoor functions and public-key encryption in general. Furthermore, our separation sheds some light on statistical zeroknowledge proofs. There is an oracle relative to which one-to-one trapdoor functions and one-way permutations exist, while the class of promise problems with statistical zero-knowledge proofs collapses in P. This indicates that nontrivial problems with statistical zero-knowledge proofs require more than (trapdoor) one-wayness.
Pseudorandom function tribe ensembles based on one-way permutations: improvements and applications
(1999)
Pseudorandom function tribe ensembles are pseudorandom function ensembles that have an additional collision resistance property: almost all functions have disjoint ranges. We present an alternative to the construction of pseudorandom function tribe ensembles based on oneway permutations given by Canetti, Micciancio and Reingold [CMR98]. Our approach yields two different but related solutions: One construction is somewhat theoretic, but conceptually simple and therefore gives an easier proof that one-way permutations suffice to construct pseudorandom function tribe ensembles. The other, slightly more complicated solution provides a practical construction; it starts with an arbitrary pseudorandom function ensemble and assimilates the one-way permutation to this ensemble. Therefore, the second solution inherits important characteristics of the underlying pseudorandom function ensemble: it is almost as effcient and if the starting pseudorandom function ensemble is efficiently invertible (given the secret key) then so is the derived tribe ensemble. We also show that the latter solution yields so-called committing private-key encryption schemes. i.e., where each ciphertext corresponds to exactly one plaintext independently of the choice of the secret key or the random bits used in the encryption process.
Based on the quadratic residuosity assumption we present a non-interactive crypto-computing protocol for the greater-than function, i.e., a non-interactive procedure between two parties such that only the relation of the parties' inputs is revealed. In comparison to previous solutions our protocol reduces the number of modular multiplications significantly. We also discuss applications to conditional oblivious transfer, private bidding and the millionaires' problem.
We review the representation problem based on factoring and show that this problem gives rise to alternative solutions to a lot of cryptographic protocols in the literature. And, while the solutions so far usually either rely on the RSA problem or the intractability of factoring integers of a special form (e.g., Blum integers), the solutions here work with the most general factoring assumption. Protocols we discuss include identification schemes secure against parallel attacks, secure signatures, blind signatures and (non-malleable) commitments.
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly available RSA or Discrete-Log parameters generated by a trusted party. Our protocols require only three rounds and a few modular exponentiations. We also discuss the difference between the notion of non-malleable commitment schemes used by Dolev, Dwork and Naor [DDN00] and the one given by Di Crescenzo, Ishai and Ostrovsky [DIO98].
The future of securitization
(2008)
Securitization is a financial innovation that experiences a boom-bust cycle, as many other innovations before. This paper analyzes possible reasons for the breakdown of primary and secondary securitization markets, and argues that misaligned incentives along the value chain are the primary cause of the problems. The illiquidity of asset and interbank markets, in this view, is a market failure derived from ill-designed mechanisms of coordinating financial intermediaries and investors. Thus, illiquidity is closely related to the design of the financial chains. Our policy conclusions emphasize crisis prevention rather than crisis management, and the objective is to restore a “comprehensive incentive alignment”. The toe-hold for strengthening regulation is surprisingly small. First, we emphasize the importance of equity piece retention for the long-term quality of the underlying asset pool. As a consequence, equity piece allocation needs to be publicly known, alleviating market pricing. Second, on a micro level, accountability of managers can be improved by compensation packages aiming at long term incentives, and penalizing policies with destabilizing effects on financial markets. Third, on a macro level, increased transparency relating to effective risk transfer, risk-related management compensation, and credible measurement of rating performance stabilizes the valuation of financial assets and, hence, improves the solvency of financial intermediaries. Fourth, financial intermediaries, whose risk is opaque, may be subjected to higher capital requirements.
When in 1934, Robert BLEICHSTEINER published the Caucasian language specimina contained in the "travel book" of the 17th century Turkish writer Evliya Çelebi , he was struck by the amount of reliability he found in Evliya’s notations: "(Die Sprachproben) sind, von einzelnen Mißverständnissen abgesehen, und wenn man die falschen Punktierungen und Irrtümer der Kopisten abrechnet, außerordentlich gut, ja zuweilen mit einem gewissen phonetischen Geschick wiedergegeben, was der Auffassungsgabe und dem Eifer Evliyas ein hohes Zeugnis ausstellt. Man muß bedenken, wie schwer das arabische Alphabet, ohne weitere Unterscheidungszeichen, wie sie die islamischen Kaukasusvölker anwenden, die verwickelten, oft über 70 verschiedene Phoneme umfassenden Lautsysteme wiederzugeben imstande ist. Wenn trotzdem die Entzifferung der Sprachproben zum größten Teil geglückt ist, so muß man der ungewöhnlichen Begabung des türkischen Reisenden und Gelehrten schrankenlose Bewunderung zollen" (85). ...
We investigate unary regular languages and compare deterministic finite automata (DFA’s), nondeterministic finite automata (NFA’s) and probabilistic finite automata (PFA’s) with respect to their size. Given a unary PFA with n states and an e-isolated cutpoint, we show that the minimal equivalent DFA has at most n exp 1/2e states in its cycle. This result is almost optimal, since for any alpha < 1 a family of PFA’s can be constructed such that every equivalent DFA has at least n exp alpha/2e states. Thus we show that for the model of probabilistic automata with a constant error bound, there is only a polynomial blowup for cyclic languages. Given a unary NFA with n states, we show that efficiently approximating the size of a minimal equivalent NFA within the factor sqrt(n)/ln n is impossible unless P = NP. This result even holds under the promise that the accepted language is cyclic. On the other hand we show that we can approximate a minimal NFA within the factor ln n, if we are given a cyclic unary n-state DFA.