Encrypted function - Revision history

GoldRomean: ce

2024-05-30T11:24:15Z

← Previous revision		Revision as of 11:24, 30 May 2024
Line 1:		Line 1:
	An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives.		An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives.

	[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented, as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.		[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented, as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as mobile cryptography.

	==Example==		==Example==

	~~'''~~Scenario:~~'''~~		Scenario:
	Host ''A'', has an [[algorithm]] which computes function ''f''. ''A'' wants to send its [[mobile agent]] to ''B'' which holds input ''x'', to compute ''f''(''x''). But ''A'' doesn't want ''B'' to learn anything about ''f''.		Host A, has an [[algorithm]] which computes function f. A wants to send its [[mobile agent]] to B which holds input x, to compute f(x). But A doesn't want B to learn anything about f.

	~~'''~~Scheme:~~'''~~		Scheme:
	Function ''f'' is encrypted in a way that results in ''E''(''f''). Host ''A'' then creates another program ''P''(''E''(''f'')), which implements ''E''(''f''), and sends it to ''B'' through its agent. ''B'' then runs the agent, which computes ''P''(''E''(''f''))(''x'') and returns the result to ''A''. ''A'' then decrypts this to get ''f''(''x'').		Function f is encrypted in a way that results in E(f). Host A then creates another program P(E(f)), which implements E(f), and sends it to B through its agent. B then runs the agent, which computes P(E(f))(x) and returns the result to A. A then decrypts this to get f(x).

	~~'''~~Drawbacks:~~'''~~		Drawbacks:
	Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.		Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.

GoldRomean: removed copyrighted content

2024-05-30T11:22:52Z

removed copyrighted content

← Previous revision		Revision as of 11:22, 30 May 2024
Line 1:		Line 1:
	An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives ~~even though the code~~		An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives.
	*is executed in untrusted environments.
	*should run autonomously.

	[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented, as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.		[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented, as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.

GoldRomean: mos

2024-05-30T04:02:04Z

mos

← Previous revision		Revision as of 04:02, 30 May 2024
Line 17:		Line 17:

	== See also ==		== See also ==

	[[Homomorphic encryption]]		* [[Homomorphic encryption]]

	==References==		==References==

Naiwaar at 13:52, 13 December 2023

2023-12-13T13:52:09Z

← Previous revision		Revision as of 13:52, 13 December 2023
Line 3:		Line 3:
	*should run autonomously.		*should run autonomously.

	[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.		[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented, as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.

	==Example==		==Example==

Mccapra: Successfully de-orphaned! Wikiproject Orphanage: You can help!

2019-01-26T11:59:26Z

Successfully de-orphaned! Wikiproject Orphanage: You can help!

← Previous revision		Revision as of 11:59, 26 January 2019
Line 1:		Line 1:
	{{Orphan\|date=February 2009}}
	An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives even though the code		An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives even though the code
	*is executed in untrusted environments.		*is executed in untrusted environments.

Freeknowledgecreator: /* See also */ spelling

2018-07-15T22:09:08Z

67.53.145.211: added related link

2018-07-07T20:38:11Z

added related link

← Previous revision		Revision as of 20:38, 7 July 2018
Line 16:		Line 16:
	'''Drawbacks:'''		'''Drawbacks:'''
	Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.		Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.

			== See Also ==
			[[Homomorphic encryption]]

	==References==		==References==

Yobot: WP:CHECKWIKI error fixes + other fixes using AWB (10065)

2014-03-28T16:44:41Z

WP:CHECKWIKI error fixes + other fixes using AWB (10065)

← Previous revision		Revision as of 16:44, 28 March 2014
Line 4:		Line 4:
	*should run autonomously.		*should run autonomously.

	[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.		[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.

	==Example==		==Example==
Line 19:		Line 19:
	==References==		==References==

	* Thomas Sander and Christian F. Tschudin. ''Protecting Mobile Agents Against Malicious Hosts.'' In G. Vigna, editor, Mobile agents and security, volume 1419 of Lecture Notes in Computer Science, pages ~~44--60~~. Springer-Verlag, New York, NY, 1998. [http://citeseer.ist.psu.edu/cache/papers/cs/16015/http:zSzzSzwww.icsi.berkeley.eduzSz~tschudinzSzpszSzma-security.pdf/sander98protecting.pdf]		* Thomas Sander and Christian F. Tschudin. ''Protecting Mobile Agents Against Malicious Hosts.'' In G. Vigna, editor, Mobile agents and security, volume 1419 of Lecture Notes in Computer Science, pages 44–60. Springer-Verlag, New York, NY, 1998. [http://citeseer.ist.psu.edu/cache/papers/cs/16015/http:zSzzSzwww.icsi.berkeley.eduzSz~tschudinzSzpszSzma-security.pdf/sander98protecting.pdf]

	[[Category:Cryptography]]		[[Category:Cryptography]]


	{{comp-sci-stub}}		{{comp-sci-stub}}

Addbot: Bot: Adding Orphan Tag (Report Errors)

2009-02-14T14:17:41Z

Bot: Adding Orphan Tag (Report Errors)

← Previous revision		Revision as of 14:17, 14 February 2009
Line 1:		Line 1:
			{{Orphan\|date=February 2009}}
	An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives even though the code		An '''encrypted function''' is an attempt to provide [[mobile code]] privacy without providing any [[tamper-resistance\|tamper-resistant]] hardware. It is a method where in mobile code can carry out [[cryptography\|cryptographic]] primitives even though the code
	*is executed in untrusted environments.		*is executed in untrusted environments.

Psiphiorg: wording, punctuation

2008-09-29T21:53:55Z

wording, punctuation

← Previous revision		Revision as of 21:53, 29 September 2008
Line 3:		Line 3:
	*should run autonomously.		*should run autonomously.

	[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would ~~of course~~ not understand the ~~program’s~~ function. This field of study is gaining popularity as ''mobile cryptography''.		[[polynomial function\|Polynomial]] and [[rational function]]s are [[encrypted]] such that their transformation can again be implemented as programs consisting of [[cleartext]] instructions that a [[central processing unit\|processor]] or [[interpreter (computing)\|interpreter]] understands. The processor would not understand the program's function. This field of study is gaining popularity as ''mobile cryptography''.

	==Example==		==Example==

	'''Scenario:'''		'''Scenario:'''
	Host ''A'', has an [[algorithm]] which computes function ''f''. ''A'' wants to send its [[mobile agent]] to ''B'' which holds input ''x'', to compute ''f''(''x''). But ''A'' ~~doesn’t~~ want ''B'' to learn anything about ''f''.		Host ''A'', has an [[algorithm]] which computes function ''f''. ''A'' wants to send its [[mobile agent]] to ''B'' which holds input ''x'', to compute ''f''(''x''). But ''A'' doesn't want ''B'' to learn anything about ''f''.

	'''Scheme:'''		'''Scheme:'''
Line 14:		Line 14:

	'''Drawbacks:'''		'''Drawbacks:'''
	Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme ~~doesn’t~~ prevent [[denial of service]], replay, [[experimental extraction]] and others.		Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.

	==References==		==References==

← Previous revision		Revision as of 22:09, 15 July 2018
Line 17:		Line 17:
	Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.		Finding appropriate encryption schemes that can transform arbitrary functions is a challenge. The scheme doesn't prevent [[denial of service]], replay, [[experimental extraction]] and others.

	== See ~~Also~~ ==		== See also ==
	[[Homomorphic encryption]]		[[Homomorphic encryption]]