The SMCL Language Specification

Nielsen, Janus Dam

doi:10.7146/brics.v14i9.22177

Cited by 3 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The other type rules are mainly as one would expect, for a complete treatment see [37]. In Figure 4.4 we present the type rule for assignment.…”

Section: Hoistabilitymentioning

confidence: 99%

“…We model this difference by using different transition systems for client-side expressions, client-side commands, server-side expressions, and serverside commands. The transition systems are fairly standard and we will not go into detail with these transition systems here, but refer to [37], the non-standard parts will be discussed below to some extent. The transition systems are used in the SC transition system described below.…”

Section: Timing and Termination Attacksmentioning

confidence: 99%

“…no timing leaks or noninterference. We would also like to prove the soundness of the typesystem sketched in this report and described in more detail in [37]. A formal treatment will give us solid testimony for the strong security of SMCL.…”

Section: Smclmentioning

confidence: 99%

See 2 more Smart Citations

A domain-specific programming language for secure multiparty computation

Nielsen

Schwartzbach

2007

Proceedings of the 2007 Workshop on Programming Languages and Analysis for Security

Self Cite

View full text Add to dashboard Cite

Creating tools with strong security guaranties which exploits the benefits obtained by combining confidential information without compromising it, is feasible and useful.In this progress report we document the research carried out so far to establish the feasibility of constructing useful tools which makes it possible to take advantage of secret information from multiple sources without revealing the information. We focus on the Secure Multiparty Computation Language (SMCL) a domain-specific language for Secure Multiparty Computation (SMC).We present the area of SMC along with a conceptual analysis highlighting the central concepts essential for a domain-specific language for SMC and present one realization of such a language SMCL. SMCL provides high-level abstractions and strong security guaranties to aid the programmer in producing programs for secure multiparty computation which do not reveal unintended information. We also provide a comprehensive survey of related work.We hereby demonstrate the feasibility of constructing a useful programming language with strong security guarantees for writing SMC programs. Furthermore we present a number of ideas for future work including further developments of SMC and ideas for new tools which provide access to confidential information without compromising it.iii

show abstract

“…The other type rules are mainly as one would expect, for a complete treatment see [37]. In Figure 4.4 we present the type rule for assignment.…”

Section: Hoistabilitymentioning

confidence: 99%

Section: Timing and Termination Attacksmentioning

confidence: 99%

See 1 more Smart Citation

A domain-specific programming language for secure multiparty computation

Nielsen

Schwartzbach

2007

Proceedings of the 2007 Workshop on Programming Languages and Analysis for Security

Self Cite

View full text Add to dashboard Cite

show abstract

“…Even though the pool of graduates was approximately 300,000 annually and growing, the relevant talent pool with language capabilities did not exceed 22,000; roughly 14,700 for English, 3,700 for French, 1,500 for Italian, 1,500 for German, and 600 for Spanish (AC Nielsen, 2009). In contrast, India had 198,000 suitable agents annually, which made Egypt 11% of India's size.…”

mentioning

confidence: 99%

The Quest for Global Expansion: Xceed Re‐Visited

Deeb

Eldin

Kamel

2014

E J Info Sys Dev Countries

View full text Add to dashboard Cite

Temporal Logics Beyond Regularity

Lange¹

2007

BRICS

View full text Add to dashboard Cite

Non-regular program correctness properties play an important role in the specification of unbounded buffers, recursive procedures, etc. This thesis surveys results about the relative expressive power and complexity of temporal logics which are capable of defining non-regular properties. In particular, it features Propositional Dynamic Logic of Context-Free Programs, Fixpoint Logic with Chop, the Modal Iteration Calculus, and Higher-Order Fixpoint Logic.<br /> <br />Regarding expressive power we consider two classes of structures: arbitrary transition systems as well as finite words as a subclass of the former. The latter is meant to give an intuitive account of the logics' expressive powers by relating them to known language classes defined in terms of grammars or Turing Machines. <br /> <br /> Regarding the computational complexity of temporal logics beyond regularity we focus on their model checking problems since their satisfiability problems are all highly undecidable. Their model checking complexities range between polynomial time and non-elementary.

show abstract

The SMCL Language Specification

Abstract: [No abstract available]

Cited by 3 publications

References 0 publications

A domain-specific programming language for secure multiparty computation

A domain-specific programming language for secure multiparty computation

The Quest for Global Expansion: Xceed Re‐Visited

Temporal Logics Beyond Regularity

Contact Info

Product

Resources

About