Institutional RISCS profile identifies Ran Canetti, his research in cryptographic protocols and his PhD from the Weizmann Institute. The profile image points to ran-Canetti-254x300.jpg.

Profile identifies the cryptographer and his research in theory, applications and authentication. The profile image points to hugo-bio.jpg. Affiliation fields differ, so no current appointment is inferred.

Cryptology ePrint Archive report2000/067. Abstract describes modular security analysis and concurrent composition. Received23December2000; current version revised12February2020; an extended abstract appeared at FOCS2001. The current revision is not the unchanged2001 text.

RFC5869, Informational, May2010. Sections2.2–2.3 specify extraction and expansion; §3.2 describes context information. Authors’ Addresses verifies full names Hugo Krawczyk and Pasi Eronen.

December2005. The title-page byline is M.Nystrom; Author’s Address onp.8 gives Magnus Nystrom. Section4.2, Test Case1, specifies a20-byte key consisting of hexadecimal0b bytes, ASCII message Hi There, and the HMAC-SHA-256 output. Section4.4 states the64-byte block size of SHA-256.

Author-hosted paper, byline Oded Goldreich. Printedp.107, preliminaries paragraph “Negligible, noticeable, and overwhelmingly high probabilities”, defines negligible probabilities by eventual domination by every inverse positive polynomial.

Author manuscript dated September1998; title page records ISW97 proceedings, LNCS1396 (1998), and LNCS1561 (1999). Sections2.2 and3.2 explain reductions and concrete security; section4 distinguishes the formal guarantee from its assumptions and limitations.

Authors project page identifies nauty and Traces as graph/digraph automorphism and canonical-labeling programs. Title/byline Brendan McKay and Adolfo Piperno; Documentation links the authors user guide and Practical Graph Isomorphism.

Author-maintained ANU mirror: users.cecs.anu.edu.au/~bdm/nauty/ . Summary identifies automorphism-group and canonical-labeling functionality and the included gtools suite; Documentation links the original1981 nauty design, Piperno’s Traces paper and the current joint algorithms paper. The linked manual is users.cecs.anu.edu.au/~bdm/nauty/nug29.pdf .

Author-hosted chapter4 draft of Foundations of Cryptography. Protocol Input Specification identifies an integer presented in unary as the security parameter; definitional treatment discusses efficient simulation and asymptotic probability bounds.

Primary source: docs.kernel.org/userspace-api/media/v4l/open.html

Verified locator: Opening and Closing Devices §§1.1.1–1.1.2 and 1.1.6: hardware interfaces, node types/naming and open/close/ioctl. Companion primary page docs.kernel.org/userspace-api/media/v4l/querycap.html §1.2: query supported functions and I/O methods with VIDIOC_QUERYCAP.

February1997, bylines H.Krawczyk, M.Bellare and R.Canetti. Title page and Status of This Memo classify the RFC as Informational; §§1–2 motivate and define HMAC. Full author identities are verified separately by the June1996 author manuscript Keying Hash Functions for Message Authentication, rather than inferred by expanding initials.

Author manuscript, title page dated June1996, exact full bylines Mihir Bellare, Ran Canetti and Hugo Krawczyk. Abstract and §§1.1–1.3 describe NMAC/HMAC, the shared-key authenticity problem and the relation between security and underlying hash-function assumptions. The title page identifies an abridged version in CRYPTO96 proceedings, LNCS1109.

Author-hosted manuscript dated26August1992, by Mihir Bellare and Oded Goldreich; author context www.wisdom.weizmann.ac.il/~oded/pok.html . Definition 3.1, printed p. 9, gives oracle extraction and knowledge error; section 4.4, printed p. 11, discusses the graph-isomorphism example and error 1/2. Author bibliography identifies CRYPTO92 proceedings, LNCS740, pp.390–420, published1993.

Alternate author-hosted manuscript: cseweb.ucsd.edu/~mihir/papers/pok.pdf . Both author-hosted manuscripts are dated 26 August 1992; the proceedings publication year remains 1993.

Primary source: www.kernel.org/doc/html/latest/userspace-api/media/v4l/buffer.html

Verified locator: §3.5 opening: multi-planar buffer as plane container. §3.5.2 v4l2_buffer.length is plane-array element count for the multi-planar API. §3.5.3 v4l2_plane.length is byte capacity, bytesused includes data_offset, and actual image-data size is bytesused minus data_offset.

Official API reference, Returns, node_match, edge_match and Examples. A false result reports non-isomorphism for the selected graph/attribute semantics; node and edge attributes are ignored unless matching functions are supplied.

Author-hosted primer dated30June2008. Sections1.1.2–1.2, printedpp.6–8, give prover/verifier and quantified completeness/soundness definitions; Construction1.3, pp.9–10, gives the random-relabeling graph-non-isomorphism protocol. Construction2.3 and its following simulation discussion, printedpp.26–28, treat graph-isomorphism zero knowledge; section2.3, pp.32–34, treats proofs of knowledge.

Primary source: www.kernel.org/doc/html/latest/userspace-api/media/v4l/yuv-formats.html

Verified locator: §2.7 subsampling discussion distinguishes centered/interstitial and co-sited chroma. The4:2:2 examples contrast the two horizontal locations; the4:2:0 example is horizontally interstitial and vertically co-sited. Sample location is distinct from the memory layout described in the companion planar-format page.

Primary source: www.kernel.org/doc/html/latest/userspace-api/media/v4l/planar-apis.html

Verified locator: §1.26 defines discontiguous frame sub-buffers and the multi-planar API; §1.26.1 distinguishes multi-planar formats from API usage and states that the multi-planar API can handle single-planar formats. Subsequent subsections identify explicit plane-description structures.

Primary author-hosted paper; definition of zero knowledge compares an expected polynomial-time simulator with the verifier’s interaction view. Author context www.wisdom.weizmann.ac.il/~oded/gmw.html identifies the1991 JACM paper.

Primary author tutorial, The Basics, and indexed full text www.wisdom.weizmann.ac.il/~oded/PSX/zk-tut02v4.pdf section8: single prover message and real/simulated shared-string/proof pairs. Direct full-text fetch timed out; indexed primary section verified. Examples are independently stipulated.