Publications

Export 4 results:
[ Author(Desc)] Title Type Year
Filters: Keyword is Computation by Abstract Devices  [Clear All Filters]
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 
B
Bitansky N, Dachman-Soled D, Garg S, Jain A, Kalai YTauman, López-Alt A, Wichs D.  2013.  Why “Fiat-Shamir for Proofs” Lacks a Proof. Theory of Cryptography. :182-201.
D
Dachman-Soled D, Mahmoody M, Malkin T.  2014.  Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. :217-239.
Dachman-Soled D, Servedio RA.  2011.  A Canonical Form for Testing Boolean Function Properties. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :460-471.
P
Papamanthou C, Shi E, Tamassia R.  2013.  Signatures of Correct Computation. Theory of Cryptography. :222-242.