skills/cryptography-writing/references/abstract-introduction-evidence.md

# Source evidence for abstract and introduction guidance

Study date: 2026-09-06. This companion is optional: read it for source examples or provenance, not for every writing edit.

The corpus comprises 50 papers ranked by exact-proceedings-DOI OpenAlex citations within a screened candidate set, plus three explicitly separate NISC supplements. Discovery used 19 title queries (100 results each), 91 venue-specific candidates, publisher/IACR verification, and manual DOI resolution. The final eligibility ledger retained 140 papers. This is not an exhaustive global top-50 claim; source coverage, title vocabulary, version handling, age, and the chosen MPC boundary affect the ranking. No citation counts are frozen into writing rules.

All 53 abstracts and complete introductions were read. The analysis is qualitative: it identifies useful rhetorical choices, not a causal relationship between style and citation impact. Metadata describes the original conference; locators below describe the exact prose inspected. Some texts are later full versions. Technical claims and historical first/best statements require fresh verification before reuse.

## How to select an example

| Writing decision | Examples |
| --- | --- |
| Precise question rather than broad history | P04 |
| Result and costs organized by phase | P01, P08, P19 |
| Missing conjunction of properties | P05 |
| Compiler interface followed by consequences | P10 |
| Concrete application motivates an interface | P02, P03, P06, P13, P15 |
| Abstract states the improvement and its price | P17, P27 |
| New security/system model motivated by a failure | P07, P20, P35, P46 |
| Natural failed approach earns the technical idea | P16, P38, P41, P43 |
| Explicit comparisons and evidence boundaries | P26, P28, P29, P33, P48, P49 |
| Reuse/output feedback motivates a resource boundary | N01, N02, N03 |

These examples illustrate alternatives. They do not prescribe paragraph counts, headings, citation bans, required contribution bullets, or a fixed placement for related work.

## Exact reading sources

PDF pages are one-based. The version column is authoritative for prose attribution; a conference year is not the revision date.

| ID | Paper and original venue | Text version | Abstract and introduction locators |
| --- | --- | --- | --- |
| P01 | [Multiparty Computation from Somewhat Homomorphic Encryption](https://eprint.iacr.org/2011/535.pdf) (CRYPTO 2012) | ePrint 2011/535 author full version, 46 pages | PDF p. 1; Section 1 including 1.1, PDF pp. 1–4; stops before Section 2 |
| P02 | [Efficient Private Matching and Set Intersection](https://www.pinkas.net/PAPERS/FNP04.pdf) (EUROCRYPT 2004) | Author-hosted EUROCRYPT 2004 paper; 18-page version. | PDF p.1, Abstract; PDF pp.1–2, §1; ends before §2 Background and Related Work |
| P03 | [Privacy Preserving Data Mining](https://www.cs.ru.nl/~jhh/pub/secsem/lindell2000privacy-data-mining.pdf) (CRYPTO 2000) | University-hosted author full version, 26 pages; first-page note identifies earlier CRYPTO version | PDF p. 1; Section 1 including 1.1–1.2, PDF pp. 2–3 (printed pp. 1–2); stops before Section 2 |
| P04 | [Extending Oblivious Transfers Efficiently](https://www.iacr.org/archive/crypto2003/27290145/27290145.pdf) (CRYPTO 2003) | IACR CRYPTO 2003 proceedings PDF, 17 pages | PDF p. 1 (proceedings p. 145); Section 1, PDF pp. 1–5 (proceedings pp. 145–149); stops before Section 2 |
| P05 | [A Framework for Efficient and Composable Oblivious Transfer](https://eprint.iacr.org/2007/348.pdf) (CRYPTO 2008) | ePrint 2007/348 revision dated January 23, 2019, 28 pages | PDF p. 1; Section 1 including 1.1–1.3, PDF pp. 1–5; stops before Section 2 |
| P06 | [Privacy-Preserving Set Operations](https://users.ece.cmu.edu/~dawnsong/papers/set-int-full.pdf) (CRYPTO 2005) | Author-hosted full version, 42 pages; first-page note identifies shorter CRYPTO 2005 version | PDF p. 1; Section 1, PDF pp. 1–3; stops before Section 2, Related Work |
| P07 | [Universally Composable Commitments](https://www.cryptoplexity.informatik.tu-darmstadt.de/media/crypt/publications_1/fischlincomposable2001.pdf) (CRYPTO 2001) | Author-hosted full version dated July 10, 2001, 34 pages | PDF p. 1; Section 1 including 1.1–1.2, PDF pp. 3–7 (printed pp. 1–5); stops before Section 2 |
| P08 | [Multiparty Computation from Threshold Homomorphic Encryption](https://www.iacr.org/archive/eurocrypt2001/20450279.pdf) (EUROCRYPT 2001) | EUROCRYPT 2001 proceedings, pp.279–298. | PDF p.1 (printed p.279), Abstract; PDF pp.1–2 (279–280), §1; also read §2 Our Results and §2.1 on pp.2–3 |
| P09 | [General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme](https://crypto.ethz.ch/publications/files/CrDaMa00.pdf) (EUROCRYPT 2000) | 18-page author-hosted EUROCRYPT2000 version; corrupt embedded font extraction, abstract and introduction read through rendered page1 and OCR pages1–2. | PDF p.1, Abstract; PDF pp.1–2, §1; ends before §2 Previous Work |
| P10 | [Founding Cryptography on Oblivious Transfer - Efficiently](https://web.cs.ucla.edu/~sahai/work/web/2008%20Publications/Crypto2008.pdf) (CRYPTO 2008) | Author-hosted CRYPTO 2008 proceedings PDF, 20 pages | PDF p. 1 (proceedings p. 572); Section 1 including 1.1–1.2, PDF pp. 2–6 (proceedings pp. 573–577); stops before Section 2 |
| P11 | [Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation](https://iacr.org/archive/tcc2006/38760286/38760286.pdf) (TCC 2006) | IACR archive PDF of TCC 2006 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–4; Section 2 starts PDF page 5 |
| P12 | [Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE](https://www.iacr.org/archive/eurocrypt2012/72370479/72370479.pdf) (EUROCRYPT 2012) | Exact six-author merged EUROCRYPT2012 proceedings version; first-page merger footnote. | PDF p.1, Abstract; PDF pp.2–6, §1 including §§1.1–1.3; ends before §2 Preliminaries |
| P13 | [Keyword Search and Oblivious Pseudorandom Functions](https://iacr.org/archive/tcc2005/3378_304/3378_304.pdf) (TCC 2005) | IACR archive PDF of TCC 2005 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–3; Section 2 starts PDF page 4 |
| P14 | [An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries](https://eprint.iacr.org/2008/049.pdf) (EUROCRYPT 2007) | 36-page ePrint full version; first-page footnote identifies EUROCRYPT 2007 extended abstract. | PDF p.1, Abstract; PDF pp.2–5 (printed pp.1–4), §1; ends before §2 Preliminaries |
| P15 | [Priced Oblivious Transfer: How to Sell Digital Goods](https://www.iacr.org/archive/eurocrypt2001/20450118.pdf) (EUROCRYPT 2001) | EUROCRYPT 2001 proceedings, pp.118–134. | PDF p.1 (118), Abstract; PDF pp.1–4 (118–121), §1; ends before §2 Preliminaries |
| P16 | [A New Approach to Practical Active-Secure Two-Party Computation](https://eprint.iacr.org/2011/091.pdf) (CRYPTO 2012) | ePrint 2011/091 author full version, 42 pages | PDF p. 1; Section 1 including 1.1–1.2, PDF pp. 3–6; stops before Section 2 |
| P17 | [Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits Using Half Gates](https://eprint.iacr.org/2014/756.pdf) (EUROCRYPT 2015) | 28-page author/ePrint version headed 'In 34th Eurocrypt, Sofia, Bulgaria, April 2015'. | PDF p.1, Abstract; PDF pp.1–4, §1, §§1.1–1.2; ends before §2 Preliminaries |
| P18 | [More Efficient Constant-Round Multi-party Computation from BMR and SHE](https://eprint.iacr.org/2016/156.pdf) (TCC 2016) | Author ePrint 2016/156, revised 2017-02-24; metadata reports corrected miscounts and typos; TCC 2016 proceedings identity verified separately | Abstract, PDF page 1; Section 1, PDF pages 1–6; Section 2 starts within PDF page 6 |
| P19 | [Semi-Homomorphic Encryption and Multiparty Computation](https://eprint.iacr.org/2010/514.pdf) (EUROCRYPT 2011) | 24-page author/ePrint full version associated with EUROCRYPT 2011. | PDF p.1, Abstract; PDF pp.1–3, §1 including Related Work and Notation; ends before §2 |
| P20 | [Universally Composable Security with Global Setup](https://iacr.org/archive/tcc2007/43920061/43920061.pdf) (TCC 2007) | IACR archive PDF of TCC 2007 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–7; Section 2 starts within PDF page 7 |
| P21 | [Two Round Multiparty Computation via Multi-key FHE](https://eprint.iacr.org/2015/345.pdf) (EUROCRYPT 2016) | 33-page author/ePrint version dated February27,2016, associated with EUROCRYPT2016. | PDF p.1, Abstract; PDF pp.3–4 (printed pp.2–3), §1; ends before §2 Overview of Our Techniques |
| P22 | [Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection](https://iacr.org/archive/tcc2009/54440575/54440575.pdf) (TCC 2009) | IACR archive PDF of TCC 2009 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–5; Section 2 starts within PDF page 5 |
| P23 | [Function Secret Sharing](https://www.iacr.org/archive/eurocrypt2015/90560300/90560300.pdf) (EUROCRYPT 2015) | 30-page IACR-hosted EUROCRYPT2015 version. | PDF p.1, Abstract; PDF pp.2–6, §1 including §§1.1–1.2; ends before §2 Function Secret Sharing |
| P24 | [Overdrive: Making SPDZ Great Again](https://eprint.iacr.org/2017/1230.pdf) (EUROCRYPT 2018) | 34-page ePrint/author version associated with EUROCRYPT2018. | PDF p.1, Abstract; PDF pp.1–3, §1; ends before §2 Preliminaries |
| P25 | [Ciphers for MPC and FHE](https://encrypto.de/papers/ARSTZ15.pdf) (EUROCRYPT 2015) | Author-hosted EUROCRYPT2015 proceedings, pp.430–454; original conference cipher version. | PDF p.1 (430), Abstract; PDF pp.1–4 (430–433), §1; ends before §2 Schemes |
| P26 | [Scalable and Unconditionally Secure Multiparty Computation](https://www.iacr.org/archive/crypto2007/46220565/46220565.pdf) (CRYPTO 2007) | IACR CRYPTO 2007 archive PDF, 18 pages | PDF p. 1; Section 1, PDF pp. 1–3; stops before Section 2 on PDF p. 4 |
| P27 | [Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries](https://iacr.org/archive/tcc2008/49480151/49480151.pdf) (TCC 2008) | IACR archive PDF of TCC 2008 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–4; Section 2 starts within PDF page 4 |
| P28 | [Efficient Pseudorandom Correlation Generators: Silent OT Extension and More](https://www.iacr.org/archive/crypto2019/116940471/116940471.pdf) (CRYPTO 2019) | IACR CRYPTO 2019 archive extended abstract, 30 pages | PDF pp. 1–2; Section 1 including 1.1–1.2, PDF pp. 2–11; stops before Section 2, Overview of Our Techniques |
| P29 | [Perfectly-Secure MPC with Linear Communication Complexity](https://iacr.org/archive/tcc2008/49480207/49480207.pdf) (TCC 2008) | IACR archive PDF of TCC 2008 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–3; Section 2 starts within PDF page 3 |
| P30 | [Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation](https://iacr.org/archive/tcc2005/3378_342/3378_342.pdf) (TCC 2005) | IACR TCC 2005 archive PDF; PDF title ends “applications to secure distributed computing”, unlike indexed “Applications to Secure Computation” | Abstract, PDF page 1; Section 1, PDF pages 1–5; Section 2 starts within PDF page 5 |
| P31 | [Simulatable Adaptive Oblivious Transfer](https://shelat.khoury.northeastern.edu/dl/CNS07.pdf) (EUROCRYPT 2007) | 25-page author-hosted full version explicitly identifying EUROCRYPT2007 extended abstract. | PDF p.1, Abstract; PDF pp.1–5, §1 including §§1.1–1.3; ends before §2 Definitions |
| P32 | [Universally Composable Multi-party Computation Using Tamper-Proof Hardware](https://www.cs.umd.edu/~jkatz/papers/ec07b.pdf) (EUROCRYPT 2007) | 14-page author-hosted EUROCRYPT2007 paper. | PDF p.1, Abstract; PDF pp.1–6, §1 Motivation including §§1.1–1.3; ends before §2 Modeling Tamper-Proof Hardware |
| P33 | [Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption](https://iacr.org/archive/crypto2003/27290247/27290247.pdf) (CRYPTO 2003) | IACR CRYPTO 2003 proceedings PDF, 17 pages | PDF p. 1 (proceedings p. 247); Section 1, PDF pp. 1–3 (proceedings pp. 247–249); stops before Section 2 |
| P34 | [Distributed Point Functions and Their Applications](https://iacr.org/archive/eurocrypt2014/84410245/84410245.pdf) (EUROCRYPT 2014) | 18-page IACR-hosted EUROCRYPT2014 version. | PDF p.1, Abstract; PDF pp.2–5, §1; ends before §2 Definitions and notation |
| P35 | [Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries](https://iacr.org/archive/tcc2007/43920137/43920137.pdf) (TCC 2007) | IACR archive PDF of TCC 2007 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–5; Section 2 starts within PDF page 5 |
| P36 | [PSI from PaXoS: Fast, Malicious Private Set Intersection](https://eprint.iacr.org/2020/193.pdf) (EUROCRYPT 2020) | 36-page author/ePrint version associated with EUROCRYPT2020. | PDF p.1, Abstract; PDF pp.1–3, §1 including §§1.1–1.3; ends before §2 Preliminaries |
| P37 | [Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography](https://eprint.iacr.org/2010/106.pdf) (EUROCRYPT 2010) | 32-page author/ePrint full version associated with EUROCRYPT2010. | PDF p.1, Abstract; PDF pp.1–6, §1 including §§1.1–1.3; ends before §2 The Model |
| P38 | [Two-Round Secure MPC from Indistinguishability Obfuscation](https://iacr.org/archive/tcc2014/83490162/83490162.pdf) (TCC 2014) | IACR archive PDF of TCC 2014 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–7; Section 2 starts within PDF page 7 |
| P39 | [Round-Optimal Secure Two-Party Computation](https://web.cs.ucla.edu/~rafail/PUBLIC/64.pdf) (CRYPTO 2004) | Author-hosted version, 24 pages; author publication page identifies CRYPTO 2004 | PDF p. 1; Section 1 including 1.1–1.3, PDF pp. 2–4; stops before Section 2 on PDF p. 4 |
| P40 | [Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator](https://www.iacr.org/archive/crypto2005/36210372/36210372.pdf) (CRYPTO 2005) | IACR CRYPTO 2005 archive PDF, 17 pages | PDF p. 1; Section 1 including 1.1, PDF pp. 1–5; stops before Section 2 |
| P41 | [Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer](https://iacr.org/archive/tcc2011/65970324/65970324.pdf) (TCC 2011) | IACR archive PDF of TCC 2011 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–6; Section 2 starts within PDF page 6 |
| P42 | [Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields](https://ir.cwi.nl/pub/15493/15493A.pdf) (CRYPTO 2006) | CWI-hosted scanned CRYPTO 2006 proceedings PDF, 16 pages; read visually from rendered pages | PDF p. 1 (proceedings p. 521); Section 1, PDF pp. 2–5 (proceedings pp. 522–525); stops before Section 2 on PDF p. 5 |
| P43 | [Fast Secure Two-Party ECDSA Signing](https://eprint.iacr.org/2017/552.pdf) (CRYPTO 2017) | Current ePrint 2017/552 full version, 41 pages; first-page note says it corrects the 2021 journal range proof and adds implementation appendix | PDF p. 1, including version note; Section 1 including 1.1–1.3, PDF pp. 1–6; stops before Section 2 |
| P44 | [Actively Secure OT Extension with Optimal Overhead](https://eprint.iacr.org/2015/546.pdf) (CRYPTO 2015) | ePrint 2015/546 updated full version with 2022 correction notice, 22 pages | PDF p. 1, including correction notice; Section 1, PDF pp. 1–4; Table 1 on PDF p. 3; stops before Section 2 |
| P45 | [On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions](https://eprint.iacr.org/2004/116.pdf) (EUROCRYPT 2003) | 30-page full version dated May17,2004; first-page footnote identifies EUROCRYPT2003 extended abstract. | PDF p.1, Abstract; PDF pp.2–6 (printed pp.1–5), §1; ends before §2 Review of UC security |
| P46 | [Universally Composable Synchronous Computation](https://iacr.org/archive/tcc2013/77850475/77850475.pdf) (TCC 2013) | IACR archive PDF of TCC 2013 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–4; Section 2 starts within PDF page 4 |
| P47 | [Efficient Two-Party Secure Computation on Committed Inputs](https://www.cs.cornell.edu/~shmat/shmat_eurocrypt07.pdf) (EUROCRYPT 2007) | 18-page author-hosted EUROCRYPT2007 version; end of introduction delegates proofs to full version. | PDF p.1, Abstract; PDF pp.1–3, §1; ends before §2 Related Work on Constant-Round 2PC and Committed OT |
| P48 | [Breaking the Circuit Size Barrier for Secure Computation under DDH](https://eprint.iacr.org/2016/585.pdf) (CRYPTO 2016) | ePrint 2016/585 author full version dated September 2, 2016, 47 pages | PDF p. 1; Section 1 including 1.1–1.3, PDF pp. 1–6; stops before Section 2 |
| P49 | [LEGO for Two-Party Secure Computation](https://iacr.org/archive/tcc2009/54440364/54440364.pdf) (TCC 2009) | IACR archive PDF of TCC 2009 paper; downloaded 2026-09-06 | Abstract, PDF page 1; Section 1, PDF pages 1–3; Section 2 starts within PDF page 3 |
| P50 | [Secure Computation of the k th -Ranked Element](https://theory.stanford.edu/~nmishra/Papers/secureComputationKthRankedElement.pdf) (EUROCRYPT 2004) | 14-page coauthor-hosted version dated March6,2004, corresponding to EUROCRYPT2004; not the later journal paper. | PDF p.1, Abstract; PDF pp.1–4, §1 and §1.1; ends before §2 Two-party Computation of the kth Element |
| N01 | [Efficient Non-interactive Secure Computation](https://www.cse.iitb.ac.in/~mp/pub/nisc-proceedings.pdf) (EUROCRYPT 2011) | 20-page author-hosted proceedings version, EUROCRYPT2011; explicit NISC topical supplement. | PDF pp.1–2, Abstract; PDF pp.2–5, §1 including §§1.1–1.2; ends before §2 Preliminaries |
| N02 | [Reusable Non-Interactive Secure Computation](https://www.iacr.org/archive/crypto2019/116940362/116940362.pdf) (CRYPTO 2019) | IACR CRYPTO 2019 archive PDF, 28 pages | PDF pp. 1–2; Section 1 including 1.1–1.2, PDF pp. 2–7; stops before Section 2, Overview of Our Techniques |
| N03 | [Mr NISC: Multiparty Reusable Non-Interactive Secure Computation](https://eprint.iacr.org/2020/221.pdf) (TCC 2020) | Author ePrint 2020/221, revised 2021-07-01; marked major revision of TCC 2020, including style improvements; PDF retains “Mr NISC” title | Abstract, PDF page 1; Section 1, PDF pages 3–9; Section 2 starts within PDF page 9; contents page excluded |

## Interpretation cautions

P12 is the merged six-author proceedings paper, not its similarly titled three-author precursor. P05, P18, P43, P45, and N03 use later author revisions. P44 carries a correction notice for the original security argument. P09/P11/P42 required visual reading or OCR. These sources remain useful examples of presentation with the stated version boundaries; they are not endorsements of every technical claim. P28 labels performance estimates and explicitly reports no implementation. A source's metaphor, priority language, or claim of practicality is not a reusable factual assertion.

The full dated ranking, candidate ledger, and original per-paper notes were retained by the original study. That optional archive is not a runtime dependency of this skill; use the primary URLs and version locators above. These MPC examples illustrate writing choices rather than supply universal conventions or technical claims for other areas.