37
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Automata, Languages and Programming 

      Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

      other
      ,
      Springer Berlin Heidelberg

      Read this book at

      Buy book Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references20

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          How to generate and exchange secrets

          Andrew Yao (1986)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Security and Composition of Multiparty Cryptographic Protocols

              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              Founding crytpography on oblivious transfer

              Joe Kilian (1988)
                Bookmark

                Author and book information

                Book Chapter
                2002
                June 25 2002
                : 244-256
                10.1007/3-540-45465-9_22
                26398de4-e6e3-45a3-86bf-7d7f8b078a5b
                History

                Comments

                Comment on this book

                Book chapters

                Similar content2,867

                Cited by15