On the public citation graph

Concrete Multiplicative Complexity of Symmetric Functions

https://doi.org/10.1007/11821069_16
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11593447_5openalex-snapshot
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
inferredcites →https://doi.org/10.1007/3-540-44987-6_18openalex-snapshot
Multiparty Computation from Threshold Homomorphic Encryption
inferredcites →https://doi.org/10.1007/3-540-51083-4_47openalex-snapshot
The multiplicative complexity of boolean functions
inferredcites →https://doi.org/10.1007/978-3-642-82865-2_7openalex-snapshot
The Knapsack as a Nonlinear Function
inferredcites →https://doi.org/10.1007/978-3-662-03338-8openalex-snapshot
Algebraic Complexity Theory
inferredcites →https://doi.org/10.1007/bf01074878openalex-snapshot
On realization of quadratic boolean functions by systems of linear equations
inferredcites →https://doi.org/10.1007/bf01683282openalex-snapshot
On the combinational complexity of certain symmetric Boolean functions
inferredcites →https://doi.org/10.1007/s001450010011openalex-snapshot
Short Non-Interactive Cryptographic Proofs
inferredcites →https://doi.org/10.1016/0304-3975(92)90235-8openalex-snapshot
The multiplicative complexity of quadratic boolean forms
inferredcites →https://doi.org/10.1016/s0304-3975(99)00182-6openalex-snapshot
On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1)
inferredcites →https://doi.org/10.1145/62212.62213openalex-snapshot
Completeness theorems for non-cryptographic fault-tolerant distributed computation
inferredcites →https://doi.org/10.1145/62212.62214openalex-snapshot
Multiparty unconditionally secure protocols
inferredcites →https://doi.org/10.1145/800116.803750openalex-snapshot
A 2.5 n-lower bound on the combinational complexity of Boolean functions
inferredcites →https://doi.org/10.1515/crll.1852.44.93openalex-snapshot
Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-17659-4_5openalex-snapshot
Efficient Circuit-Based PSI with Linear Communication
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_15openalex-snapshot
Faster Homomorphic Encryption is not Enough: Improved Heuristic for Multiplicative Depth Minimization of Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_5openalex-snapshot
Efficient Circuit-Based PSI via Cuckoo Hashing
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_23openalex-snapshot
A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-30042-4openalex-snapshot
Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-39884-1_23openalex-snapshot
GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
inferred← citeshttps://doi.org/10.1007/s12095-021-00547-2openalex-snapshot
Differential uniformity and linearity of S-boxes by multiplicative complexity
inferred← citeshttps://doi.org/10.1109/sp.2015.32openalex-snapshot
TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits
inferred← citeshttps://doi.org/10.1134/s0965542515040119openalex-snapshot
On the multiplicative complexity of some Boolean functions
inferred← citeshttps://doi.org/10.1145/2484313.2484369openalex-snapshot
Faster secure two-party computation with less memory
inferred← citeshttps://doi.org/10.1145/2744769.2744808openalex-snapshot
Compacting privacy-preserving k-nearest neighbor search using logic synthesis
inferred← citeshttps://doi.org/10.1145/2810103.2813678openalex-snapshot
Automated Synthesis of Optimized Circuits for Secure Computation
inferred← citeshttps://doi.org/10.26483/ijarcs.v8i7.4142openalex-snapshot
AN IMPROVEMENT OF PRIVACY PRESERVING USING BLOCK-TINY ENCRYPTION ALGORITHM: CLOUD APPROACH
inferred← citeshttps://doi.org/10.3103/s0278641915010069openalex-snapshot
On the multiplicative complexity of quasi-quadratic Boolean functions
inferred← citeshttps://doi.org/10.3233/fi-2016-1368openalex-snapshot
On the Multiplicative Complexity of Boolean Functions
inferred← citeshttps://doi.org/10.4213/dm1308openalex-snapshot
Мультипликативная сложность некоторых функций алгебры логики
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.