Reachability Computation for Switching Diffusions: Finite Abstractions with Certifiable and Tuneable Precision Alessandro Abate Luca Bortolussi

Source URL: qav.comlab.ox.ac.uk

SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces ´ Erika Abrah´ am1 , John Abbott10 , Bernd Becker2 , Anna M. Bigatti3 , Martin Brain9 , Alessandro Cimatti4 , James H. Davenport5 ,

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic in computer science
• Computational complexity theory
• Formal methods
• Mathematics
• Electronic design automation
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Model checking

Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries

Source URL: acmccs.github.io

• Logic gates
• Cryptographic protocols
• Circuit complexity
• Theoretical computer science
• Complexity classes
• Garbled circuit
• Theory of computation
• Secure multi-party computation
• Multiplexer
• XOR gate
• OR gate
• NC

CPSC: Quantum Computation John Watrous, University of Calgary Lecture 1: Overview of quantum information January 10, 2006

Source URL: cs.uwaterloo.ca

• Quantum mechanics
• Physics
• Theoretical computer science
• Quantum information science
• Quantum computing
• Quantum states
• Quantum algorithms
• Qubit
• Quantum superposition
• Hadamard transform
• Quantum entanglement
• Matrix

CS 294 – Secure Computation February 16 and 18, 2016 Lecture 9 and 10: Malicious Security - GMW Compiler and Cut and Choose, OT Extension

Source URL: people.eecs.berkeley.edu

• Cryptographic protocols
• Electromagnetism
• Garbled circuit
• Secure multi-party computation
• IP
• Theory of computation
• NC
• Electronic circuit
• Applied mathematics
• Commitment scheme

FLANNEL: Adding computation to electronic mail during transmission Victoria Bellotti†, Nicolas Ducheneaut†¥, Mark Howard†, Christine Neuwirth*, Ian Smith†, Trevor Smith† † ¥

Source URL: trevor.smith.name

• Email
• Cyberspace
• Computing
• Computer-mediated communication
• Simple Mail Transfer Protocol
• MIME
• HTML email
• Mailbox provider
• Message transfer agent
• Gmail
• SMS
• Email alias

Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) The Design and Implementation of Typed Scheme: From Scripts to Programs? Sam Tobin-Hochstadt · Matthias Felleisen

Source URL: homes.sice.indiana.edu

• Type theory
• Software engineering
• Programming language theory
• Computing
• Scheme
• System F
• Type system
• HindleyMilner type system
• Racket
• Boolean data type
• Macro
• Typing environment

Quantum FHE (Almost) As Secure as Classical Zvika Brakerski∗ Abstract Fully homomorphic encryption schemes (FHE) allow to apply arbitrary efficient computation to encrypted data without decrypting it first. In Quantum

Source URL: eprint.iacr.org

• Cryptography
• Post-quantum cryptography
• Lattice-based cryptography
• Models of computation
• Homeomorphisms
• Homomorphic encryption
• Quantum computing
• Lattice
• Learning with errors
• RSA
• One-time pad
• Quantum circuit

A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the

Source URL: www.pepper-project.org

Cambridge University Press3 - Secure Multiparty Computation and Secret Sharing Ronald Cramer, Ivan Bjerre Damgård and Jesper Buus Nielsen Table of Contents More information

Source URL: users-cs.au.dk

• Cryptography
• Public-key cryptography
• Secret sharing
• Secure multi-party computation
• Cryptographic protocol
• Ivan Damgrd