Filters








733 Hits in 1.1 sec

Mechanism for the T4 lymphopenia of AIDS Silvio Micali

S. Micali
1993 Proceedings of the National Academy of Sciences of the United States of America  
I suggest that the T4 lymphopenia of AIDS may be caused by antibodies raised against the human immunodeficiency virus that block the generation of T4 cells.
doi:10.1073/pnas.90.23.10982 pmid:7902577 pmcid:PMC47905 fatcat:3kfi3a5p7bdz5pjb7sqlv25abm

Knightian Auctions [article]

Alessandro Chiesa and Silvio Micali and Zeyuan Allen Zhu
2011 arXiv   pre-print
We study single-good auctions in a setting where each player knows his own valuation only within a constant multiplicative factor δ in (0,1), and the mechanism designer knows δ. The classical notions of implementation in dominant strategies and implementation in undominated strategies are naturally extended to this setting, but their power is vastly different. On the negative side, we prove that no dominant-strategy mechanism can guarantee social welfare that is significantly better than that
more » ... hievable by assigning the good to a random player. On the positive side, we provide tight upper and lower bounds for the fraction of the maximum social welfare achievable in undominated strategies, whether deterministically or probabilistically.
arXiv:1112.1147v1 fatcat:3gmtmvoeczdoneua3pauvqwj6a

Computationally-Sound Proofs [chapter]

Silvio Micali
1998 Logic Colloquium '95  
Goldwasser, Micali, and Rackoff [21] introduced and first exemplified the notion of a zero-knowledge proof system, and Goldreich, Micali, and Wigderson [20] showed that all languages in N P possess  ...  Let us first quickly recall interactive Turing machines (ITMs) as defined by Goldwasser, Micali, and Rackoff [21] .  ... 
doi:10.1007/978-3-662-22108-2_13 dblp:conf/logicColl/Micali95 fatcat:rlibzkyj2ba6pbkhmf6sqfsahu

Knightian Robustness of Single-Parameter Domains [article]

Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu
2014 arXiv   pre-print
We consider players that have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player i has about the profile of true valuations, θ^*, consists of a set of distributions, from one of which θ_i^* has been drawn. We prove a "robustness" theorem for Knightian players in single-parameter domains: every mechanism that is weakly dominant-strategy truthful for classical players continues to be well-behaved for Knightian players that choose undominated strategies.
arXiv:1403.6411v1 fatcat:tftdaib2arhrvay77oh3fruhry

Bridging Utility Maximization and Regret Minimization [article]

Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu
2014 arXiv   pre-print
We relate the strategy sets that a player ends up with after refining his own strategies according to two very different models of rationality: namely, utility maximization and regret minimization.
arXiv:1403.6394v1 fatcat:vvs647nnmrdptpmmqbacsbjudm

Amortized E-Cash [chapter]

Moses Liskov, Silvio Micali
2002 Lecture Notes in Computer Science  
doi:10.1007/3-540-46088-8_1 fatcat:biv7nuuihrcazd7ll7hnaib76q

Transitive Signature Schemes [chapter]

Silvio Micali, Ronald L. Rivest
2002 Lecture Notes in Computer Science  
For example, the scheme proposed by Goldwasser, Micali, and Rivest [10] is satisfactory here as a vertex signature scheme.  ... 
doi:10.1007/3-540-45760-7_16 fatcat:4s6f67he2bfsdpwl2ntfrhlsdm

Physically Observable Cryptography [chapter]

Silvio Micali, Leonid Reyzin
2004 Lecture Notes in Computer Science  
(Another notion from the past that seemed insignificant was the method of outputting bits backwards in the Blum-Micali generator.  ...  Using maximal (or durable or minimal) one-way permutations in the Blum-Micali construction does not yield PO indistinguishable generators.  ... 
doi:10.1007/978-3-540-24638-1_16 fatcat:tyvucrxggrbvxgcjbko6hjlria

Computational principal-agent problems

Pablo D. Azar, Silvio Micali
2018 Theoretical Economics  
Furthermore, our earlier results Azar and Micali (2012) and followup work by Guo et al. (2015) focus on giving alternative characterizations of computational complexity classes as sets of problems  ...  We remark that-like our results in this paper-the results in Azar and Micali (2012) and Guo et al. (2015) use proper scoring rules to incentivize the agent to compute a large sum in a truthful manner  ... 
doi:10.3982/te1815 fatcat:agdny7vmmbcipe7bj6reobsb24

Fair-Zero Knowledge [chapter]

Matt Lepinski, Silvio Micali, Abhi Shelat
2005 Lecture Notes in Computer Science  
We can also make a uniZK system for CIRCUIT-SAT by combining the single-theorem protocol of Damgärd [Dam92] with the multi-theorem techniques of Blum, De Santis, Micali and Persiano.  ...  Constructing uniZK We can construct a uniZK system based on the hardness of the quadratic residuosity problem[GM84], for Blum integers, by modifying the protocol of Blum, De Santis, Micali and Persiano  ... 
doi:10.1007/978-3-540-30576-7_14 fatcat:j5w2i5e22fderixrgyzz2onvzy

Knowledge and Efficient Computation [chapter]

Silvio Micali
1986 Theoretical Aspects of Reasoning About Knowledge  
We informally discuss "knowledge complexity": a measure for the amount of knowledge that can be feasibly extracted from a communication. Our measure provides an answer to the following two questions: 1) How much knowledge should be communicated for proving a theorem? 2) How to prove correctness of cryptographic protocols? We sympathize with the readers who are distressed by the level of informality of this short abstract. Most of the material is contained in the reference [GMR]. We encourage the readers to consult it for precise definitions.
doi:10.1016/b978-0-934613-04-0.50029-6 fatcat:u346nlp46zcl3mdx6gla5aam3a

Knightian Robustness from Regret Minimization [article]

Alessandro Chiesa, Silvio Micali, Zeyuan Allen Zhu
2014 arXiv   pre-print
We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player i has about the profile of true valuations, θ^*, consists of a set of distributions, from one of which θ_i^* has been drawn. We analyze the social-welfare performance of the VCG mechanism, for unrestricted combinatorial auctions, when Knightian players that either (a) choose a regret-minimizing strategy, or (b) resort to regret minimization
more » ... only to refine further their own sets of undominated strategies, if needed. We prove that this performance is very good.
arXiv:1403.6409v2 fatcat:ttcg22mv3vbkrmatidrq5b3tny

Independent Zero-Knowledge Sets [chapter]

Rosario Gennaro, Silvio Micali
2006 Lecture Notes in Computer Science  
Introduction The notion of Zero Knowledge Sets (ZKS) was recently introduced by Micali, Rabin and Kilian in [19] .  ...  Micali et al. presented a very ingenious solution to this problem, based on a new form of commitment scheme (later termed mercurial commitments in [16] ).  ... 
doi:10.1007/11787006_4 fatcat:yhouohey6fb6lkd7a6aq7vy7um

Perfect implementation

Sergei Izmalkov, Matt Lepinski, Silvio Micali
2011 Games and Economic Behavior  
Closer to our concerns is secure computation, as introduced by Goldreich, Micali and Wigderson (1987) , improving on earlier results of Yao (1986) .  ...  Computer Science and Artificial Intelligence Laboratory, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 32 Vassar Street, Room G644, Cambridge, MA 02139; silvio  ... 
doi:10.1016/j.geb.2010.05.003 fatcat:dsacvjhudngwjixpjysdo5f5ya

Computationally Sound Proofs

Silvio Micali
2000 SIAM journal on computing (Print)  
Goldwasser, Micali, and Rackoff [21] introduced and first exemplified the notion of a zero-knowledge proof system, and Goldreich, Micali, and Wigderson [20] showed that all languages in N P possess  ...  Let us first quickly recall interactive Turing machines (ITMs) as defined by Goldwasser, Micali, and Rackoff [21] .  ... 
doi:10.1137/s0097539795284959 fatcat:qz4uw3n7fbecrkkzls7nrobsuq
« Previous Showing results 1 — 15 out of 733 results