Randomly encoding functions: A new cryptographic paradigm(Invited Talk)

Benny Applebaum

doi:10.1007/978-3-642-20728-0_3

Randomly encoding functions: A new cryptographic paradigm(Invited Talk)

Benny Applebaum

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The notion of randomized encoding allows to represent a "complex" function f(x) by a "simpler" randomized mapping f̂(x;r) whose output distribution on an input x encodes the value of f(x). We survey several cryptographic applications of this paradigm.

Original language	English
Title of host publication	Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings
Pages	25-31
Number of pages	7
DOIs	https://doi.org/10.1007/978-3-642-20728-0_3
State	Published - 2011
Event	5th International Conference on Information Theoretic Security, ICITS 2011 - Amsterdam, Netherlands Duration: 21 May 2011 → 24 May 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6673 LNCS

Conference

Conference	5th International Conference on Information Theoretic Security, ICITS 2011
Country/Territory	Netherlands
City	Amsterdam
Period	21/05/11 → 24/05/11

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-20728-0_3

Cite this

Applebaum, B. (2011). Randomly encoding functions: A new cryptographic paradigm(Invited Talk). In Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings (pp. 25-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6673 LNCS). https://doi.org/10.1007/978-3-642-20728-0_3

@inproceedings{a783219fb6104ee38655f01f185d8596,

title = "Randomly encoding functions: A new cryptographic paradigm(Invited Talk)",

abstract = "The notion of randomized encoding allows to represent a {"}complex{"} function f(x) by a {"}simpler{"} randomized mapping {\^f}(x;r) whose output distribution on an input x encodes the value of f(x). We survey several cryptographic applications of this paradigm.",

author = "Benny Applebaum",

year = "2011",

doi = "10.1007/978-3-642-20728-0_3",

language = "الإنجليزيّة",

isbn = "9783642207273",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "25--31",

booktitle = "Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings",

note = "5th International Conference on Information Theoretic Security, ICITS 2011 ; Conference date: 21-05-2011 Through 24-05-2011",

}

Applebaum, B 2011, Randomly encoding functions: A new cryptographic paradigm(Invited Talk). in Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6673 LNCS, pp. 25-31, 5th International Conference on Information Theoretic Security, ICITS 2011, Amsterdam, Netherlands, 21/05/11. https://doi.org/10.1007/978-3-642-20728-0_3

Randomly encoding functions: A new cryptographic paradigm(Invited Talk). / Applebaum, Benny.
Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings. 2011. p. 25-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6673 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Randomly encoding functions

T2 - 5th International Conference on Information Theoretic Security, ICITS 2011

AU - Applebaum, Benny

PY - 2011

Y1 - 2011

N2 - The notion of randomized encoding allows to represent a "complex" function f(x) by a "simpler" randomized mapping f̂(x;r) whose output distribution on an input x encodes the value of f(x). We survey several cryptographic applications of this paradigm.

AB - The notion of randomized encoding allows to represent a "complex" function f(x) by a "simpler" randomized mapping f̂(x;r) whose output distribution on an input x encodes the value of f(x). We survey several cryptographic applications of this paradigm.

UR - http://www.scopus.com/inward/record.url?scp=79956298358&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-20728-0_3

DO - 10.1007/978-3-642-20728-0_3

M3 - منشور من مؤتمر

SN - 9783642207273

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 25

EP - 31

BT - Information Theoretic Security - 5th International Conference, ICITS 2011, Proceedings

Y2 - 21 May 2011 through 24 May 2011

ER -

Randomly encoding functions: A new cryptographic paradigm(Invited Talk)

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this