Composability and On-Line Deniability of Authentication (2009)
Yevgeniy Dodis, Jonathan Katz, Adam Smith, Shabsi Walfish
Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but...
Compiler Transformations to Generate Reentrant C Programs to Assist Software Parallelization (2009)
As we move through the multi-core era into the many-core era it becomes obvi- ous that thread-based programming is here to stay. This trend in the development of general purpose hardware is augmented...
Zhang, Weishi, Smith, Adam, Liu, Jun-ping, Cheung, Nam Sing, Zhou, Shufeng, Liu, Ke, ...
Pituitary adenylate cyclase-activating polypeptide (PACAP) is a neurotrophic peptide. Here, we show that PACAP recruits Rap1 into caveolin-enriched membrane subdomains in PC12 cells and activates...
Efficient and Non-Interactive Non-Malleable Commitment (2008)
Giovanni Di, Crescenzo Jonathan, Katz Rafail Ostrovsky, Adam Smith, Telcordia Technologies
Work done while the author was at Telcordia Technologies.
Efficient, Differentially Private Point Estimators (2008)
Differential privacy is a recent notion of privacy for statistical databases that provides rigorous, meaningful confidentiality guarantees, even in the presence of an attacker with access to...
Shuchi Chawla, Cynthia Dwork, Frank Mcsherry, Adam Smith, Hoeteck Wee, Larry Joseph Stockmeyer
Abstract. We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who publishes a...
you could too! Our namesake Adam Smith was born in the town of Kirkcaldy around 1723. A philosopher and educationalist, he is recognised worldwide as one of the foremost thinkers in the Scottish...
Tableau Machine: A Creative Alien Presence (2008)
Adam Smith, Mario Romero, Zachary Pousman, Michael Mateas
We present the design of Tableau Machine (TM), an AIbased, interactive, visual art generator for shared living spaces. TM is an instance of what we call “alien presence”: an ambient, non-human,...
starting with Socrates (469-399 B.C.), Plato (427-347 B.C.), Aristotle (384-322 B.C.) and (2008)
Amir Azad, Later John Locke, Richard Cantillon, David Hume, Anna Robert, Jacques Turgot, ...
Abstract: This paper presents an overview of the Austrian school of economics. Even though it started with Carl Menger and the intellectual circle in 19 th century Vienna, its theoretical and...
E cient and Non-Interactive Non-Malleable Commitment (2008)
Giovanni Di, Crescenzo Jonathan, Katz Rafail Ostrovsky, Adam Smith
Work done while the author was at Telcordia Technologies.
Lim, Wee Guan, Chen, Xiao, Liu, Jun-Ping, Tan, Bee Jen, Zhou, Shufeng, Smith, Adam, ...
PRK2/PKNγ is a Rho effector and a member of the protein kinase C superfamily of serine/threonine kinases. Here, we explore the structure–function relationship between various motifs in...
Rafail Ostrovsky, Charles Rackoff, Adam Smith
Abstract. A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy of the database...
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes and present an...
March Madness is (NP-)Hard (draft) (2007)
David Liben-nowell, Moses Liskov, Chris Peikert, Abhi Shelat, Adam Smith, Grant Wang
Abstract. We formally dene the March-Madness decision problem (inspired by popular betting pools for the NCAA basketball tournament), and prove it NP-complete. 1
Howard Barnum, Claude Crepeau, Daniel Gottesman, Adam Smith
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message...
Claude Cr Epeau, Daniel Gottesman, Adam Smith
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs...
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith, Telcordia Technologies Inc
Work done while the author was at Telcordia Technologies.
Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith
Abstract. We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they do not...
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith, Telcordia Technologies Inc
Work done while the author was at Telcordia Technologies.
Yevgeniy Dodis, Amit Sahai, Adam Smith
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with retaining security...
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Work done while the author was at Telcordia Technologies.
Claude Crepeau, Daniel Gottesman, Adam Smith
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a message with the guarantee that the message has not...
Round Eciency of Multi-Party Computation (2007)
With Dishonest Majority, Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan
Abstract. Dwork and Stockmeyer showed 2-round zero-knowledge proof systems secure against provers which are resource-bounded during the interaction [6]. The resources considered are running time and...
List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument (2007)
Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan
Dwork and Stockmeyer showed 2-round zero-knowledge proof systems secure against provers which are resource-bounded during the interaction [6]. The resources considered are running time and advice...
The iBatis data mapping framework for Java, .NET and Ruby increases developer productivity by facilitating database storage at a higher level than say, JDBC, without the complexity of larger...
Web Services Interface For The Handle System (2007)
Slides for a presentation given at the Handle System Workshop in Washington, D.C. on June 21, 2007.
Developing Handle System Web Services At Cornell University. (2007)
Recognizing the importance of consistently implementing persistent identifiers (PIDs), a group of librarians at Cornell University evaluated several PID strategies and chose to implement the Handle...
Introducing Zoomify Image (2007)
Zoomify Image is a mature product for easily publishing large, high resolution images on the Web. End users view these images with existing Web browser software as quickly as they do normal,...
1.1 An Almost Linear Lower Bound for Approximation with an Additive Error..... 2 (2007)
Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith
We consider the problem of approximating the support size of a distribution from a small number of samples, when each element in the distribution appears with probability at least 1 n. This problem...
Scrambling adversarial errors using few random bits (2007)
When communicating over a noisy channel, it is typically much easier to deal with random, independent errors with a known distribution than with adversarial errors. This paper looks at how one can...
Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith
We consider the problem of approximating the support size of a distribution from a small number of samples, when each element in the distribution appears with probability at least 1 n. This problem...
Sublinear algorithms for approximating string compressibility (2007)
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam Smith
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless...
Bringing Many Tools Together: Building a System of Co-operating OAIS's in the MathArc Project (2006)
Enders, Markus, Kehoe, William, Smith, Adam
Bringing many tools together to build a system of co-operating OAIS's in the MathArc project. The MathArc project has created a protocol, software, and registry that enable multiple institutions to...
Pearl St. commercial & residential development, Jackson, MS / (2006)
Thesis (B.Arch.)--Mississippi State University. College of Architecture.
Moni Naor, Gil Segev, Adam Smith
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and by a low-bandwidth...
Moni Naor, Gil Segev, Adam Smith
Abstract We address the message authentication problem in two seemingly different communicationmodels. In the first model, the sender and receiver are connected by an insecure channel and by a...
Calibrating noise to sensitivity in private data analysis (2006)
Cynthia Dwork, Frank Mcsherry, Kobbi Nissim, Adam Smith
Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query...
Calibrating noise to sensitivity in private data analysis (2006)
Cynthia Dwork, Frank Mcsherry, Kobbi Nissim, Adam Smith
Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query...
When communicating over a noisy channel, it is typically much easier to deal with random, independent errors with a known distribution than with adversarial errors. This paper looks at how one can...
Analyzing the HB and HB (2006)
In The Large, Jonathan Katz, Adam Smith
HB and HB are two shared-key, unidirectional authentication protocols whose extremely low computational cost makes them potentially well-suited for severely resource-constrained devices. Security of...
Moni Naor, Gil Segev, Adam Smith
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and by a low-bandwidth...
Calibrating noise to sensitivity in private data analysis (2006)
Cynthia Dwork, Frank Mcsherry, Kobbi Nissim, Adam Smith
Abstract. We continue a line of research initiated in [10, 11] on privacypreserving statistical databases. Consider a trusted server that holds a database of sensitive information. Given a query...
Cantillon, Hume and the Rise of Anti-Mercantilism (2006)
Abstract David Hume, Adam Smith, Dr. Mark Thornton
are considered the founding fathers of anti-mercantilism, economics, and the Scottish Enlightenment. However, scholars have long recognized a similarity between Hume’s contributions and those of...
Moni Naor, Gil Segev, Adam Smith
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and by a low-bandwidth...
Moni Naor, Gil Segev, Adam Smith
Abstract We address the message authentication problem in two seemingly different communicationmodels. In the first model, the sender and receiver are connected by an insecure channel and by a...
Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith
We show that the standard decoding algorithm for BCH codes can be modified to run in time polynomial in the length of the syndrome. This works for BCH codes over any field GF (q), which include...
Developing shrub fire behaviour models in an oceanic climate: Burning in the British Uplands (2006)
Davies, Gwilym Matthew, Legg, Colin, Smith, Adam, MacDonald, Angus
The abstract of this paper was previously published in a supplement to Forest Ecology and Management. The full paper, presented here, was available only on the CD of the conference paper.
Solo living across the adult lifecourse (2005)
Smith, Adam, Wasoff, Fran, Jamieson, Lynn
This study has created snapshots of solo living in contemporary society and developed an understanding of the social and economic factors involved in transitions in and out of solo living.
Easton, Donna M., Smith, Adam, Gallego, Sara Gomez, Foxwell, A. Ruth, Cripps, Allan, Kyd, Jennelle M.
Moraxella catarrhalis is a gram-negative bacterium that is mainly responsible for respiratory tract infections. In this study we report a novel outer membrane protein (OMP), designated M35, with a...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
We show two efficient techniques enabling the use of biometric data to achieve mutual authentication or authenticated key exchange over a completely insecure (i.e., adversarially controlled) channel....
Correcting errors without leaking partial information (2005)
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak a significant amount...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
secret information that can be used incryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly distributed; and (2) they are not exactly reproducible. Recent...
Secure Remote Authentication Using Biometric Data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometric data o#er a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly...
Secure Remote Authentication Using Biometric (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometrics offer a potential source of high-entropy, secret information. Before such data can be used in cryptographic protocols, however, two issues must be addressed: biometric data (1) are not...
Entropic security and the encryption of high entropy messages (2005)
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of the plaintext...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly...
Approximate Quantum ErrorCorrecting Codes and Secret Sharing Schemes (2005)
Claude Crépeau, Daniel Gottesman, Adam Smith
Abstract. It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and...
Toward privacy in public databases (2005)
Shuchi Chawla, Cynthia Dwork, Frank Mcsherry, Adam Smith, Larry Joseph Stockmeyer
Abstract. We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who publishes a...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not uniformly...
Secure remote authentication using biometric data (2005)
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are not...
Correcting errors without leaking partial information (2005)
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak a significant amount...
Easton, Donna M., Smith, Adam, Gallego, Sara Gomez, Foxwell, A. Ruth, Cripps, Allan, Kyd, Jennelle M.
Moraxella catarrhalis is a gram-negative bacterium that is mainly responsible for respiratory tract infections. In this study we report a novel outer membrane protein (OMP), designated M35, with a...
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004)
Yevgeniy Dodis, Leonid Reyzin, Adam Smith
We provide formal definitions and e#cient secure techniques for
Efficient Consistency Proofs for Generalized Queries on Committed Database (2004)
Rafail Ostrovsky, Charles Rackoff, Adam Smith
A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy of the database can later...
Efficient Consistency Proofs for Generalized Queries on a Committed Database (2004)
Rafail Ostrovsky, Charles Rackoff, Adam Smith
A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy of the database can later...
Small Pseudo-Random Families of Matrices: (2004)
Derandomizing Approximate Quantum, Andris Ambainis, Adam Smith
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them...
Tracking Moving Devices with the Cricket Location System (2004)
Adam Smith, Hari Balakrishnan, Michel Goraczko, Nissanka Priyantha
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infrastructure has...
Efficient consistency proofs for generalized queries on a committed database (2004)
Rafail Ostrovsky, Charles Rackoff, Adam Smith
Abstract. A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy of the database...
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004)
Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely...
Rafail Ostrovsky, Charles Rackoff, Adam Smith
A consistent query protocol (CQP) allows a database owner to publish a very short string c which commits her and everybody else to a particular database D, so that any copy of the database can later...
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004)
Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely...
Small pseudo-random families of matrices: Derandomizing approximate quantum encryption (2004)
Abstract. A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string,...
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004)
Yevgeniy Dodis, Leonid Reyzin, Adam Smith
Abstract. We provide formal definitions and efficient secure techniques for – turning biometric information into keys usable for any cryptographic application, and – reliably and securely...
Imagine/Align is a site-specific, community-based art installation by Susan Skarsgard at the University of Michigan Nichols Arboretum. This project, which bloomed for the first time in April 2004, is...
Lessons from developing and deploying the Cricket indoor location system (2003)
Hari Balakrishnan, Roshan Baliga, Dorothy Curtis, Michel Goraczko, Allen Miu, Bodhi Priyantha, ...
The Cricket indoor location project has been active for four years. We have developed three different versions of the system. The first version was an early proofof-concept (Cricket v0), which led to...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Theme D THE INNOVATIVE MIND (2003)
Brian J Loasby, Stirling Fk La, Adam Smith, Alfred Marshall
The foundation of this paper is the cognitive theory presented by Hayek in The Sensory Order. Hayek’s account of the creation of mental orders is related to Smith, Marshall, evolutionary psychology...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Efficient Consistency Proofs on a Committed Database MIT LCS (2003)
Rafail Ostrovsky, Charles Rackoff, Adam Smith
A consistent query protocol allows a database owner to publish a very short string c which commits her to a particular database D with special consistency property (i.e., given c, every allowable...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality...
Round Efficiency of Multi-Party Computation with a Dishonest Majority (2003)
Jonathan Katz, Rafail Ostrovsky, Adam Smith
Abstract. We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some...
Textual structure and segmentation in online documents (2003)
Despite the flexibility of the electronic medium, the computer screen itself puts constraints on the shape of the discourse accessed through it. The effects are likely to show up in longer documents,...
Byzantine Agreement Secure Against Faulty Majorities From Scratch (2002)
Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith
It is well-known that n players, connected only by pairwise secure channels, can achieve Byzantine agreement only if the number t of cheaters satises t n=3, even with respect to computational...
Extracting Quantum Entanglement (General Entanglement Purification Protocols (2002)
Andris Ambainis, Adam Smith, Ke Yang
We study the problem of extracting EPR pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state which is "reasonably close " to perfect EPR pairs....
Authentication of quantum messages (2002)
Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message...
Extracting Quantum Entanglement (General Entanglement Purification Protocols) (2002)
Andris Ambainis, Adam Smith, Ke Yang
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state ae which is "reasonably close" to perfect EPR pairs. The only information...
Detectable Byzantine Agreement Secure against Faulty Majorities (2002)
Matthias Fitzi, Daniel Gottesman, Adam Smith, Thomas Holenstein, Martin Hirt
BA6C@D2FE(G2)HJI:;GK8&LF4NMONA@@B8NOP2F8QRA@:5KTSKTIBG$3=L"6C354"8U4"8NONVLF8 OPEBG$@B@8N:54NMOG @WG OPE3;8&X8ZY[K\G$@2F35@B8JG$]$LF8&8N^_8N@2`A@:5Ka3=b92FEB8c@V^cSd8&L...
Mutually independent commitments (2001)
Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith
Abstract. We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they do not...
Mutually independent commitments (2001)
Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith
Abstract. We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they do not...
Mutually independent commitments (2001)
Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leo Reyzin, Adam Smith
We describe a new kind of commitment scheme in which two parties commit to values in a commitment stage, at the end of which we are assured that the values they have committed to cannot be correlated...
Quantum secret sharing for general access structures. E-print quantph/0001087 (2000)
We explore the conversion of classical secret sharing schemes to quantum ones, and how this can be used to give ecient qss schemes for general adversary structures. Our rst result is that quantum...
The Shift Towards Intellectual Capitalism (1999)
– the Role of Infocom Technologies “Whether this propensity [“to truck, barter, and exchange one thing for another”] be one of those original principles in human nature, of which no further...
Rectangular tiling in multi-dimensional arrays (1999)
We study the following tiling problem in d dimensions: given a d-dimensional rectangular array of non-negative numbers and an integer p, partition the array into at most p rectangular subarrays so...
Rectangular Tiling in Multi-Dimensional Arrays (1999)
We study the following tiling problem in d dimensions: given a d-dimensional rectangular array of non-negative numbers and an integer p, partition the array into at most p rectangular subarrays so...
Multiparty computation unconditionally secure against Q² adversary structures (1998)
Adversary Structures, Adam Smith, Anton Stiglic
We present here a generalization of the work done by Rabin and Ben-Or in [16]. We give a protocol for multiparty computation which tolerates any active adversary structure based on the existence of a...
Multiparty computation unconditionally secure against Q² adversary structures (1998)
Adversary Structures, Adam Smith, Anton Stiglic
We present here a generalization of the work done by Rabin and Ben-Or in [RB89]. We give a protocol for multiparty computation which tolerates any Q² active adversary structure based on the...
The effect of dietary composition on the water balance of laying hens. (1996)
Thesis (Ph. D.)--Open University, 1996.
An inquiry into the Nature and Causes of the Wealth of Nations (1992)
An inquiry into the Nature and Causes of the Wealth of Nations, Adam Smith. . - Chicago. NALUAF000211, Encyclopaedia Britannica. NAEDAF002087, 1992.
Traducción de: The Roaring '80s
Teoría de los sentimientos morales / A. Smith ; introd. de E. Nicol ; tr. por E. O'Gorman. (1978)
Smith, Adam, Nicol, Eduardo (introd.), O'Gorman, Edmundo (tr.)
Indagine sulla natura e le cause della ricchezza delle nazioni (1976)
Indagine sulla natura e le cause della ricchezza delle nazioni, Adam Smith. . - Milano. NALUAF000464, ISEDI. NAEDAF002865, 1976.
La ricchezza delle nazioni (1975)
La ricchezza delle nazioni, Adam Smith, a cura di Anna e Tullio Bagiotti. . - Torino. NALUAF000800, Utet. NAEDAF005148, 1975.
Investigación sobre la naturaleza y causa de la riqueza de las naciones (1958)
Smith, Adam, Cannan, Edwin (ed.), Franco, Gabriel (prelim. Y Tr.)
Traducción de: The Wealth of Nations
A Catalgue of books belonging to Adam Smith, Esqr. 1781 (1781)
東京大学経済学部所蔵の、アダム･スミス蔵書目録 原本を電子化したもの（参考として1995年に複製出版された際の「刊行にあたって」を添付）。
Cortez-Retamozo, Virna, Swirski, Filip K., Waterman, Peter, Yuan, Hushan, Figueiredo, Jose Luiz, Newton, Andita P., ...
Eosinophils are multifunctional leukocytes that degrade and remodel tissue extracellular matrix through production of proteolytic enzymes, release of proinflammatory factors to initiate and propagate...