J. Bar-Ilan
D. Beaver
- Bar86.D. Barrington, "Bounded Width Polynomial Size Branching Programs Recognize Exactly those Languages in NC1. " Proc. of 18th STOC (1986), 1-5. Google Scholar
Digital Library
- BC88.M. Ben-Or, R. Cleve, "Computing Algebraic Formulas Using a Constant Number of Registers." Proc. of 20th STOC (1988), 254-257. Google ScholarDigital Library
- BE88.M. Ben-Or, R. EI-Yaniv, "interactive Consistency in Constant Expected Time." Unpublished Manuscript, 1988.Google Scholar
- Bea88b.D. Beaver. "Secure Multiparty Protocols Tolerating Half Faulty Processors." Technical Report TR-19-88 (1988), Harvard University.Google Scholar
- Bea88a.D. Beaver. "Distributed Non Cryptographic Oblivious Transfer with Constant Rounds Secret Function Evaluation." Technical Report TR-13-88 (1988), Harvard University.Google Scholar
- BGW88.M. Ben-Or, S. Goldwasser, A. Wigderson. "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation." Proc. of 20th STOC (1988), 1-10. Google ScholarDigital Library
- BR89.M. Ben-Or, T. Rabin. "Verifiable Secret Sharing and Multiparty Protocols with Honest Majority ." To appear, 21st STOC. Google ScholarDigital Library
- CCD88.D. Chaum, C. Crepeau, I. Damgard. "Multiparty Unconditionally Secure Protocols." Proc. of 20th STOC (1988), 11-19. Google ScholarDigital Library
- FM88.P. Feldman, S. Micali. "Optimal Algorithms for Byzantine Agreement." Proc. of 20th STOC (1988), 148-161. Google ScholarDigital Library
- GMW87.Goldreich, O., Micali, S., A. Wigderson. ~How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority." Proc. of 19th STOC (1987), 218-229. Google ScholarDigital Library
- Kil88.J. Kiliaa. "Founding Cryptography on Oblivious Transfer." Proc. of 20th STOC (1988), 20-29. Google ScholarDigital Library
- Rab88.T. Rabin. ~Robust Sharing of Secrets When the Dealer is Honest or Cheating." Masters Thesis, Hebrew University, 1988.Google Scholar
- Sha79.A. Shamir. "How to Share a Secret." CACM 22 (1979), 612-613. Google ScholarDigital Library
- Yao86.A. Yao. "How to Generate and Exchange Secrets." Proc. of 27th FOCS (19s6), 162-16 .Google Scholar
Index Terms
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Recommendations
Correlations in RC6 with a Reduced Number of Rounds
FSE '00: Proceedings of the 7th International Workshop on Fast Software EncryptionIn this paper the block cipher RC6 is analysed. RC6 is submitted as a candidate for the Advanced Encryption Standard, and is one of five finalists. It has 128-bit blocks and supports keys of 128, 192 and 256 bits, and is an iterated 20-round block ...
A Fault-Tolerant Systolic Sorter
A fault-tolerant systolic sorter design is proposed. An algorithm-based fault tolerance is achieved by testing the invariants of a systolic sorter during normal operation. Transient and permanent computation errors can be detected by using error-...
Neural Network-based Inherently Fault-tolerant Hardware Cryptographic Primitives without Explicit Redundancy Checks
Fault injection-based cryptanalysis is one of the most powerful practical threats to modern cryptographic primitives. Popular countermeasures to such fault-based attacks generally use some form of redundant computation to detect and react/correct the ...
Comments