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

DOI10.1007/978-3-030-57852-7_5MaRDI QIDQ1997264zbMATH OpenOpenAlexFDO

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

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

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)