Computing boundary cycle of a pseudo-triangle polygon from its visibility graph

DOI10.1007/978-3-030-57852-7_5OpenAlexW3082636863MaRDI QIDQ1997264FDOQ1997264

Authors: Hossein Boomari, Soheila Farokhi 

Publication date: 1 March 2021

Full work available at URL: https://arxiv.org/abs/2002.06712

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of computing (68Qxx)

Cites Work

• Founding Cryptography on Oblivious Transfer – Efficiently
• Non-malleability amplification
• Advances in Cryptology – CRYPTO 2004
• New notions of security: achieving universal composability without trusted setup
• Title not available (Why is that?)
• A unified framework for concurrent security
• Theory of Cryptography
• On adaptively secure protocols
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Bounded-concurrent secure two-party computation without setup assumptions
• Lossy Trapdoor Functions and Their Applications
• Black-box constructions for secure computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Theory of Cryptography
• Round-efficient black-box construction of composable multi-party computation
• Black-box constructions of composable protocols without set-up
• Round-optimal black-box two-party computation
• Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way
• A unified framework for UC from only OT
• Constant-round black-box construction of composable multi-party computation protocol

This page was built for publication: Computing boundary cycle of a pseudo-triangle polygon from its visibility graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997264)