Constructions of PRF (Pseudo Random Function)The Goldreich-Goldwasser-Micali Construction with bad...
Does a large simulator bay have standard public address announcements?
How do I reattach a shelf to the wall when it ripped out of the wall?
What makes accurate emulation of old systems a difficult task?
How to denote matrix elements succinctly?
How can I display numbers like 2 over 2, but not have them as fractions?
"The cow" OR "a cow" OR "cows" in this context
Why does nature favour the Laplacian?
"You've called the wrong number" or "You called the wrong number"
Is there any official lore on the Far Realm?
Can I criticise the more senior developers around me for not writing clean code?
What causes platform events to fail to be published and should I cater for failed platform event creations?
Don’t seats that recline flat defeat the purpose of having seatbelts?
What does the integral of a function times a function of a random variable represent, conceptually?
What is the most expensive material in the world that could be used to create Pun-Pun's lute?
As an international instructor, should I openly talk about my accent?
What's the polite way to say "I need to urinate"?
Was there a Viking Exchange as well as a Columbian one?
Is Diceware more secure than a long passphrase?
What are the steps to solving this definite integral?
How can I practically buy stocks?
Multiple options vs single option UI
Check if a string is entirely made of the same substring
Can an Area of Effect spell cast outside a Prismatic Wall extend inside it?
What happens to Mjolnir (Thor's hammer) at the end of Endgame?
Constructions of PRF (Pseudo Random Function)
The Goldreich-Goldwasser-Micali Construction with bad PRGSSecurity of KDF1 and KDF2 (hash based KDF's)Implementing a pseudo random function in practiceCryptanalysis of Marvin32 compared to SipHashPseudo Random FunctionWhy is this function pseudo random (PRF)?Decentralized consent over a random numberExistence of PRF $implies$ existence of PRGDoes a distinguisher for an PRF based on a hash make the hash function insecure?Can we convert a pseudorandom function (PRF) to an Oblivious PRF (OPRF) through an Oblivious Transfer (OT) protocol?
$begingroup$
I was taught only GGM based PRF construction in class. It's very inefficient. I am just curious about various PRF constructions from standard assumptions. Please provide a few PRF constructions from various assumptions.
pseudo-random-generator pseudo-random-function
asked 4 hours ago
satyasatya
441317
$endgroup$
add a comment |
$begingroup$
I was taught only GGM based PRF construction in class. It's very inefficient. I am just curious about various PRF constructions from standard assumptions. Please provide a few PRF constructions from various assumptions.
pseudo-random-generator pseudo-random-function
asked 4 hours ago
satyasatya
441317
$endgroup$
$begingroup$
Well, one standard assumption is that the SHA-256 compression function is a PRF, from which we can conclude that HMAC-SHA256 is a PRF (and a reasonably efficient one at that), but maybe you meant to restrict the domain of ‘standard assumptions’?
$endgroup$
– Squeamish Ossifrage
3 hours ago
add a comment |
$begingroup$
I was taught only GGM based PRF construction in class. It's very inefficient. I am just curious about various PRF constructions from standard assumptions. Please provide a few PRF constructions from various assumptions.
pseudo-random-generator pseudo-random-function
asked 4 hours ago
satyasatya
441317
$endgroup$
I was taught only GGM based PRF construction in class. It's very inefficient. I am just curious about various PRF constructions from standard assumptions. Please provide a few PRF constructions from various assumptions.
pseudo-random-generator pseudo-random-function
pseudo-random-generator pseudo-random-function
asked 4 hours ago
satyasatya
441317
asked 4 hours ago
satyasatya
441317
asked 4 hours ago
satyasatya
441317
asked 4 hours ago
satyasatya
441317
asked 4 hours ago
satyasatya
441317
441317
$begingroup$
Well, one standard assumption is that the SHA-256 compression function is a PRF, from which we can conclude that HMAC-SHA256 is a PRF (and a reasonably efficient one at that), but maybe you meant to restrict the domain of ‘standard assumptions’?
$endgroup$
– Squeamish Ossifrage
3 hours ago
add a comment |
$begingroup$
Well, one standard assumption is that the SHA-256 compression function is a PRF, from which we can conclude that HMAC-SHA256 is a PRF (and a reasonably efficient one at that), but maybe you meant to restrict the domain of ‘standard assumptions’?
$endgroup$
– Squeamish Ossifrage
3 hours ago
$begingroup$
Well, one standard assumption is that the SHA-256 compression function is a PRF, from which we can conclude that HMAC-SHA256 is a PRF (and a reasonably efficient one at that), but maybe you meant to restrict the domain of ‘standard assumptions’?
$endgroup$
– Squeamish Ossifrage
3 hours ago
$begingroup$
Well, one standard assumption is that the SHA-256 compression function is a PRF, from which we can conclude that HMAC-SHA256 is a PRF (and a reasonably efficient one at that), but maybe you meant to restrict the domain of ‘standard assumptions’?
$endgroup$
– Squeamish Ossifrage
3 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The most common efficient PRFs from specific assumptions are:
The Naor-Reingold PRF, which is based on the decision Diffie-Hellman assumption (DDH), and
The BPR PRF, which is based on the learning with error assumption (LWE).
Perhaps slightly less well-known is the NRR PRF, which is based on the hardness of factoring.
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "281"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f70083%2fconstructions-of-prf-pseudo-random-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The most common efficient PRFs from specific assumptions are:
The Naor-Reingold PRF, which is based on the decision Diffie-Hellman assumption (DDH), and
The BPR PRF, which is based on the learning with error assumption (LWE).
Perhaps slightly less well-known is the NRR PRF, which is based on the hardness of factoring.
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
$endgroup$
add a comment |
$begingroup$
The most common efficient PRFs from specific assumptions are:
The Naor-Reingold PRF, which is based on the decision Diffie-Hellman assumption (DDH), and
The BPR PRF, which is based on the learning with error assumption (LWE).
Perhaps slightly less well-known is the NRR PRF, which is based on the hardness of factoring.
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
$endgroup$
add a comment |
$begingroup$
The most common efficient PRFs from specific assumptions are:
The Naor-Reingold PRF, which is based on the decision Diffie-Hellman assumption (DDH), and
The BPR PRF, which is based on the learning with error assumption (LWE).
Perhaps slightly less well-known is the NRR PRF, which is based on the hardness of factoring.
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
$endgroup$
The most common efficient PRFs from specific assumptions are:
The Naor-Reingold PRF, which is based on the decision Diffie-Hellman assumption (DDH), and
The BPR PRF, which is based on the learning with error assumption (LWE).
Perhaps slightly less well-known is the NRR PRF, which is based on the hardness of factoring.
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
answered 4 hours ago
Geoffroy CouteauGeoffroy Couteau
9,29011834
9,29011834
add a comment |
add a comment |
Thanks for contributing an answer to Cryptography Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f70083%2fconstructions-of-prf-pseudo-random-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Well, one standard assumption is that the SHA-256 compression function is a PRF, from which we can conclude that HMAC-SHA256 is a PRF (and a reasonably efficient one at that), but maybe you meant to restrict the domain of ‘standard assumptions’?
$endgroup$
– Squeamish Ossifrage
3 hours ago