Skip to search formSkip to main contentSkip to account menu

Quadratic residuosity problem

Known as: Quadratic residuacity problem, Quadratic residuocity problem 
The quadratic residuosity problem in computational number theory is to decide, given integers and , whether is a quadratic residue modulo or not.Here… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Blum Blum ShubComputational complexity theoryComputational hardness assumptionComputational number theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
On Identity-Based Cryptosystems from Quadratic Residuosity
Three approaches are currently used for devising identity-based encryption schemes. They build on pairings, quadratic residues… 
2013
2013
A Probabilistic Data Encryption scheme (PDES)
In this paper the author presents a probabilistic encryption scheme that is polynomially secure and has the efficiency of… 
2011
2011
Practical Frameworks For h-Out-Of-n Oblivious Transfer With Security Against Covert and Malicious Adversaries
We present two practical frameworks for h-out-of-n oblivious transfer (OTn h ). The first one is secure against covert… 
2009
2009
A Variant of Boneh-Gentry-Hamburg's Pairing-Free Identity Based Encryption Scheme
In 2001, Cocks presented an elegent Identity Based Encryption (IBE) system based on standard quadratic residuocity problem modulo… 
2007
2007
A NEW THEOREM ABOUT THE QUADRATIC RESIDUOSITY PROBLEM
In this paper, we study the quadratic residuosity problem (QRP). Using the methods of integer classification, we give formulae of… 
2004
2004
ID-based Cryptography from Composite Degree Residuosity
We present identity-based identification (resp. encryption, signature, blind signature, ring signature) from composite degree… 
2001
2001
Private Information Retrieval for Streaming Data
We present a very simple Private Information Retrieval (PIR) protocol that is very eecient for streaming data. The protocol works… 
2001
2001
The decision diffie-hellman assumption and the quadratic residuosity assumption
2000
2000
Symmetrically Private Information Retrieval (Extended Abstract)
In this paper we present a single-round, single-server symmetrically private information retrieval scheme, in which privacy of… 
1992
1992
A comment on NIZK for 3 colorability
The paper presents a more efficient noninteractive zero knowledge proof system (NIZK) for 3 colorability. The length of the proof… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)