JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Systematizing Secure Computation
PROCEED Systematizing Secure Computation Protocol Information Form
Sign in to Google
to save your progress.
Learn more
Paper URL
Your answer
Paper Title
Your answer
Authors/Team
Your answer
Venue
Your answer
Protocol name / nickname
Note: If a paper has multiple protocols, please submit one form for each.
Your answer
Adversary
Adversary malicousness
Semi-honest
Covert
Rational
Malicious
Other:
Clear selection
Adversary dynamicity
Static
Adaptive
Mobile
Other:
Clear selection
Mixed Adversaries?
Adversary Structures?
Max corrupted parties
< n/4
< n/3
< n/2
< n
Other:
Clear selection
Security
Security type
If hybrid, select highest
Cryptographic
Statistical
Perfect
Clear selection
Fairness
None
Partial
Fair abort
Guaranteed output
Clear selection
Composability
None / not known
Parallel composable
Concurrent composable
Universally composable
Clear selection
Hybrid security?
Leakage secure?
Computational Assumption Type(s)
OWF / TDP / RO / OT / etc.
Your answer
Specific assumptions
Your answer
Execution Environment
Private channels?
Broadcast channel?
Setup assumption
None
PKI
CRS
Other:
Clear selection
Efficiency
Online communication complexity per gate
Cubic
Quadratic
Near-linear
Linear
Clear selection
Constant online rounds?
Preprocessing
in circuit size
Superlinear
Linear
Sublinear
None
Clear selection
If you have performed benchmarks, please provide a brief description
Your answer
Functionality
Computable functions
All functions
Other:
Clear selection
Function representation
Boolean circuit
Arithmetic circuit
RAM
Other:
Clear selection
Reactive functionalities?
Implementation exists?
Further Information / Remarks
Your answer
Submit
Clear form
Never submit passwords through Google Forms.
This form was created inside of Yale University.
Report Abuse
Forms
