Result 101 to 120 from 265 total
Efficient rational secret sharing in standard communication networks (English)
IACR Cryptology ePrint Archive 2008, 488 (2008).
101
Signing a linear subspace: signature schemes for network coding (English)
IACR Cryptology ePrint Archive 2008, 316 (2008).
102
Complete fairness in multi-party computation without an honest majority (English)
IACR Cryptology ePrint Archive 2008, 458 (2008).
103
Complete fairness in secure two-party computation (English)
IACR Cryptology ePrint Archive 2008, 303 (2008).
104
Partial fairness in secure two-party computation (English)
IACR Cryptology ePrint Archive 2008, 206 (2008).
105
Collusion-free multiparty computation in the mediated model (English)
IACR Cryptology ePrint Archive 2008, 533 (2008).
106
Cryptography (English)
Wiley Encyclopedia of Computer Science and Engineering (2008).
107
Improving the round complexity of VSS in point-to-point networks (English)
ICALP (2), 499-510 (2008).
108
How to encrypt with a malicious random number generator (English)
FSE, 303-315 (2008).
109
Aggregate message authentication codes (English)
CT-RSA, 155-169 (2008).
110
Predicate encryption supporting disjunctions, polynomial equations, and inner products (English)
EUROCRYPT, 146-162 (2008).
111
Which languages have 4-round zero-knowledge proofs? (English)
TCC, 73-88 (2008).
112
Universally composable multi-party computation with an unreliable common reference string (English)
TCC, 142-154 (2008).
113
Bridging game theory and cryptography: recent results and future directions (English)
TCC, 251-272 (2008).
114
Complete fairness in secure two-party computation (English)
STOC, 413-422 (2008).
115
Universally-composable two-party computation in two rounds. (English)
Menezes, Alfred (ed.), Advances in cryptology ‒ CRYPTO 2007. 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19‒23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74142-8/pbk). Lecture Notes in Computer Science 4622, 111-129 (2007).
116
Which languages have 4-round zero-knowledge proofs?. (English)
Electron. Colloq. Comput. Complex. 14, No. 065 (2007).
117
On achieving the “best of both worlds” in secure multiparty computation. (English)
STOC’07. Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, CA, USA, June 11‒13, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-631-8). 11-20 (2007).
118
Space-efficient bounded model checking. (English)
Comput. Res. Repos. 2007, Article No. 0710.4629 (2007).
119
Efficient cryptographic protocols based on the hardness of learning parity with noise. (English)
Galbraith, Steven D. (ed.), Cryptography and coding. 11th IMA international conference, Cirencester, UK, December 18‒20, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77271-2/pbk). Lecture Notes in Computer Science 4887, 1-15 (2007).
120
Result 101 to 120 from 265 total
Start
Contact
Print
General Help
